A computational glimpse at the Leibniz and Frege hierarchies

DOI10.1016/j.apal.2017.07.003zbMath1391.03045arXiv1908.00922OpenAlexW2739404527WikidataQ122969939 ScholiaQ122969939MaRDI QIDQ1676326

Tommaso Moraschini

Publication date: 6 November 2017

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.00922

zbMATH Keywords

decidabilityrelation algebraabstract algebraic logicDiophantine equationLeibniz congruenceLeibniz hierarchyFrege hierarchy

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Decidability of theories and sets of sentences (03B25) Cylindric and polyadic algebras; relation algebras (03G15) Diophantine equations (11D99) Abstract algebraic logic (03G27)

Related Items (4)

ON EQUATIONAL COMPLETENESS THEOREMS ⋮ A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS ⋮ Abstract algebraic logic. An introductory chapter ⋮ On the complexity of the Leibniz hierarchy

Cites Work

• A note on congruences of semilattices with sectionally finite height.
• Theory of logical calculi. Basic theory of consequence operations
• A survey of abstract algebraic logic
• Algebraic characterizations of various Beth definability properties
• Fregean logics with the multiterm deduction theorem and their algebraization
• Epimorphisms in varieties of residuated structures
• The Beth property in algebraic logic
• Algebraizable logics
• Logics of varieties, logics of semilattices and conjunction
• Protoalgebraic logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational glimpse at the Leibniz and Frege hierarchies