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.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
Highly Cited
2004
Highly Cited
2004
The Expressiveness of Spider Diagrams
Spider diagrams are a visual language for expressing logical statements. In this paper we identify a well-known fragment of first… 
2001
2001
Japanese Case Frame Construction by Coupling the Verb and its Closest Case Component
This paper describes a method to construct a case frame dictionary automatically from a raw corpus. The main problem is how to… 
Highly Cited
1998
Highly Cited
1998
Predicate Dispatching: A Unified Theory of Dispatch
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method… 
1996
1996
Distributive lattices with an operator
It was shown in [3] (see also [5]) that there is a duality between the category of bounded distributive lattices endowed with a… 
1987
1987
The Illinois functional programming interpreter
The Illinois Functional Programming (IFP) language is a modified version of Backus' FP(1). IFP has the same side-effect free… 
1986
1986
On context-free sets of graphs and their monadic second-order theory
  • B. Courcelle
  • Graph-Grammars and Their Application to Computer…
  • 1986
  • Corpus ID: 13314079
The algebraic framework for studying graphs yields a notion of system of equations defining equational sets of graphs. Context… 
1977
1977
Undecidable existential problems for addition and divisibility in algebraic number rings. II
where xF = (xI, ... , x"), aIb means "a divides b" and the ft and g, are linear polynomials with coefficients from the integers Z… 
1977
1977
Monadic theory of order and topology, 1
We deal with the monadic theory of linearly ordered sets and topological spaces, disprove two of Shelah’s conjectures and prove… 
1967
1967
A Data Definition Facility for Programming Languages
This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way… 
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)