A Logical Autobiography
From MaRDI portal
Recommendations
Cites work
- Pavel Pudlák.Logical Foundations of Mathematics and Computational Complexity: A Gentle Introduction. Springer Monographs in Mathematics. Springer, 2013. ISBN: 978-3-319-00118-0 (hbk); 978-3-319-00119-7 (ebook). Pp. xiv + 695
- A contractionless semilattice semantics
- A near-optimal separation of regular and general resolution
- A semantical theory of analytic implication
- A topological representation theory for lattices
- Anderson and Belnap's invitation to sin
- Approximation and Small-Depth Frege Proofs
- Betweenness and Comparability Obtained from Binary Relations
- Completeness of weak implication
- Decidability and the finite model property
- Decision problems for distributive lattice-ordered semigroups
- Decorated linear order types and the theory of concatenation
- Distributive lattices with a dual homomorphic operation
- Distributive lattices with a dual homomorphic operation. II
- Duality for algebras of relevant logics
- Enumerating Types of Boolean Functions
- Equational classes of distributive double p-algebras
- Failure of interpolation in constant domain intuitionistic logic
- Failure of interpolation in relevant logics
- Formalizing Dangerous SAT Encodings
- Four variables suffice
- Free distributive pseudo-complemented lattices
- Free Heyting algebras
- Free Modular Lattices
- Functional interpretations of feasibly constructive arithmetic
- Further Results on Proof Theories For Semilattice Logics
- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
- Hard examples for resolution
- Henry M. Sheffer and notational relativity
- scientific article; zbMATH DE number 1612537 (Why is no real title available?)
- scientific article; zbMATH DE number 6371937 (Why is no real title available?)
- scientific article; zbMATH DE number 5899257 (Why is no real title available?)
- scientific article; zbMATH DE number 5613975 (Why is no real title available?)
- scientific article; zbMATH DE number 3887654 (Why is no real title available?)
- scientific article; zbMATH DE number 3134289 (Why is no real title available?)
- scientific article; zbMATH DE number 6538222 (Why is no real title available?)
- scientific article; zbMATH DE number 3904557 (Why is no real title available?)
- scientific article; zbMATH DE number 1183741 (Why is no real title available?)
- scientific article; zbMATH DE number 3781131 (Why is no real title available?)
- scientific article; zbMATH DE number 65760 (Why is no real title available?)
- scientific article; zbMATH DE number 3496100 (Why is no real title available?)
- scientific article; zbMATH DE number 3504935 (Why is no real title available?)
- scientific article; zbMATH DE number 3606442 (Why is no real title available?)
- scientific article; zbMATH DE number 733396 (Why is no real title available?)
- scientific article; zbMATH DE number 1028817 (Why is no real title available?)
- scientific article; zbMATH DE number 1093801 (Why is no real title available?)
- scientific article; zbMATH DE number 1156870 (Why is no real title available?)
- scientific article; zbMATH DE number 2061781 (Why is no real title available?)
- scientific article; zbMATH DE number 7046713 (Why is no real title available?)
- scientific article; zbMATH DE number 4117898 (Why is no real title available?)
- scientific article; zbMATH DE number 1852926 (Why is no real title available?)
- scientific article; zbMATH DE number 1860672 (Why is no real title available?)
- scientific article; zbMATH DE number 2101960 (Why is no real title available?)
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- scientific article; zbMATH DE number 873140 (Why is no real title available?)
- scientific article; zbMATH DE number 1420859 (Why is no real title available?)
- scientific article; zbMATH DE number 2188773 (Why is no real title available?)
- scientific article; zbMATH DE number 3273222 (Why is no real title available?)
- scientific article; zbMATH DE number 3325539 (Why is no real title available?)
- scientific article; zbMATH DE number 3325547 (Why is no real title available?)
- scientific article; zbMATH DE number 3363520 (Why is no real title available?)
- scientific article; zbMATH DE number 3366941 (Why is no real title available?)
- scientific article; zbMATH DE number 3200657 (Why is no real title available?)
- scientific article; zbMATH DE number 3062117 (Why is no real title available?)
- Implicational formulas in intuitionistic logic
- Implicational relevance logic is 2-\textsc{ExpTime}-complete
- Logic at work. Essays dedicated to the memory of Helena Rasiowa
- Mathematical depth
- Matrix identities and the pigeonhole principle
- On the complexity of regular resolution and the Davis-Putnam procedure
- Projective distributive p-algebras
- Proof Theories for Semilattice Logics
- Proof theory
- Relational Methods in Computer Science
- Relevance logic: problems open and closed
- Relevant implication and ordered geometry
- Representation of Distributive Lattices by means of ordered Stone Spaces
- Resolution proofs of matching principles
- Russell and Gödel
- S. Barry Cooper and Andrew Hodges (editors), The Once and Future Turing: Computing the World. Cambridge University Press, 2016. xviii + 379 pp.— therein: - Martin Davis. Algorithms, Equations, and Logic. pp. 4–19. - J.M.E. Hyland. The Forgotten Turing
- SEBASTIEN GANDON. Russell's Unknown Logicism: A Study in the History and Philosophy of Mathematics. New York: Palgrave Macmillan, 2012. ISBN 978-0-230-57699-5. Pp. xiv + 266
- Semantics for relevant logics
- Simplified lower bounds for propositional proofs
- Supervaluation fixed-point logics of truth
- Synonymous logics
- Synonymous logics: a correction
- The amalgamation property in equational classes of modular lattices
- The complexity of analytic tableaux
- The complexity of decision procedures in relevance logic II
- The complexity of Gentzen systems for propositional logic
- The Complexity of Propositional Proofs
- The Complexity of Propositional Proofs with the Substitution Rule
- The Complexity of the Hajós Calculus
- The depth of resolution proofs
- The graph constructions ofHaj�s and Ore
- The intractability of resolution
- The number of lines in Frege proofs with substitution
- The relative complexity of resolution and cut-free Gentzen systems
- The Story of \gamma γ
- The symmetry rule in propositional logic
- The undecidability of entailment and relevant implication
- Theory and Applications of Models of Computation
- Von Neumann, Gödel and complexity theory
- Width and size of regular resolution proofs
Cited in
(4)
This page was built for publication: A Logical Autobiography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5027230)
