Results 1 to 10 of about 142,368 (119)
Making first order linear logic a generating grammar [PDF]
Logical Methods in Computer Science, 2023 It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj +1 more source
Positive First-order Logic on Words and Graphs [PDF]
Logical Methods in Computer Science, 2023 We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+.
Denis Kuperberg
doaj +1 more source
Interactive Interpretation Viewer for Typed First-order Logic
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2023 This poster describes the Interactive Interpretation Viewer - IIV, for finite interpretations in typed first-order logic written in the (new) TPTP format for interpretations.
Jack McKeown, Geoff Sutcliffe
doaj +1 more source
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 +1 more source
Successor-Invariant First-Order Logic on Classes of Bounded Degree [PDF]
Logical Methods in Computer Science, 2021 We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is independent of the ...
Julien Grange
doaj +1 more source
Separating Regular Languages with First-Order Logic [PDF]
Logical Methods in Computer Science, 2016 Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there exists a first ...
Thomas Place, Marc Zeitoun
doaj +1 more source
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
Some Turing-Complete Extensions of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations.
Antti Kuusisto
doaj +1 more source
The succinctness of first-order logic on linear orders [PDF]
Logical 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
Stability-based Term Evaluation Method in First-order Logic [PDF]
Jisuanji 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