Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Structural proof theory (view)

searching for Proof theory 72 found (574 total)

Łukasiewicz logic (2,455 words) [view diff] case mismatch in snippet view article find links to article

20: 177–212. A. Avron, "Natural 3-valued Logics– Characterization and Proof Theory", Journal of Symbolic Logic 56(1), doi:10.2307/2274919 A. Prijateli,

Canonical form (1,895 words) [view diff] no match in snippet view article find links to article

In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical

Ruy de Queiroz (1,250 words) [view diff] exact match in snippet view article find links to article

holds significant works in the research fields of Mathematical logic, proof theory, foundations of mathematics and philosophy of mathematics. He is the

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

Affine logic is a substructural logic whose proof theory rejects the structural rule of contraction. It can also be characterized as linear logic with

Modal logic (8,679 words) [view diff] exact match in snippet view article find links to article

features expected of good structural proof theories, such as purity (the proof theory does not introduce extra-logical notions such as labels) and analyticity

Actor model theory (1,545 words) [view diff] exact match in snippet view article find links to article

incorporates theories of the events and structures of Actor computations, their proof theory, and denotational models. From the definition of an Actor, it can be

Concatenation theory (291 words) [view diff] exact match in snippet view article find links to article

linguistics, computer science, logic, and metamathematics especially proof theory. A generative grammar can be seen as a recursive definition in string

Actor model theory (1,545 words) [view diff] exact match in snippet view article find links to article

incorporates theories of the events and structures of Actor computations, their proof theory, and denotational models. From the definition of an Actor, it can be

Amina Doumane (143 words) [view diff] exact match in snippet view article find links to article

doctoral thesis in France. Her thesis was on the subject On the infinitary proof theory of logics with fixed points. On January 31 2018, Doumane was presented

Horn clause (1,283 words) [view diff] case mismatch in snippet view article find links to article

Buss, Samuel R. (1998). "An Introduction to Proof Theory". In Samuel R. Buss (ed.). Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics

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

Ralf (ed.). "The proof theory of classical and constructive inductive definitions. A 40 year saga, 1968–2008" (PDF). Ways of Proof Theory: 7–30. doi:10.1515/9783110324907

Propositional proof system (1,121 words) [view diff] exact match in snippet view article find links to article

proof theory", in: Handbook of Proof Theory (ed. S.R.Buss), Elsevier (1998). P. Pudlák (1998), "The lengths of proofs", in: Handbook of Proof Theory (ed

Actor model middle history (1,043 words) [view diff] exact match in snippet view article find links to article

implementations, initial applications, and development of the first proof theory and denotational model. It is the follow on article to Actor model early

Actor model later history (1,443 words) [view diff] exact match in snippet view article find links to article

implementations, initial applications, and development of the first proof theory and denotational model. Investigations began into the basic power of

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

applied in conventional propositional calculus. They occur naturally in proof theory, and were first noticed there (before receiving a name). There are numerous

Many-valued logic (3,346 words) [view diff] exact match in snippet view article find links to article

Olivetti, Nicola; Dov M. Gabbay (2008). Proof Theory for Fuzzy Logics. Springer. ISBN 978-1-4020-9408-8. Covers proof theory of many-valued logics as well, in

Beta-model (777 words) [view diff] exact match in snippet view article find links to article

Related Topics" (1973), p. 181 J.-Y. Girard, Proof Theory and Logical Complexity (1987), Part III: Π21-proof theory, p. 206 Simpson, Stephen G. (2009). Subsystems

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

two-part logic based on "expository propositions" (al-aqwāl al-šāreḥa) and "proof theory" (ḥojaj) served as the precursory model for Suhrawardi's own "Rules of

Thomas Studer (233 words) [view diff] case mismatch in snippet view article find links to article

Kahle, Reinhard, Strahm, Thomas, Studer, Thomas (eds.): Advances in Proof Theory (2016, Birkhäuser) Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe

Second-order arithmetic (3,837 words) [view diff] case mismatch in snippet view article find links to article

Princeton University Press. Buss, S. R. (1998). Handbook of Proof Theory. Elsevier. ISBN 0-444-89840-9. Takeuti, G. (1975). Proof Theory. ISBN 0-444-10492-5.

Cointerpretability (191 words) [view diff] case mismatch in snippet view article find links to article

(1998), "The logic of provability", in Buss, Samuel R. (ed.), Handbook of Proof Theory, Studies in Logic and the Foundations of Mathematics, vol. 137, Amsterdam:

