Induction and Skolemization in saturation theorem proving

&
Annals of Pure and Applied Logic 174 (1):103167 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2022.103167

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Inductive theorem proving based on tree grammars.Sebastian Eberhard & Stefan Hetzl - 2015 - Annals of Pure and Applied Logic 166 (6):665-700.
Generic expansion and Skolemization in NSOP 1 theories.Alex Kruckman & Nicholas Ramsey - 2018 - Annals of Pure and Applied Logic 169 (8):755-774.
A new look at interpretability and saturation.M. Malliaris & S. Shelah - 2019 - Annals of Pure and Applied Logic 170 (5):642-671.
Weak saturation properties and side conditions.Monroe Eskew - 2024 - Annals of Pure and Applied Logic 175 (1):103356.
Saturation properties for compositional truth with propositional correctness.Bartosz Wcisło - 2025 - Annals of Pure and Applied Logic 176 (2):103512.
Saturation and simple extensions of models of peano arithmetic.Matt Kaufmann & James H. Schmerl - 1984 - Annals of Pure and Applied Logic 27 (2):109-136.
The Skolemization of existential quantifiers in intuitionistic logic.Matthias Baaz & Rosalie Iemhoff - 2006 - Annals of Pure and Applied Logic 142 (1):269-295.
Multicomponent proof-theoretic method for proving interpolation properties.Roman Kuznets - 2018 - Annals of Pure and Applied Logic 169 (12):1369-1418.
Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
A cut elimination theorem for stationary logic.M. E. Szabo - 1987 - Annals of Pure and Applied Logic 33 (C):181-193.

Analytics

Added to PP
2022-07-29

Downloads
18 (#1,108,436)

6 months
8 (#574,086)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Quantifier-free induction for lists.Stefan Hetzl & Jannik Vierling - 2024 - Archive for Mathematical Logic 63 (7):813-835.

Add more citations

References found in this work

On parameter free induction schemas.R. Kaye, J. Paris & C. Dimitracopoulos - 1988 - Journal of Symbolic Logic 53 (4):1082-1097.
A compact representation of proofs.Dale A. Miller - 1987 - Studia Logica 46 (4):347 - 370.
On the complexity of proof deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.
A Computational Logic.Robert S. Boyer & J. Strother Moore - 1990 - Journal of Symbolic Logic 55 (3):1302-1304.

View all 10 references / Add more references