logic, structural proof theory is the subdiscipline of proof theory that studies proof calculi that support a notion of analytic proof, a kind of proof whose...

include structural proof theory, ordinal analysis, provability logic, reverse mathematics, proof mining, automated theorem proving, and proof complexity...

sequent calculus, which is the most studied formalism of structural proof theory. Many other proof calculi were, or might have been, seminal, but are not...

In mathematical logic, deep inference names a general idea in structural proof theory that breaks with the classical sequent calculus by generalising...

distinct proof calculi, so defining the subfield of structural proof theory. There is no uncontroversial general definition of analytic proof, but for...

logic, the calculus of structures is a proof calculus with deep inference for studying the structural proof theory of noncommutative logic. The calculus...

generality with other features expected of good structural proof theories, such as purity (the proof theory does not introduce extra-logical notions such...

Structural induction is a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some...

set, the continuous image of a Polish space Analytic proof, in structural proof theory, a proof whose structure is simple in a special way Analytic tableau...

contributions to the philosophy of logic, temporal logic, and structural proof theory. He taught at the University of Pittsburgh from 1963 until his...

In structural proof theory, the nested sequent calculus is a reformulation of the sequent calculus to allow deep inference. Alwen Tiu; Egor Ianovski;...

Sequent Sequent calculus Analytic proof Structural proof theory Self-verifying theories Substructural logics Structural rule Weakening Contraction Linear...

In the logical discipline of proof theory, a structural rule is an inference rule of a sequent calculus that does not refer to any logical connective but...

focused proofs are a family of analytic proofs that arise through goal-directed proof-search, and are a topic of study in structural proof theory and reductive...

In computational complexity theory of computer science, the structural complexity theory or simply structural complexity is the study of complexity classes...

co-author, with Jan von Plato, of two books: Structural Proof Theory (Cambridge University Press, 2001) Proof Analysis: A Contribution to Hilbert's Last...

hypersequent framework is an extension of the proof-theoretical framework of sequent calculi used in structural proof theory to provide analytic calculi for logics...

vehicles where structural integrity affects functioning and safety. See glossary of structural engineering. Structural engineering theory is based upon...

free dictionary. Weakening may refer to Weakening (logic), a structural rule in proof theory Weakening (linguistics), a sound change that can be described...

Stability theory Rahman, Aminur; Blackmore, D. (2023). "The One-Dimensional Version of Peixoto's Structural Stability Theorem: A Calculus-Based Proof". SIAM...

In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that...

"Handbook of Proof Theory". Chapter 1, "An Introduction to Proof Theory". Elsevier, 1998. Dale Miller: A Compact Representation of Proofs. Studia Logica...

In computational complexity theory, the space hierarchy theorems are separation results that show that both deterministic and nondeterministic machines...

Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic...

In computational complexity theory, the time hierarchy theorems are important statements about time-bounded computation on Turing machines. Informally...

for Gentzen-style substructural sequent logics as developed in structural proof theory, and in the co-authored "Stoic Logic and Multiple Generality" she...

uncountability proof, which differs from the more familiar proof using his diagonal argument. Cantor introduced fundamental constructions in set theory, such as...

transfinite induction. It is an important proof technique in set theory, topology and other fields. Proofs by transfinite induction typically distinguish...

can vary in strength, ranging from weak correlation to indisputable proof. Theories of the evidential relation examine the nature of this connection. Probabilistic...

each of these in computer proof assistants. There is a large overlap between the work referred to as homotopy type theory, and that called the univalent...