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
Threading the Arduino with Haskell
Programming embedded microcontrollers often requires the scheduling of independent threads of execution, specifying the… 
Review
2009
Review
2009
2. Syntactic, semantic, and prosodic factors determining the position of adverbial adjuncts
1. Aims What type of mechanism determines the placement of adverbial adjuncts is an open question of generative syntax. Several… 
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… 
2001
2001
A Toolkit for First Order Extensions of Monadic Games
In 1974 R. Fagin proved that properties of structures which are in NP are exactly the same as those expressible by existential… 
2001
2001
LPS: A Language Prototyping System Using Modular Monadic Semantics
1999
1999
Towards a Theory of Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early… 
1995
1995
Church-Rosser Codes
The notion of code, called Church-Rosser code, is proposed and studied. The necessary and sufficient conditions for a finite set… 
1993
1993
The order types of termination orderings on monadic terms, strings and multisets
  • U. MartinE. Scott
  • [] Proceedings Eighth Annual IEEE Symposium on…
  • 1993
  • Corpus ID: 10820656
Total well-founded orderings on monadic terms satisfying the replacement and full invariance properties are considered. It is… 
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… 
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)