Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (Q5079741): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalised Inductive Reasoning in the Logic of Bunched Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic proofs of program termination in separation logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequent calculi for induction and infinite descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness for ancestral logic via a computationally-meaningful semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ancestral Logic: A Proof Theoretical Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cut-free cyclic proof system for Kleene algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness in the theory of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Models and Completeness of First-Order Modal  -calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accessible Independence Results for Peano Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Arithmetic Is Equivalent to Peano Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof theory. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatically verifying temporal properties of pointer programs with cyclic proof / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://dblp.uni-trier.de/db/conf/csl/csl2018.html#0001R18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2888803631 / rank
 
Normal rank
Property / title
 
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (English)
Property / title: Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:04, 30 July 2024

scientific article; zbMATH DE number 7533342
Language Label Description Also known as
English
Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent
scientific article; zbMATH DE number 7533342

    Statements

    0 references
    0 references
    28 May 2022
    0 references
    induction
    0 references
    transitive closure
    0 references
    infinitary proof systems
    0 references
    cyclic proof systems
    0 references
    soundness
    0 references
    completeness
    0 references
    standard semantics
    0 references
    henkin semantics
    0 references
    Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (English)
    0 references

    Identifiers