Asymptotic cyclic expansion and bridge groups of formal proofs

DOI10.1006/jabr.2000.8700zbMath0986.03043OpenAlexW2043181351WikidataQ57253072 ScholiaQ57253072MaRDI QIDQ5945614

No author found.

Publication date: 6 June 2002

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.2000.8700

zbMATH Keywords

cut eliminationsequent calculusformal proofsBaumslag-Solitar groupsbridge group of a proofcombinatorial invariantcyclic structure of proofselimination of lemmasGersten groupslogical flow graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (3)

Structure of proofs and the complexity of cut elimination ⋮ 2010 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '10 ⋮ Streams and strings in formal proofs.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Interpolants, cut elimination and flow graphs for the propositional calculus
• The intractability of resolution
• Proof theory. 2nd ed
• The number of proof lines and the size of proofs in first order logic
• Duplication of directed graphs and exponential blow up of proofs
• Topological dynamics and combinatorial number theory
• The undecidability of the second-order unification problem
• Lower bounds for increasing complexity of derivations after cut elimination
• The undecidability of \(k\)-provability
• Untersuchungen über das logische Schliessen. I
• Looking from the inside and from the outside
• A note on curvature and fundamental group
• Polynomial size proofs of the propositional pigeonhole principle
• Some two-generator one-relator non-Hopfian groups
• Bounds for proof-search and speed-up in the predicate calculus
• Lower Bounds on Herbrand's Theorem
• Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
• The cost of a cycle is a square
• Cycling in proofs and feasibility
• Existence and feasibility in arithmetic

This page was built for publication: Asymptotic cyclic expansion and bridge groups of formal proofs