Partial inductive definitions
From MaRDI portal
Publication:1177153
DOI10.1016/S0304-3975(06)80007-1zbMath0770.68039OpenAlexW4210556102MaRDI QIDQ1177153
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(06)80007-1
Abstract data types; algebraic specification (68Q65) Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03)
Related Items
Nominal logic, a first order theory of names and binding, A Formal Theory of Justifications, European Summer Meeting of the Association for Symbolic Logic, The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics, Encoding transition systems in sequent calculus, Cut elimination for a logic with induction and co-induction, Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax, Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut, Blurring: an approach to conflation, Partial inductive definitions as type-systems for \(\lambda\)-terms, The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony, A family of metainferential logics, On the proof-theoretic foundation of general definition theory, Validity concepts in proof-theoretic semantics, Failure of completeness in proof-theoretic semantics, INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES, Steps towards a proof-theoretical semantics, Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning, Disjoint Logics, European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991, The practice of logical frameworks
Cites Work
