Results 261 to 270 of about 32,356 (302)

On One Approach to Goal-Driven Proof Search in Classical First-Order Logic

2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2020
An approach to a computer-oriented proof search in classical first-order logic leading to the construction of goal-driven sequent calculi that do not require skolemzation and one of which is a quantifier-rules-free one is presented. Results about the soundness and completeness of proposed sequent calculi are obtained through establishing their ...
Alexander Lyaletski
exaly   +2 more sources

Towards depth-bounded natural deduction for classical first-order logic [PDF]

FLAP, 2021
Summary: In this paper we lay the foundations of a new proof-theory for classical first-order logic that allows for a natural characterization of a notion of inferential depth. The approach we propose here aims towards extending the proof-theoretical framework presented by \textit{M. D'Agostino} et al. [Stud. Log. 108, No.
D’agostino, Marcello, Larese, Costanza, Modgil, Sanjay   +2 more
core   +4 more sources

First Order Extensions of Classical Systems of Modal Logic; The role of the Barcan schemas

Studia Logica, 2002
The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames.
Horacio Arlo-Costa (5372540)
openaire   +2 more sources

On the Undecidability of Some Sub-classical First-Order Logics

1999
A general criterion for the undecidabily of sub-classical first-order logics and important fragments thereof is established. It is applied, among others, to Urquart's (original version of) C and the closely related logic C*. In addition, hypersequent systems for (first-order) C and C* are introduced and shown to enjoy cut-elimination.
Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith   +3 more
openaire   +1 more source

Embedding first-order classical logic into Gurevich's extended first-order intuitionistic logic: the role of strong negation [PDF]

FLAP, 2023
Summary: In this study, a theorem for embedding first-order classical logic into Gurevich's extended first-order intuitionistic logic with strong negation is investigated in terms of the Gödel-Gentzen negative translation. First, an alternative cut-free Gentzen-style sequent calculus ELK for first-order classical logic is introduced to extend Gentzen's
openaire   +1 more source

Dual Tableau for Classical First-Order Logic

2010
In [RS60] Rasiowa and Sikorski developed a deduction system for classical first-order logic without identity. Their aim was to present a system which is a realization of the Beth idea of the analytic tableau [Bet59] and, in contrast with the Gentzen system [Gen34] which required the cut rule in the proof of completeness, was cut free.
Ewa Orłowska, Joanna Golińska-Pilarek
openaire   +1 more source