Results 11 to 20 of about 32,356 (302)
A herbrandized functional interpretation of classical first-order logic [PDF]
Archive for Mathematical Logic, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernando Ferreira +2 more
exaly +4 more sources
First-Order Classical Modal Logic [PDF]
Studia Logica, 2006 This paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic.
Horacio L. Arló-Costa, Eric Pacuit
openaire +2 more sources
Completeness for the Classical Antecedent Fragment of Inquisitive First-Order Logic [PDF]
Journal of Logic, Language and Information, 2021 AbstractInquisitive first order logic "Equation missing" is an extension of first order classical logic, introducing questions and studying the logical relations between questions and quantifiers. It is not known whether "Equation missing" is recursively axiomatizable, even though an axiomatization has been found for fragments of the logic (Ciardelli ...
Gianluca Grilletti, Grilletti Gianluca
exaly +4 more sources
, 2022 One is often said to be reasoning well when they are reasoning logically. Many attempts to say what logical reasoning is have been proposed, but one commonly proposed system is first-order classical logic. This Element will examine the basics of first-order classical logic and discuss some surrounding philosophical issues. The first half of the Element
Shapiro, Stewart, Kouri-Kissel, Teresa
openaire +2 more sources
Game semantics for first-order logic [PDF]
Logical Methods in Computer Science, 2010 We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results.
Olivier Laurent
doaj +2 more sources
A Syntactic Proof of the Decidability of First-Order Monadic Logic
Bulletin of the Section of LogicDecidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Eugenio Orlandelli, Matteo Tesi
doaj +2 more sources
Herbrand-Confluence for Cut Elimination in Classical First Order Logic. [PDF]
, 2012 We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing. In this work we take a coarser (and mathematically more realistic) look at cut-free proofs.
Hetzl, Stefan, Strassburger, Lutz
openaire +4 more sources
On Presburger arithmetic extended with non-unary counting quantifiers [PDF]
Logical Methods in Computer Science, 2023 We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are given as terms ...
Peter Habermehl, Dietrich Kuske
doaj +1 more source
The Dialectica interpretation of first-order classical affine logic
Theory and Applications of Categories, 2006 Summary: We give a Dialectica-style interpretation of first-order classical affine logic. By moving to a contraction-free logic, the translation (a.k.a. D-translation) of a first-order formula into a higher-type \(\exists\forall\)-formula can be made symmetric with respect to duality, including exponentials.
Masaru Shirahata
openaire +3 more sources
Games and cardinalities in inquisitive first-order logic [PDF]
, 2023 Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures.
Ciardelli, I., Grilletti, G.
core +2 more sources