Results 11 to 20 of about 132,970 (251)

Stability-based Term Evaluation Method in First-order Logic [PDF]

open access: yesJisuanji gongcheng, 2019
To address the complex term structure and difficult extraction of grammatical and semantic features in first-order logic,this paper analyzes the constraints and measurement rules of Herbrand semantic features of a term in text replacement.On this basis ...
ZHONG Jian, XU Yang, CHEN Shuwei, HE Xingxing
doaj   +1 more source

Omitting Types in Fragments and Extensions of First Order Logic

open access: yesBulletin of the Section of Logic, 2021
Fix \(2 < n < \omega\). Let \(L_n\) denote first order logic restricted to the first n variables. Using the machinery of algebraic logic, positive and negative results on omitting types are obtained for \(L_n\) and for infinitary variants and extensions ...
Tarek Sayed Ahmed
doaj   +1 more source

A first-order logic characterization of safety and co-safety languages [PDF]

open access: yesLogical Methods in Computer Science, 2023
Linear Temporal Logic (LTL) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Among the various reasons of its widespread use there are its strong foundational properties: LTL is equivalent to ...
Alessandro Cimatti   +4 more
doaj   +1 more source

The succinctness of first-order logic on linear orders [PDF]

open access: yesLogical Methods in Computer Science, 2005
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the ...
Martin Grohe, Nicole Schweikardt
doaj   +1 more source

FIRST-ORDER HOMOTOPICAL LOGIC

open access: yesThe Journal of Symbolic Logic, 2023
AbstractWe introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We then use this formulation to prove the central property of this interpretation, namely homotopy invariance ...
openaire   +3 more sources

On the Mints Hierarchy in First-Order Intuitionistic Logic [PDF]

open access: yesLogical Methods in Computer Science, 2017
We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments.
Aleksy Schubert   +2 more
doaj   +1 more source

Distributed First Order Logic

open access: yesArtificial Intelligence, 2017
Distributed First Order Logic (DFOL) has been introduced more than ten years ago with the purpose of formalising distributed knowledge-based systems, where knowledge about heterogeneous domains is scattered into a set of interconnected modules.
Chiara Ghidini, Luciano Serafini
openaire   +3 more sources

A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]

open access: yesLogical 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

THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC

open access: yesThe 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

On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic [PDF]

open access: yesJournal 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

Home - About - Disclaimer - Privacy