On decision procedures for sentential logics

DOI10.1007/BF00370180zbMath0739.03010OpenAlexW1974558183MaRDI QIDQ1181478

Tomasz Skura

Publication date: 27 June 1992

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370180

zbMATH Keywords

decidabilityHarrop's criterionŁukasiewicz-style refutation proceduresTarski consequence operators

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Abstract deductive systems (03B22)

Related Items (4)

Refutation systems in modal logic ⋮ Syntactic refutations against finite models in modal logic ⋮ HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS ⋮ Paraconsistency in classical logic

Cites Work

• Semantical investigations in Heyting's intuitionistic logic
• \(2^{\aleph_0}\) varieties of Heyting algebras not generated by their finite members
• Theory of rejected propositions. I
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On decision procedures for sentential logics