Additively indecomposable ordinal (545 words) [view diff] case mismatch in snippet view article find links to article

analysis", pp. 27–78. Appearing in Aczel, Simmons, Proof Theory: A selection of papers from the Leeds Proof Theory Programme 1990 (1992). Cambridge University

Law of thought (11,576 words) [view diff] exact match in snippet view article find links to article

"axiomatic theory"; "the two formulations, that of model theory and that of proof theory, give equivalent results"(Kleene 1967:33). This foundational choice,

Elementary function (1,281 words) [view diff] exact match in snippet view article find links to article

differential fields Elementary function arithmetic – System of arithmetic in proof theory Liouville's theorem (differential algebra) – Says when antiderivatives

Infinity and the Mind (348 words) [view diff] exact match in snippet view article find links to article

mysteries of transcendence shatter the clarity of logic, set theory, proof theory, and contemporary physics." Chapter one: Infinity Chapter two: All the

Burton Dreben (1,856 words) [view diff] case mismatch in snippet view article find links to article

), in A. Kino, J. Myhill, and R. E. Vesley (eds.), Intuitionism and Proof Theory, North-Holland, pp. 419–33. 1971. "Notes E-I", in W. D. Goldfarb (ed

Roger Lyndon (807 words) [view diff] case mismatch in snippet view article find links to article

S2CID 21803927. Troelstra, Anne Sjerp; Schwichtenberg, Helmut (2000), Basic Proof Theory, Cambridge tracts in theoretical computer science, vol. 43 (2nd ed.)

Kruskal's tree theorem (1,855 words) [view diff] exact match in snippet view article find links to article

about Kruskal's theorem and the ordinal Γ0? A survey of some results in proof theory" (PDF). Annals of Pure and Applied Logic. 53 (3): 199–260. doi:10

Formalism (philosophy of mathematics) (1,440 words) [view diff] exact match in snippet view article

point of view. After Gödel published his work, it became apparent that proof theory still had some use, the only difference is that it could not be used

Logical framework (965 words) [view diff] case mismatch in snippet view article find links to article

but a free version has been made available.) David Pym. A Note on the Proof Theory of the λ Π {\displaystyle \lambda \Pi } -calculus. Studia Logica 54:

Frederic Fitch (445 words) [view diff] case mismatch in snippet view article find links to article

A&C Black. pp. 799–802. ISBN 978-1-84371-037-0. Bimbó, Katalin (2014), Proof Theory: Sequent Calculi and Related Formalisms, Discrete Mathematics and Its

Interpretability logic (610 words) [view diff] case mismatch in snippet view article find links to article

Giorgi Japaridze. Giorgi Japaridze and Dick de Jongh, The Logic of Provability. In Handbook of Proof Theory, S. Buss, ed., Elsevier, 1998, pp. 475-546.

Declarative programming (2,373 words) [view diff] exact match in snippet view article find links to article

declarative semantics for the language can be based on the model or the proof theory (or both) of the logic. "An overview on dsls". Archived from the original

William Alvin Howard (244 words) [view diff] case mismatch in snippet view article find links to article

University of Chicago Library Catalog. Retrieved 2015-05-04. M. Rathjen, "Proof Theory: From arithmetic to set theory". Accessed 22 February 2024. 2018 Class

Vincent F. Hendricks (982 words) [view diff] case mismatch in snippet view article find links to article

