Algebraizing first-order logics

Název projektu anglicky
Algebraizing first-order logics
Anotace anglicky
The last 50 years saw the introduction of many logical systems going beyond clasical two-valued logic, with motivations coming from fields such as computer science, philosophy, game theory, and linguistics. In response to this multitude of logics, a general algebraic theory of non-classical propositional logics called abstract algebraic logic (AAL) was gradually developed. However, no satisfactory algebraic theory of comparable strength and generality exists at the first-order level. The main reason is that first-order quantifiers are cumbersome to handle using the standard methods of universal algebra. The aim of the project is to develop such a general theory by combining the methods of AAL with an analysis of quantification based on so-called nominal algebras, and to apply this theory to settle open questions about interpolation and Beth definability in non-classical first-order logics. Algebraizing first-order quantification in this way will also enable us to apply profinite methods from algebraic automata theory in the finite model theory of classical and non-classical logics.

Kategorie VaV
ZV - Základní výzkum
OECD FORD - hlavní obor
10101 - Pure mathematics
OECD FORD - vedlejší obor
—
OECD FORD - další vedlejší obor
—
CEP - odpovídající obory <br>(dle <a href="http://www.vyzkum.cz/storage/att/E6EF7938F0E854BAE520AC119FB22E8D/Prevodnik_oboru_Frascati.pdf">převodníku</a>)
BA - Obecná matematika

Důvěrnost údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Systémové označení dodávky dat
CEP26-GA0-GM-R
Datum dodání záznamu
27. 4. 2026

Podobné projekty(10)