An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models

DOI10.1016/j.entcs.2008.03.067zbMath1277.03025OpenAlexW2057038881MaRDI QIDQ2866740

Ana Teresa Martins, Alexandre Matos Arruda

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.03.067

zbMATH Keywords

proof theoryfinite model theoryleast fixed-point logicinfinitary natural deduction system

Mathematics Subject Classification ID

Logic in computer science (03B70) Model theory of finite structures (03C13) Proof theory in general (including proof-theoretic semantics) (03F03)

Cites Work

• Elements of finite model theory.
• Upper and lower bounds for first order expressibility
• Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• A Deductive System for Existential Least Fixpoint Logic
• The completeness of the first-order functional calculus
• Logic and structure.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models