2006) New Waves in Epistemology (New York: Palgrave MacMillan, 2007) Proof Theory (Dordrecht: Springer, 2001) Probability Theory (Dordrecht: Springer,

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

the formation of a major Leningrad school of mathematical logic and proof theory. This work extended into areas such as computability (e.g., Yuri Matiyasevich)

Samuel Buss (324 words) [view diff] case mismatch in snippet view article find links to article

The Boolean formula value problem is in ALOGTIME Bounded arithmetic Handbook of Proof Theory 3D Computer Graphics: A mathematical approach with OpenGL

Herbrandization (591 words) [view diff] exact match in snippet view article find links to article

theorem". (In van Heijenoort 1967, 252-63.) Herbrand, J. "Investigations in proof theory: The properties of true propositions". (In van Heijenoort 1967, 525-81

Harrop formula (573 words) [view diff] exact match in snippet view article find links to article

ISBN 0-19-850524-8. A. S. Troelstra; H. Schwichtenberg (27 July 2000). Basic proof theory. Cambridge University Press. ISBN 0-521-77911-1. Ronald Harrop (1956)

Agata Ciabattoni (323 words) [view diff] no match in snippet view article find links to article

completed her Ph.D. in 2000 at the University of Milan. Her dissertation, Proof-theory in many-valued logics, was supervised by Daniele Mundici. She moved to

Brouwer–Heyting–Kolmogorov interpretation (1,365 words) [view diff] case mismatch in snippet view article find links to article

Twentieth Century" (PDF). Troelstra, A. (2003). "Constructivism and Proof Theory (draft)". CiteSeerX 10.1.1.10.6972. Van Atten, Mark (4 May 2022). "The

Michael Detlefsen (692 words) [view diff] case mismatch in snippet view article find links to article

Hellman and R. Cook (eds.), 161–178, Springer, 2018 "On the Motives for Proof Theory", in H. Wansing (ed.), Dag Prawitz on Proofs and Meaning, 137–164, Outstanding

Bar recursion (409 words) [view diff] case mismatch in snippet view article find links to article

Jeremy Avigad; Solomon Feferman (1999). "VI: Gödel's functional ("Dialectica") interpretation". In S. R. Buss (ed.). Handbook of Proof Theory (PDF). v t e

Exact completion (419 words) [view diff] exact match in snippet view article find links to article

(15 September 1995). "Some free constructions in realizability and proof theory". Journal of Pure and Applied Algebra. 103 (2): 117–148. doi:10

Proof assistant (1,206 words) [view diff] case mismatch in snippet view article find links to article

computer science, philosophy and logic". In Buss, S. R. (ed.). Handbook of Proof Theory. Studies in Logic. Vol. 137. Elsevier. pp. 683–786. ISBN 978-0-08-053318-6

Alexander Esenin-Volpin (2,002 words) [view diff] exact match in snippet view article find links to article

mathematics", in Kino, A.; Myhill, J.; Vesley, R. E. (eds.), Intuitionism and proof theory (Proc. Conf., Buffalo, N.Y., 1968), Studies in Logic and the Foundations

Negation as failure (1,318 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle p} holds by default). Bílková, M.; Colacito, A. (2020). "Proof Theory for Positive Logic with Weak Negation". Studia Logica. 108 (4): 649–686

Silver's dichotomy (350 words) [view diff] case mismatch in snippet view article find links to article

"Subsystems of Z2 and Reverse Mathematics", p.442. Appearing in G. Takeuti, Proof Theory (1987), ISBN 0 444 87943 9. L. Yanfang, On Silver's Dichotomy, Ph.D thesis

Buchholz hydra (1,431 words) [view diff] exact match in snippet view article find links to article

ISSN 0003-486X, JSTOR 2006985, retrieved 2021-09-03 Takeuti, Gaisi (2013), Proof theory (2nd edition (reprint) ed.), Newburyport: Dover Publications, ISBN 978-0-486-32067-0

Brouwer–Hilbert controversy (4,411 words) [view diff] exact match in snippet view article find links to article

arguments in proof theory be carried out in hypothetical generality, on any proof, on any numeral. ... It seems to me that Hilbert's proof theory shows Poincaré

Giorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article

Beklemishev, in 2004, pointed out its usefulness in understanding the proof theory of arithmetic (provability algebras and proof-theoretic ordinals). Japaridze

Switching lemma (869 words) [view diff] case mismatch in snippet view article find links to article

bounded arithmetic and first order bounded arithmetic", Arithmetic, Proof Theory and Computational Complexity, 23: 247–277, doi:10.1093/oso/9780198536901

Glossary of rhetorical terms (4,040 words) [view diff] no match in snippet view article find links to article

are pleasing to the senses. Brevitas – concise expression. Burden of proof – theory of argument giving the obligation of proving a case to the asserting

Admissible ordinal (660 words) [view diff] exact match in snippet view article find links to article

"An extended predicative definition of the Mahlo universe", Ways of proof theory, Ontos Math. Log., vol. 2, Ontos Verlag, Heusenstamm, pp. 315–340, MR 2883363

Categorial grammar (3,689 words) [view diff] exact match in snippet view article find links to article

ISBN 0-262-22053-9 Wojciech Buszkowski, Mathematical linguistics and proof theory, Chapter 12 in J. van Benthem and A. ter Meulen (eds.) Handbook of Logic

Klaus Mainzer (2,153 words) [view diff] case mismatch in snippet view article find links to article

