Finite variability interpretation of monadic logic of order

Theoretical Computer Science

Volumn 275, Issue 1-2, 2002, Pages 111-125

  Rabinovich, A ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Continuous time specification; Definability; Monadic logic of order

Indexed keywords

AUTOMATA THEORY; LOGIC PROGRAMMING; SEMANTICS; THEOREM PROVING;

MONADIC LOGIC;

COMPUTER SCIENCE;

EID: 0037187380     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00126-8     Document Type: Article

References (13)

1. On a decision method in restricted second order arithmetic
2. Solving sequential conditions by finite-state strategies
3. A really abstract concurrent model and its fully abstract semantics
4. Decidability and undecidablity results for Duration Calculus
5. A mean value calculus of duration
6. Rabin's uniformization problem
7. Decidability of second order theories and automata on infinite trees
8. Decidable theories
9. On translation of temporal logic of actions into monadic second order logic
10. On the decidability of continuous time specification formalisms
11. From finite automata toward hybrid systems
12. Automata on infinite objects