Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Implicational propositional calculus (view)

searching for Propositional calculus 31 found (501 total)

Dick de Jongh (208 words) [view diff] case mismatch in snippet view article find links to article

with a dissertation titled Investigations on the Intuitionistic Propositional Calculus. De Jongh is mostly known for his work on proof theory, provability

Carew Arthur Meredith (849 words) [view diff] exact match in snippet view article find links to article

of propositional calculus. C.A. Meredith (1953). "Single axioms for the systems (C,N), (C,0), and (A,N) of the two-valued propositional calculus". Journal

Stanisław Jaśkowski (719 words) [view diff] case mismatch in snippet view article find links to article

Polish Logic 1920-1939, Oxford University Press, 1967 pp. 259–263 A propositional Calculus for Inconsistent Deductive Systems 1948 (reprinted in: Studia Logica

Randolph diagram (890 words) [view diff] case mismatch in snippet view article find links to article

statements: In his introductory paper on the subject, Cross-Examining Propositional Calculus and Set Operations, Randolph mentions that the first use of crosses

Stephen Cook (1,540 words) [view diff] case mismatch in snippet view article find links to article

for the last decade. In his "Feasibly Constructive Proofs and the Propositional Calculus" paper published in 1975, he introduced the equational theory PV

Substructural logic (634 words) [view diff] exact match in snippet view article find links to article

that these rules are contentious, when applied in conventional propositional calculus. They occur naturally in proof theory, and were first noticed there

Nikolai Shanin (1,580 words) [view diff] exact match in snippet view article find links to article

for automatic theorem proving, focusing primarily on classical propositional calculus. The first three members of the group were Gennady Davydov (1939–2016)

Criteria of truth (2,012 words) [view diff] exact match in snippet view article find links to article

operator in propositional calculus Logical value – Value indicating the relation of a proposition to truth Multi-valued logic – Propositional calculus in which

Admissible rule (4,821 words) [view diff] exact match in snippet view article find links to article

therefore customary to only deal with unary rules A/B. Classical propositional calculus (CPC) is structurally complete. Indeed, assume that A/B is a non-derivable

Complemented lattice (876 words) [view diff] exact match in snippet view article find links to article

mechanics. Garrett Birkhoff and John von Neumann observed that the propositional calculus in quantum logic is "formally indistinguishable from the calculus

Tseytin transformation (1,470 words) [view diff] exact match in snippet view article find links to article

(C\vee A\vee B))} G.S. Tseytin: On the complexity of derivation in propositional calculus. In: Slisenko, A.O. (ed.) Studies in Constructive Mathematics and

Conditioned disjunction (290 words) [view diff] exact match in snippet view article find links to article

(1948). "Conditioned disjunction as a primitive connective for the propositional calculus". Portugaliae Mathematica. 7: 87–90. Wesselkamper, T. C. (1975)

Gödel logic (234 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-642-16241-1. Retrieved 2 March 2022. Dummett, Michael (1959). "A propositional calculus with denumerable matrix". The Journal of Symbolic Logic. 24 (2):

Four-valued logic (1,403 words) [view diff] exact match in snippet view article find links to article

mathematical logic (using operators, truth tables, syllogisms, propositional calculus, theorems and so on) with communication protocols built using binary

Heyting algebra (6,294 words) [view diff] exact match in snippet view article find links to article

the basic facts concerning the relationship between intuitionist propositional calculus and Heyting algebras immediate. (For these facts, see the sections

John Alan Robinson (813 words) [view diff] exact match in snippet view article find links to article

theorem-proving was pioneered in the 1960s by Davis and Putnam in propositional calculus. A complete mechanization (in the sense of a semidecision procedure)

Grigori Tseitin (334 words) [view diff] exact match in snippet view article find links to article

by the ACM. G. S. Tseitin. „On the complexity of derivation in propositional calculus“ in: J. Siekmann and G. Wrightson, editors, Automation of Reasoning

Czesław Lejewski (1,096 words) [view diff] exact match in snippet view article find links to article

39 (1985), pp, 217-241. "Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term", Studia

The End of Mr. Y (329 words) [view diff] exact match in snippet view article find links to article

Y Complete Review's collation of reviews of The End of Mr. Y OEIS sequence A100200 (Decimal Goedelization of antitheorems from propositional calculus)

Realizability (1,193 words) [view diff] exact match in snippet view article find links to article

(2000). Realizability: An Historical Essay. Rose, G. F. (1953). "Propositional calculus and realizability". Transactions of the American Mathematical Society

Doxastic logic (2,108 words) [view diff] case mismatch in snippet view article find links to article

_{PC}p} means p {\displaystyle p} is a tautology/theorem provable in Propositional Calculus. Also, their set of beliefs (past, present and future) is logically

Susanne Bobzien (1,433 words) [view diff] exact match in snippet view article find links to article

syllogistic. She argues that this should not be assimilated into standard propositional calculus, but treated as a distinct system which bears important similarities

Bounded arithmetic (1,510 words) [view diff] exact match in snippet view article find links to article

1986. Cook, Stephen (1975). "Feasibly constructive proofs and the propositional calculus". Proc. 7th Annual ACM Symposium on Theory of Computing. pp. 83–97

Sequent (2,754 words) [view diff] exact match in snippet view article find links to article

systems, which are very convenient for practical theorem-proving in propositional calculus and predicate calculus, were applied by Suppes (1999) and Lemmon

Anatol Slissenko (1,869 words) [view diff] exact match in snippet view article find links to article

algorithm for machine search of a natural logical deduction in a propositional calculus. In J. Siekmann and G. Wrightson, editors, *The Automation of Reasoning

Anatol Slissenko (1,869 words) [view diff] exact match in snippet view article find links to article

algorithm for machine search of a natural logical deduction in a propositional calculus. In J. Siekmann and G. Wrightson, editors, *The Automation of Reasoning

Konrad Zuse (4,562 words) [view diff] exact match in snippet view article find links to article

universal theory of computation with special consideration of the propositional calculus and its application to relay circuits], unpublished manuscript,

Leon Henkin (10,251 words) [view diff] exact match in snippet view article find links to article

ISSN 0036-8075. Quine, W. V. (March 1938). "Completeness of the propositional calculus". Journal of Symbolic Logic. 3 (1): 37–40. doi:10.2307/2267505.

T-norm fuzzy logics (3,222 words) [view diff] exact match in snippet view article find links to article

Anzeiger Akademie der Wissenschaften Wien 69: 65–66. Dummett M., 1959, Propositional calculus with denumerable matrix, Journal of Symbolic Logic 27: 97–106 Esteva

Currying (5,025 words) [view diff] case mismatch in snippet view article find links to article

Moerdijk, Ieke (1992). "Chapter I. Categories of Functors; sections 7. Propositional Calculus, 8. Heyting Algebras, and 9. Quantifiers as Adjoints". Sheaves in

Skew lattice (5,159 words) [view diff] exact match in snippet view article find links to article

Dissertation, 2002. Spinks, M and R Veroff, Axiomatizing the skew Boolean propositional calculus, J. Automated Reasoning, 37 (2006), 3-20. Cvetko-Vah, K, Skew lattices