Results 121 to 130 of about 58,074 (157)
Dependent and Independent Variables in Propositional Satisfiability [PDF]
, 2002 Propositional reasoning (SAT) is central in many applications of Computer Science. Several decision procedures for SAT have been proposed, along with optimizations and heuristics to speed them up. Currently, the most effective implementations are based on the Davis, Logemann, Loveland method. In this method, the input formula is represented as a set of
GIUNCHIGLIA, ENRICO +2 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Recent Advances in Computer Science and Communications, 2021
Background: Propositions simplification is a classic topic in discrete mathematics that is applied in different areas of science such as programs development and digital circuits design. Investigating alternative methods would assist in presenting different approaches that can be used to obtain better results.
Maher Nabulsi +2 more
openaire +2 more sources
Background: Propositions simplification is a classic topic in discrete mathematics that is applied in different areas of science such as programs development and digital circuits design. Investigating alternative methods would assist in presenting different approaches that can be used to obtain better results.
Maher Nabulsi +2 more
openaire +2 more sources
THREE SEQUENCES OF FORMULAS WITH TWO VARIABLES IN THE POSITIVE PROPOSITIONAL LOGIC
Mathematics of the USSR-Izvestiya, 1968 V A Jankov
openalex +3 more sources
Control of Variables and Propositional Reasoning in Early Adolescence
The Journal of General Psychology, 1980Summary Three paper-and-pencil logical reasoning tests and a word knowledge test were administered to 80 adolescents (40 boys and 40 girls). Analyses of correct responses revealed developmental trends which complement previous research on the logical reasoning abilities of children and adolescents.
James J. Roberge, Barbara K. Flexer
openaire +2 more sources
Superconstructive Propositional Calculi with Extra Axiom Schemes Containing One Variable
Mathematical Logic Quarterly, 1972 John G. Anderson
openalex +3 more sources
On formulas of one variable in intuitionistic propositional calculus
Journal of Symbolic Logic, 1960McKinsey and Tarski [3] described Gödel's proof that the number of Brouwerian-algebraic functions is infinite. They gave an example of a sequence of infinitely many distinct Brouwerian-algebraic functions of one argument, which means that there are infinitely many non-equivalent formulas of one variable in the intuitionistic propositional calculus LJ ...
openaire +3 more sources
A note on decidability of variables in intuitionistic propositional logic
Mathematical Logic Quarterly, 2018AbstractAn answer to the following question is presented: given a proof in classical propositional logic, for what small set of propositional variables p does it suffice to add all the formulae to Γ in order to intuitionistically prove A? This answer is an improvement of Ishihara's result for some cases.
openaire +1 more source
Formalisations of Many‐Valued Propositional Calculi with Variable Functors
Mathematical Logic Quarterly, 1985Let C and N be the primitive implication and negation functors of Łukasiewicz [\textit{J. Łukasiewicz} and \textit{A. Tarski}, C. R. Soc. Sci. Varsovie 23, 30-50 (1930; JFM 57.1319.01)] and let T be the tertium functor of \textit{J. Słupecki} [ibid. 29, 9-11 (1936; Zbl 0015.05102)].
openaire +3 more sources
'The general propositional form is a variable' (Tractatus 4.53)
Mind, 2004Wittgenstein presents in the Tractatus a variable purporting to capture the general form of proposition. One understanding of what Wittgenstein is doing there, an understanding in line with the 'new' reading of his work championed by Diamond, Conant and others, sees it as a deflationary or even an implosive move a move by which a concept sometimes put ...
openaire +2 more sources
A Set of Independent Postulates For Propositional Functions of one Variable
The Annals of Mathematics, 1935The following calculus of propositions is based in its essentials upon that given in Principia Mathematica *10. But it differs from the latter in several important respects. The primitive propositions of Principia are not completely formalised, for they contain such words as "proposition," "function," etc., which refer to the meaning of the symbolism ...
openaire +2 more sources