Completeness for ancestral logic via a computationally-meaningful semantics

DOI10.1007/978-3-319-66902-1_15zbMATH Open1496.03126OpenAlexW2753717632MaRDI QIDQ1694469

Liron Cohen

Publication date: 2 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66902-1_15

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (4)

Ancestral Logic: A Proof Theoretical Study ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ Non-well-founded deduction for induction and coinduction ⋮ Integrating induction and coinduction via closure operators and proof cycles

Recommendations

• Title not available (Why is that?) 👍 👎
• Completeness for the classical antecedent fragment of inquisitive first-order logic 👍 👎
• Completeness theory for propositional logics 👍 👎
• Ancestral Logic: A Proof Theoretical Study 👍 👎
• On Completeness of Logic Programs 👍 👎
• Completeness and incompleteness for anodic modal logics 👍 👎
• Completeness of implicational relevant logics 👍 👎
• The Ontological Innocence of Schematic Logic 👍 👎
• Intuitionistic ancestral logic 👍 👎
• Completeness in Proof-Theoretic Semantics 👍 👎

This page was built for publication: Completeness for ancestral logic via a computationally-meaningful semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694469)