The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Filters
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized delta-Rule but Without Skolemization
[article]
2009
arXiv
pre-print
Preserved Fulltext
We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. ...
Our main motivation is to provide the foundation for our work on inductive theorem proving, where the preservation of solutions is indispensable. ...
preservation of solutions in full first-order logic. ...
arXiv:0902.3730v1
fatcat:dxjicelbinawhgqqmrynpac4ui
, , and Non-Permutability of -Steps
2012
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
and delta+-steps (according to Smullyan's classification), which is not visible with non-liberalized delta-rules and not serious with further liberalized delta-rules, such as the delta++-rule. ...
Besides a careful presentation of the search for a proof of (lim+) with several pedagogical intentions, the main subject is to explain why the order of beta-steps plays such a practically important role ...
I would also like to thank the lecturers and students of the course (Autexier et al., 2004/05) ...
doi:10.1016/j.jsc.2011.12.035
fatcat:g2uh2ml62zgi7bnoffo74dczgi
2015 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM '15 Helsinki, Finland August 3–8, 2015
2016
Bulletin of Symbolic Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
When one attempts to develop the model theory of a logic generalizing first order logic, one runs into the problem that model theoretic properties of the logic like compactness, Löwenheim-Skolem Theorem ...
Many interesting properties of mathematical structures and elements of such structures can not be expressed in first order logic. ...
It is known that in Frege systems there are the trivial exponential upper bounds and only Ω(n 2 ) bounds of proof size and Ω(n) bounds of proof steps for tautologies with the size n [1]. ...
doi:10.1017/bsl.2016.22
fatcat:cm4a5yyvgfajzm4qvlszviblni
Deduction (Dagstuhl Seminar 9709)
1997
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
During this seminar we had 41 talks, a panel, and a discussion how system implementors could cooperate. ...
Dagstuhl, a place being developed exclusively for research activities in Computer Science, provides an excellent atmosphere for researchers to meet and exchange ideas. ...
This means that we use a Skolemization for the term-and prefixvariables which is similar to some liberalized δ-rule in the classical tableau calculus. ...
doi:10.4230/dagsemrep.170
fatcat:fhfa53fa2zb57lpr4kmlanopma
Dagstuhl Report Deduction
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This means that we use a Skolemization for the term-and prefixvariables which is similar to some liberalized δ-rule in the classical tableau calculus. ...
Melvin Fitting, City University of New York
First-Order Modal Logics The talk consisted of a brief sketch of the complexities that must be addressed in a full treatment of first-order modal logic(s). ...
We (dynamically) abstract the given clause set into a decidable fragment of first-order logic. ...
fatcat:ndajusqjavd2hbjffkarwf4fae