Sciweavers

7 search results - page 1 / 2
» The Church Problem for Countable Ordinals
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 4 months ago
The Church Problem for Countable Ordinals
Abstract. A fundamental theorem of B
Alexander Rabinovich
CORR
2010
Springer
141views Education» more  CORR 2010»
13 years 5 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
LPAR
2007
Springer
13 years 11 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
BIRTHDAY
2008
Springer
13 years 6 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat
BIRTHDAY
2008
Springer
13 years 6 months ago
The Church-Turing Thesis over Arbitrary Domains
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
Udi Boker, Nachum Dershowitz