Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Atomic formulaDecision problemDomain of discourseFirst-order logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Path- and index-sensitive string analysis based on monadic second-order logic
We propose a novel technique for statically verifying the strings generated by a program. The verification is conducted by… 
Highly Cited
2006
Highly Cited
2006
Locating faults through automated predicate switching
Typically debugging begins when during a program execution a point is reached at which an obviously incorrect value is observed… 
Highly Cited
2004
Highly Cited
2004
Verifying Finite-State Graph Grammars: An Unfolding-Based Approach
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be… 
Highly Cited
2002
Highly Cited
2002
Monadic second-order logic on tree-like structures
Highly Cited
2001
Highly Cited
2001
A Logic for Abstract State Machines
We introduce a logic for sequential, non distributed Abstract State Machines. Unlike other logics for ASMs which are based on… 
Highly Cited
1998
Highly Cited
1998
A Theory of Selection and Reconstruction in the Minimalist Perspective
This study extends two ideas of the minimalist program in linguistic theory (Chomsky 1992, 1994, 1995a) (LF feature decomposition… 
Highly Cited
1997
Highly Cited
1997
Generalized Quantifiers in Linguistics and Logic
Highly Cited
1988
Highly Cited
1988
Branching time temporal logic
Many important parallel computer programs exhibit ongoing behaviour that is characterized naturally in terms of infinite… 
Highly Cited
1980
Highly Cited
1980
Complexity Results for Classes of Quantificational Formulas
  • H. R. Lewis
  • Journal of computer and system sciences (Print)
  • 1980
  • Corpus ID: 35359770
Highly Cited
1963
Highly Cited
1963
Axiomatization of the infinite-valued predicate calculus
The infinite-valued statement calculus to which this paper refers is that of Łukasiewicz [10], whose axiomatization was proved… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)