Monadic predicate calculus

Known as: First-order, Monadic predicate logic, First order monadic predicate logic 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2017
0246819622017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
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
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
The main result of this paper is a description of cross-serial dependencies equivalently in terms of (a) regular tree languages… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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)
  • figure 1
Is this relevant?
Highly Cited
1993
Highly Cited
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
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
We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate… (More)
Is this relevant?