13 search results - page 1 / 3 » Decidable Theories of the Ordering of Natural Numbers with U... |
CSL
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
IANDC
2007
13 years 4 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
TCS
2008
13 years 4 months ago
2008
We develop a unified framework for dealing with constructibility and absoluteness in set theory, decidability of relations in effective structures (like the natural numbers), and ...
FUIN
2010
13 years 1 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
JSYML
2007
13 years 4 months ago
2007
We give four examples of theories in which Kreisel’s Conjecture is false: (1) the theory PA(-) obtained by adding a function symbol minus, ‘−’, to the language of PA, and t...