Sciweavers

98 search results - page 2 / 20
» Combinations of Theories for Decidable Fragments of First-Or...
Sort
View
LICS
2010
IEEE
13 years 3 months ago
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
Yuguo He
CADE
2005
Springer
14 years 5 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
TIME
2008
IEEE
13 years 12 months ago
Decomposition of Decidable First-Order Logics over Integers and Reals
We tackle the issue of representing infinite sets of realvalued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose ...
Florent Bouchy, Alain Finkel, Jérôme ...
LICS
1999
IEEE
13 years 9 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
FUIN
2007
135views more  FUIN 2007»
13 years 5 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner