Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,460,524 papers from all fields of science
Search
Sign In
Create Free Account
Propositional variable
Known as:
Propositional symbol
, Sentential variable
, Sentential letter
Expand
In mathematical logic, a propositional variable (also called a sentential variable or sentential letter) is a variable which can either be true or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Admissible rule
Atomic formula
BL (logic)
Belief revision
Expand
Broader (1)
Propositional calculus
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Bernays-Schönfinkel-Ramsey with Simple Bounds is NEXPTIME-complete
Marco Voigt
,
Christoph Weidenbach
arXiv.org
2015
Corpus ID: 1151546
Linear arithmetic extended with free predicate symbols is undecidable, in general. We show that the restriction of linear…
Expand
2008
2008
Language and embodiment
C. Scorolli
,
A. Borghi
2008
Corpus ID: 16289409
The paper focuses on the embodied view of cognition applied to language. First we discuss what we intend when we say that…
Expand
2008
2008
An Independence of Causal Interactions Model for Opposing Inuences
Paul P. Maaskant
,
Marek J Druzdzel
2008
Corpus ID: 8144300
We introduce the DeMorgan gate, an Independence of Causal Interactions (ICI) model that is capable of modeling opposing inuences…
Expand
Highly Cited
2007
Highly Cited
2007
Automated Choreographer Synthesis for Web Services Composition Using I/O Automata
Saayan Mitra
,
Ratnesh Kumar
,
Samik Basu
IEEE International Conference on Web Services…
2007
Corpus ID: 12873124
We study the problem of synthesis of a choreographer in Web service composition for a given set of services and a goal. Services…
Expand
2007
2007
Characterizations of maximal consistent theories in the formal deductive system L* (NM-logic) and Cantor space
Hongjun Zhou
,
Guojun Wang
Fuzzy Sets Syst.
2007
Corpus ID: 27651783
2006
2006
ON MODAL LOGICS BETWEEN K×K×K AND S5× S5× S5
R. Hirsch
2006
Corpus ID: 675609
We prove that every n-modal logic between K and S5 is undecidable, whenever n ≥ 3. We also show that each of these logics is non…
Expand
2004
2004
Encoding Global Unobservability for Efficient Translation to SAT
M. Velev
International Conference on Theory and…
2004
Corpus ID: 18973048
. The paper studies the use of global unobservability constraints in a CNF translation of Boolean formulas, where the…
Expand
Review
2003
Review
2003
Understanding Exploratory Use of ERP Systems
R. Sousa
,
D. Goodhue
Americas Conference on Information Systems
2003
Corpus ID: 11210695
Complex information technology often remains under-utilized following implementation. As a result, potentially powerful tools may…
Expand
Highly Cited
1982
Highly Cited
1982
Fuzzy prediction based on regression models
R. Yager
Information Sciences
1982
Corpus ID: 33002778
1973
1973
Quantifying in and Out of Quotes
N. Belnap
,
Dorothy L. Grover
1973
Corpus ID: 119992461
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)
ACCEPT & CONTINUE
or Only Accept Required