Results 21 to 30 of about 1,698,712 (321)
Order-Invariant First-Order Logic over Hollow Trees [PDF]
, 2020 We show that the expressive power of order-invariant first-order logic collapses to first-order logic over hollow trees. A hollow tree is an unranked ordered tree where every non leaf node has at most four adjacent nodes: two siblings (left and right ...
Grange, Julien, Segoufin, Luc
core +4 more sources
A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]
Logical Methods in Computer Science, 2022 The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL.
Michele Chiari +2 more
doaj +1 more source
Completeness classes for intuitionistic first-order temporal logic with time gaps
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
Continuous first order logic and local stability [PDF]
, 2008 We develop continuous first order logic, a variant of the logic described in \cite{Chang-Keisler:ContinuousModelTheory}. We show that this logic has the same power of expression as the framework of open Hausdorff cats, and as such extends Henson's logic ...
Usvyatsov, Alexander, Yaacov, Itaï Ben
core +5 more sources
THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC
The Journal of Symbolic Logic, 2022 AbstractWe prove that the first-order logic of CZF is intuitionistic first-order logic. To do so, we introduce a new model of transfinite computation (Set Register Machines) and combine the resulting notion of realisability with Beth semantics. On the way, we also show that the propositional admissible rules of CZF are exactly those of intuitionistic ...
openaire +4 more sources
A first-order logic for string diagrams [PDF]
, 2015 Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax called !-box ...
Kissinger, Aleks, Quick, David
core +2 more sources
On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic [PDF]
Journal of Universal Computer Science, 2021 There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during
Ashot Baghdasaryan, Hovhannes Bolibekyan
doaj +3 more sources
Annals of Pure and Applied Logic, 2013 From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models.
Awodey, Steve, Forssell, Henrik
openaire +2 more sources
A Denotational Semantics for First-Order Logic [PDF]
, 2000 In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic.
E. M. Clarke +9 more
core +4 more sources