A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
From MaRDI portal
Publication:5729293
DOI10.1073/pnas.49.6.828zbMath0118.24901OpenAlexW2046306553WikidataQ34396441 ScholiaQ34396441MaRDI QIDQ5729293
Publication date: 1963
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.49.6.828
Related Items (18)
Cut-elimination for quantified conditional logic ⋮ Linear reasoning in modal logic ⋮ Uniform Gentzen systems ⋮ Resolution in type theory ⋮ On the model theory of denumerably long formulas with finite strings of quantifiers ⋮ Systematization of finite many-valued logics through the method of tableaux ⋮ Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic ⋮ Jean van Heijenoort's contributions to proof theory and its history ⋮ Analytic tableaux for higher-order logic with choice ⋮ Unnamed Item ⋮ The foundations of Suslin logic ⋮ Fragments of first order logic, I: universal Horn logic ⋮ Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems ⋮ Relevant analytic tableaux ⋮ Universal abstract consistency class and universal refutation ⋮ Trees and nest structures ⋮ Reducing higher-order theorem proving to a sequence of SAT problems ⋮ Σ1 compactness for next admissible sets
This page was built for publication: A UNIFYING PRINCIPAL IN QUANTIFICATION THEORY