Singapore, 2018, ISBN 978-981-3270-93-0. Proof and Computation II. From Proof Theory and Univalent Mathematics to Program Extraction and Verification. World

Lévy hierarchy (1,396 words) [view diff] case mismatch in snippet view article find links to article

Journal of Symbolic Logic vol. 56, iss. 2 (1991), pp.439--457. W. Pohlers, Proof Theory: The First Step into Impredicativity (2009) (p.245) Jon Barwise, Admissible

Jensen hierarchy (1,201 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle \alpha } for all natural n {\displaystyle n} . Wolfram Pohlers, Proof Theory: The First Step Into Impredicativity (2009) (p.247) K. Devlin, An introduction

Löb's theorem (1,886 words) [view diff] case mismatch in snippet view article find links to article

VII - The Logic of Provability". In Buss, Samuel R. (ed.). Handbook of Proof Theory. Studies in Logic and the Foundations of Mathematics. Vol. 137. Elsevier

Jane Kister (687 words) [view diff] case mismatch in snippet view article find links to article

also co-edited the Ω-Bibliography of Mathematical Logic, Volume VI: Proof Theory, Constructive Mathematics (Perspectives in Mathematical Logic, Springer

Well-quasi-ordering (3,055 words) [view diff] exact match in snippet view article find links to article

about Kruskal's theorem and the ordinal Γo? A survey of some results in proof theory". Annals of Pure and Applied Logic. 53 (3): 199–260. doi:10.1016/0168-0072(91)90022-E

Yuri Gurevich (836 words) [view diff] case mismatch in snippet view article find links to article

computational complexity. In M Richter et al. (eds.), Computation and Proof Theory. Springer Lecture Notes in Mathematics 1104, 1984, 175-216. Y. Gurevich

Algebra (13,739 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-0-521-55821-1. Retrieved 2024-03-12. Ono, Hiroakira (2019). Proof Theory and Algebra in Logic. Springer. ISBN 978-981-13-7997-0. OUP Staff. "Algebra"

Alpha recursion theory (1,455 words) [view diff] exact match in snippet view article find links to article

Admissible Ordinals" (1974), p.30. Accessed 7 February 2023. T. Arai, Proof theory for theories of ordinals - I: recursively Mahlo ordinals (1998). p.2

Liouville's theorem (differential algebra) (1,421 words) [view diff] exact match in snippet view article

mathematical function Elementary function arithmetic – System of arithmetic in proof theory Liouvillian function – Elementary functions and their finitely iterated

Intuitionistic logic (8,022 words) [view diff] exact match in snippet view article find links to article

Amsterdam: Elsevier. ISBN 978-0-444-52077-7. Takeuti, Gaisi (2013) [1975]. Proof theory (Second ed.). Mineola, New York: Dover Publications. ISBN 978-0-486-49073-1

Kripke semantics (4,818 words) [view diff] case mismatch in snippet view article find links to article

University Press. p. 397. ISBN 978-0521899437. Simpson, Alex K. (1994). The Proof Theory and Semantics of Intuitionistic Modal Logic (Thesis). Edinburgh Research

Reputation marketing (1,123 words) [view diff] exact match in snippet view article find links to article

only to personal recommendations. This gives credibility to the social proof theory; most famously studied by Muzafer Sherif, and highlighted as one of the

Paul Volkmann (400 words) [view diff] case mismatch in snippet view article find links to article

Frovin (eds.), "The Empiricist Roots of Hilbert's Axiomatic Approach", Proof Theory, Dordrecht: Springer Netherlands, pp. 35–54, doi:10.1007/978-94-017-2796-9_3

Orders of magnitude (numbers) (12,994 words) [view diff] exact match in snippet view article

integers: a set of numbers defined in 2000 by Harvey Friedman, appears in proof theory. Mathematics: Rayo's number is a large number named after Agustín Rayo

Reflection principle (3,584 words) [view diff] case mismatch in snippet view article find links to article

Simpson, Subsystems of Second Order Arithmetic (2009) M. Rathjen, "Proof Theory of Reflection". Annals of Pure and Applied Logic, vol. 68, issue 2 (1994)

Ordinal collapsing function (12,608 words) [view diff] exact match in snippet view article find links to article

377–403. doi:10.1007/BF01621475. S2CID 9376863. Rathjen, Michael (1994). "Proof theory of reflection" (PDF). Annals of Pure and Applied Logic. 68 (2): 181–224