In logic, the monadic predicate calculus (also called monadic first-order logic) is the fragment of first-order logic in which all relation symbolsâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Mark Jenkins, JoÃ«l Ouaknine, Alexander Moshe Rabinovich, James Worrell
- 2010 25th Annual IEEE Symposium on Logic inâ€¦
- 2010

Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Booleanâ€¦Â (More)

Is this relevant?

2008

2008

- Aidan Delaney, John Taylor, Simon J. Thompson
- Diagrams
- 2008

The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammaticâ€¦Â (More)

Is this relevant?

2002

2002

- DaniÃ¨le Beauquier, Alexander Moshe Rabinovich
- J. Log. Comput.
- 2002

A major result concerning Temporal Logics (TL) is Kampâ€™s theorem [Kam68, GHR94], which states that the temporal logic over theâ€¦Â (More)

Is this relevant?

2002

2002

- Alexander Moshe Rabinovich
- Theor. Comput. Sci.
- 2002

We consider an interpretation of monadic second-order logic of order in the continuous time structure of finitely variableâ€¦Â (More)

Is this relevant?

2000

2000

- Hans-Peter Kolb, Uwe MÃ¶nnich, Frank Morawietz
- Grammars
- 2000

The main result of this paper is a description of cross-serial dependencies equivalently in terms of (a) regular tree languagesâ€¦Â (More)

Is this relevant?

1999

1999

We deene a quantitative Temporal Logic that is based on a simple modality within the framework of Monadic Predicate Logic. Itsâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

A speciication formalism for reactive systems deenes a class of !-languages. We call a speciication formalism fully decidable ifâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Nils Klarlund, Michael I. Schwartzbach
- POPL
- 1993

Recursive data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified atâ€¦Â (More)

Is this relevant?

1979

1979

- Yuri Gurevich
- J. Symb. Log.
- 1979

This is the first part of a two part work on the monadic theory of short orders (embedding neither w1 nor w1*). This partâ€¦Â (More)

Is this relevant?

1978

1978

- Harry R. Lewis
- 19th Annual Symposium on Foundations of Computerâ€¦
- 1978

We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicateâ€¦Â (More)

Is this relevant?