scientific article; zbMATH DE number 1493054

zbMath1013.03001MaRDI QIDQ4496851

Stephen Semmes, Alessandra Carbone

Publication date: 20 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

symmetrydualitycut eliminationgraph theoryrecursionNP-completenessproof theoryoriented graphsfinite automataformal languagesvisibility graphcomplexity theorygraphs and groupsrecursively presented groupsimplicit definitionscomplex formal objectsmorphisms in logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Metric spaces, metrizability (54E35) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Structure of proofs (03F07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Graph theory (05Cxx)

Related Items (7)

Automatic graphs and D0L-sequences of finite graphs ⋮ Cut and pay ⋮ A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs ⋮ Asymptotic cyclic expansion and bridge groups of formal proofs ⋮ Logical structures and genus of proofs ⋮ Streams and strings in formal proofs. ⋮ Group cancellation and resolution

This page was built for publication: