Results 131 to 140 of about 58,074 (157)

Violation of the Quantum Ordering of Propositions in Hidden-Variable Theories

Journal of Mathematical Physics, 1968
A general definition of hidden-variable theories in terms of the dual structure of states and propositions is proposed. As a consequence of a theorem due to Zierler and Schlessinger, this definition implies a violation of the quantum ordering of propositions in the corresponding hidden-variable theory.
openaire   +2 more sources

Variable and Clause Ordering in an FSA Approach to Propositional Satisfiability

2011
We use a finite state (FSA) construction approach to address the problem of propositional satisfiability (SAT). We use a very simple translation from formulas in conjunctive normal form (CNF) to regular expressions and use regular expressions to construct an FSA.
José M. Castaño, Rodrigo Castaño
openaire   +2 more sources

Multiple propositions, contextual variability, and the semantics/pragmatics interface

Synthese, 2012
A ‘multiple-proposition (MP) phenomenon’ is a putative counterexample to the widespread implicit assumption that a simple indicative sentence (relative to a context of utterance) semantically expresses at most one proposition. Several philosophers and linguists (including Stephen Neale and Chris Potts) have recently developed hypotheses concerning this
openaire   +2 more sources

A Correspondence Between Variable Relations And Three-Valued Propositional Logic

International Journal of Computer Mathematics, 1995
Herein, relations are generalised to variable length tuple relations (variabe relations) wherein tuples are allowed to be of variable length. We define the concept of a functional dependency (FD) holding in variable relations and present a sound and complete axiom system for them.
Mark Levene, George Loizou
openaire   +2 more sources

The 481 Ways to Split a Clause and Deal with Propositional Variables

2013
It is often the case that first-order problems contain propositional variables and that proof-search generates many clauses that can be split into components with disjoint sets of variables. This is especially true for problems coming from some applications, where many ground literals occur in the problems and even more are generated. The problem of
Andrei Voronkov, Kryštof Hoder
openaire   +2 more sources

Explaining the Variable Utility of Disjointed Incrementalism: Four Propositions

American Political Science Review, 1980
Much of mainstream organization theory has been concerned with the implications for organizational design and policy process of high levels of uncertainty or complexity in task environments. Decentralization, disjointed incrementalist decision strategies, and quasi-market coordinative mechanisms have been advanced as rational responses to the ...
openaire   +2 more sources

On non-local propositional and local one-variable quantified CTL*

Proceedings Ninth International Symposium on Temporal Representation and Reasoning, 2003
We prove decidability of 'non local' propositional CTL*, where truth values of atoms may depend on the branch of evaluation. This result is then used to show decidability of the 'weak' one-variable fragment of first-order (local) CTL*, in which all temporal operators and path quantifiers except 'tomorrow' are applicable only to sentences.
Frank Wolter, Sebastian Bauer, Ian Hodkinson, Michael Zakharyaschev   +3 more
openaire   +2 more sources

A Formalisation of an ℵ₀‐Valued Propositional Calculus with Variable Functors

Mathematical Logic Quarterly, 1982
This paper presents a formalization of an \(\aleph_ 0\)-valued propositional calculus with a single designated value for propositional variables and variable functors which take values from the set \(\{C,C'\}\), where C is Łukasiewicz's implication functor and \(C'PQ =_ T CQP.\) Extending results from the \(\aleph_ 0\)-valued calculus with C as the ...
openaire   +2 more sources

A program logic with quantifiable propositional variables

1985
In the paper an extension of propositional program logics is given, obtained by introducing quantifiers binding propositional variables. The complete axiomatization of the logic is provided. The problems are discussed of definability of sets of states of programs and distinguishability of states by means of the formulas of the logic.
openaire   +2 more sources

Valuations for the quantum propositional structures and hidden variables for quantum mechanics

1980
The thesis investigates the possibility of a classical semantics for quantum propositional structures. A classical semantics is defined as a set of mappings each of which is (i) bivalent, i.e., the value 1 (true) or 0 (false) is assigned to each proposition, and (ii) truth-functional, i.e., the logical operations are preserved.
openaire   +2 more sources