language:
Find link is a tool written by Edward Betts.Longer titles found: Birkhoff's theorem (equational logic) (view)
searching for Equational logic 15 found (26 total)
alternate case: equational logic
Prover9
(550 words)
[view diff]
exact match in snippet
view article
find links to article
Prover9 is an automated theorem prover for first-order and equational logic developed by William McCune. Prover9 is the successor of the Otter theoremN-monoid (57 words) [view diff] exact match in snippet view article find links to article
Burroni (1993). Higher dimensional word problems with applications to equational logic (PDF). Theoretical Computer Science. n-monoid at the nLab v t ePolygraph (mathematics) (109 words) [view diff] exact match in snippet view article
A. Burroni. Higher-dimensional word problems with applications to equational logic. TCS, 115(1):43--62, 1993. R. Street. Limits indexed by category-valuedGraph algebra (622 words) [view diff] exact match in snippet view article find links to article
ISSN 0002-5240. MR 0743465. S2CID 121598599. Pöschel, R. (1989). "The equational logic for graph algebras". Z. Math. Logik Grundlag. Math. 35 (3): 273–282E (theorem prover) (937 words) [view diff] exact match in snippet view article
won second place in the FOF (full first order logic) and UEQ (unit equational logic) categories and third place (after two versions of Vampire) in CNFFunction-level programming (826 words) [view diff] exact match in snippet view article find links to article
unstructured programs. The value-free style of FP is closely related to the equational logic of a cartesian-closed category. The canonical function-level programmingJan Kalicki (357 words) [view diff] exact match in snippet view article find links to article
Berkeley, California. Kalicki published 13 papers on logical matrices and equational logic in the five years before his death. "Jan Kalicki biography". ArchivedMinimal axioms for Boolean algebra (795 words) [view diff] exact match in snippet view article find links to article
the original on 1997-06-05. Meredith, C. A.; Prior, A. N. (1968). "Equational logic". Notre Dame J. Formal Logic. 9 (3): 212–226. doi:10.1305/ndjfl/1093893457Carew Arthur Meredith (849 words) [view diff] exact match in snippet view article find links to article
doi:10.1305/ndjfl/1093957574. C.A. Meredith and A.N. Prior (1968). "Equational logic". Notre Dame Journal of Formal Logic. 9 (3): 212–226. doi:10.1305/ndjfl/1093893457Avraham Trahtman (1,030 words) [view diff] exact match in snippet view article find links to article
Discrete Math. Theor. Comput. Sci. v. 9, 2(2007), 3-10 A. Tarski. Equational logic and equational theories of algebras. Contrib. to math. Logic. HannoverProof assistant (1,202 words) [view diff] exact match in snippet view article find links to article
science Prover9 – is an automated theorem prover for first-order and equational logic Ornes, Stephen (August 27, 2020). "Quanta Magazine – How Close AreAbstract rewriting machine (545 words) [view diff] case mismatch in snippet view article find links to article
doi:10.1016/j.entcs.2008.03.052. Kirchner, C.; Kirchner, H. (2014). "Equational Logic and Rewriting" (PDF). Handbook of the History of Logic. 9: 255–282Algebra (14,097 words) [view diff] case mismatch in snippet view article find links to article
2020 Grätzer 2008, pp. 7–8 Bahturin 2013, p. 346 Pratt 2022, § 3.2 Equational Logic Mal’cev 1973, pp. 210–211 Mal’cev 1973, pp. 210–211 Cohn 2012, p. 162Laws of Form (6,703 words) [view diff] exact match in snippet view article find links to article
algebraic structures, including Boolean algebra, that are varieties. Equational logic was common before Principia Mathematica (e.g., Peirce,1,2,3 JohnsonHilbert system (3,623 words) [view diff] exact match in snippet view article find links to article
we call the one-rule axiomatisation and which describes classical equational logic. We deal with a minimal language for this logic, where formulas use