The Poset of All Logics III: Finitely Presentable Logics

Autor:	Tommaso Moraschini, Ramon Jansana
Rok vydání:	2020
Předmět:	Pure mathematics Logic Finite language 010102 general mathematics Binary number 06 humanities and the arts 0603 philosophy ethics and religion 01 natural sciences TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES History and Philosophy of Science Computer Science::Logic in Computer Science 060302 philosophy 0101 mathematics Computational linguistics Partially ordered set Mathematics Counterexample
Zdroj:	Studia Logica. 109:539-580
ISSN:	1572-8730 0039-3215
DOI:	10.1007/s11225-020-09916-z
Popis:	A logic in a finite language is said to be finitely presentable if it is axiomatized by finitely many finite rules. It is proved that binary non-indexed products of logics that are both finitely presentable and finitely equivalential are essentially finitely presentable. This result does not extend to binary non-indexed products of arbitrary finitely presentable logics, as shown by a counterexample. Finitely presentable logics are then exploited to introduce finitely presentable Leibniz classes, and to draw a parallel between the Leibniz and the Maltsev hierarchies.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9bfbe2a9fd88bea40a1d597e226945a0 https://doi.org/10.1007/s11225-020-09916-z Zobrazit plný text záznamu Full text from SpringerLink