Results 21 to 30 of about 1,546,334 (124)

A note on the expressive power of linear orders [PDF]

open access: yes, 2011
This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Anuj Dawar, Kees Doets, Steven Lindell,   +8 more
core   +2 more sources

One-dimensional fragment of first-order logic [PDF]

open access: yes, 2014
We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the ...
Hella, Lauri, Kuusisto, Antti
core  

Completeness for a First-order Abstract Separation Logic

open access: yes, 2016
Existing work on theorem proving for the assertion language of separation logic (SL) either focuses on abstract semantics which are not readily available in most applications of program verification, or on concrete models for which completeness is not ...
AS Troelstra   +17 more
core   +1 more source

The first-order logic of CZF is intuitionistic first-order logic

open access: yes, 2022
We 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.
Passmann, Robert
core  

Characterizing downwards closed, strongly first order, relativizable dependencies

open access: yes, 2019
In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence.
Galliani, Pietro
core   +1 more source

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

open access: yes, 2011
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 ...
Grohe, Martin, Schweikardt, Nicole
core  

Deciding regular grammar logics with converse through first-order logic

open access: yes, 2003
We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic.
de Nivelle, Hans, Demri, Stephane
core   +4 more sources

A first-order Temporal Logic for Actions

open access: yes, 2006
We present a multi-modal action logic with first-order modalities, which contain terms which can be unified with the terms inside the subsequent formulas and which can be quantified. This makes it possible to handle simultaneously time and states.
Schwind, Camilla
core   +1 more source

Home - About - Disclaimer - Privacy