Sciweavers

Share
30 search results - page 1 / 6
» First-Order Logic with Reachability Predicates on Infinite S...
Sort
View
FSTTCS
2010
Springer
10 years 2 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
ICALP
2000
Springer
10 years 7 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
LICS
1999
IEEE
10 years 8 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
FROCOS
2000
Springer
10 years 7 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
CORR
2007
Springer
147views Education» more  CORR 2007»
10 years 4 months ago
Model Checking Synchronized Products of Infinite Transition Systems
Formal veriļ¬cation using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the speciļ¬cation logic...
Stefan Wöhrle, Wolfgang Thomas
books