Fundamental logic is decidable

DOI10.1145/3665328MaRDI QIDQ6610195zbMATH OpenFDO

Authors Juan P. Aguilera, J. Bydžovský

Publication date 25 September 2024

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3665328

zbMATH Keywords

fundamental logicnon-classical logicorthologicsequent calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• Choice-free Stone duality
• On different proof-search strategies for orthologic
• Proof theory
• The number of axioms
• Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs

This page was built for publication: Fundamental logic is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610195)