Trees and finite satisfiability: proof of a conjecture of Burgess

DOI10.1305/ndjfl/1093870624zbMath0561.03004OpenAlexW2039142144WikidataQ122939431 ScholiaQ122939431MaRDI QIDQ2266003

George Boolos

Publication date: 1984

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093870624

zbMATH Keywords

first order logicfinite satisfiabilitymethod of trees

Mathematics Subject Classification ID

Classical first-order logic (03B10) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (5)

Independent set readings and generalized quantifiers ⋮ SUBFORMULA AND SEPARATION PROPERTIES IN NATURAL DEDUCTION VIA SMALL KRIPKE MODELS ⋮ Wittgensteinian tableaux, identity, and co-denotation ⋮ Abduction via C-tableaux and δ-resolution ⋮ Finite tree property for first-order logic with identity and functions

This page was built for publication: Trees and finite satisfiability: proof of a conjecture of Burgess