Realizability in cyclic proof: extracting ordering information for infinite descent

DOI10.1007/978-3-319-66902-1_18zbMath1496.03233OpenAlexW2751381847MaRDI QIDQ1694474

Reuben N. S. Rowe, James Brotherston

Publication date: 2 February 2018

Full work available at URL: https://kar.kent.ac.uk/62287/1/Realizability%20in%20Cyclic%20Proof.pdf

zbMATH Keywords

sequent calculusrealizabilityentailmentweighted automataapproximation semanticsinfinite descentcyclic proofinductive predicates

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Structure of proofs (03F07)

Related Items (3)

Uniform interpolation from cyclic proofs: the case of modal mu-calculus ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Realizability in cyclic proof: extracting ordering information for infinite descent