Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,258,874 papers from all fields of science
Search
Sign In
Create Free Account
Monadic predicate calculus
Known as:
First-order
, Monadic predicate logic
, First order monadic predicate logic
Expand
In logic, the monadic predicate calculus (also called monadic first-order logic) is the fragment of first-order logic in which all relation symbols…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Atomic formula
Decision problem
Domain of discourse
First-order logic
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Clique-width and tree-width of sparse graphs
B. Courcelle
2015
Corpus ID: 15605560
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many xed-parameter tractable…
Expand
Review
2009
Review
2009
2. Syntactic, semantic, and prosodic factors determining the position of adverbial adjuncts
K. Kiss
2009
Corpus ID: 124821438
1. Aims What type of mechanism determines the placement of adverbial adjuncts is an open question of generative syntax. Several…
Expand
2001
2001
Nominal tense with nominal scope: A preliminary sketch
R. Nordlinger
,
L. Sadler
2001
Corpus ID: 7656448
The morphosyntactic categories of tense, aspect and mood are traditionally considered to be properties of verbs. However, the…
Expand
1999
1999
Towards a Theory of Regular MSC Languages
J. Henriksen
,
M. Mukund
,
K. Kumar
,
P. Thiagarajan
1999
Corpus ID: 713535
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early…
Expand
1998
1998
The-Calculus: Notes on Labelled Semantics
P. Quaglia
1998
Corpus ID: 116436091
Preface The π-calculus [MPW92] is a name-passing calculus that allows the description of distributed systems with a dynamically…
Expand
1995
1995
Church-Rosser Codes
V. Oleshchuk
IMA Conference on Cryptography and Coding
1995
Corpus ID: 12339888
The notion of code, called Church-Rosser code, is proposed and studied. The necessary and sufficient conditions for a finite set…
Expand
1994
1994
Computing presentations for subgroups of polycyclic groups and of context-free groups
Norbert Kuhn
,
K. Madlener
,
F. Otto
Applicable Algebra in Engineering, Communication…
1994
Corpus ID: 6723487
Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for…
Expand
1991
1991
Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems
F. Otto
International Symposium on Applied Algebra…
1991
Corpus ID: 41165908
For a finite weakly confluent monadic string-rewriting system R presenting a group the set of valid linear sentences is decidable…
Expand
1972
1972
The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets
B. Courcelle
Scandinavian Workshop on Algorithm Theory
1972
Corpus ID: 35604172
Reference : Graph structure and monadic second-order logic,
1967
1967
A Data Definition Facility for Programming Languages
Thomas A. Standish
Outstanding Dissertations in the Computer…
1967
Corpus ID: 5999493
This dissertation presents a descriptive notation for data structures which is embedded in a programming language in such a way…
Expand