Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,151 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
2011
2011
A Notion of Coherence for Books on Conditional Events in Many-valued Logic
F. Montagna
Journal of Logic and Computation
2011
Corpus ID: 1923829
We introduce a new approach to conditional probability over many-valued events, which is based on bets. Then we show that this…
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
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
2001
2001
A Methodology for Constructing Expert Systems for Medical Diagnosis
Luis M. Laita
,
G. González-Páez
,
E. Roanes-Lozano
,
V. Maojo
,
L. Ledesma
,
Laura Laita
ISMDA
2001
Corpus ID: 33864630
We propose a methodology, based on Computer Algebra and implemented in CoCoA language, for constructing rule based expert systems…
Expand
1997
1997
Papers in Philosophical Logic: Intensional logics without iterative axioms
D. Lewis
1997
Corpus ID: 126362595
1986
1986
A Logic of Deliberation
M. Belzer
AAAI Conference on Artificial Intelligence
1986
Corpus ID: 5804104
Deliberation typically involves the formation of a plan or intention from a set of values and beliefs. I suggest that…
Expand
1962
1962
Functional completeness and canonical forms in many-valued logics1
William H. Jobe
Journal of Symbolic Logic (JSL)
1962
Corpus ID: 19085520
This paper examines the questions of functional completeness and canonical completeness in many-valued logics, offering proofs…
Expand
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