Structured theory presentations and logic representations (Q1326777): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Nuprl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Elf / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cambridge LCF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Automath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0168-0072(94)90009-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969510795 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple consequence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using typed lambda calculus to implement formal systems on a machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3906394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized algebraic theories and contextual categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Institutions: abstract model theory for specification and programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data types and software validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A module system for a programming language based on the LF logical framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic representation in LF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of Proof Systems for Equational Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3032225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3204068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3042444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward formal development of programs from algebraic specifications: Parameterisation revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4725720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specifications in an arbitrary institution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward formal development of programs from algebraic specifications: Implementations revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward formal development of programs from algebraic specifications: Model-theoretic foundations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus for the construction of modular prolog programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3776610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some fundamental algebraic tools for the semantics of computation. III: Indexed categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Type Specification: Parameterization and the Power of Specification Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured algebraic specifications: A kernel language / rank
 
Normal rank

Latest revision as of 16:25, 22 May 2024

scientific article
Language Label Description Also known as
English
Structured theory presentations and logic representations
scientific article

    Statements

    Structured theory presentations and logic representations (English)
    0 references
    0 references
    0 references
    0 references
    29 March 1995
    0 references
    The paper proposes an adequate language of structured theory presentations, focusing on ``lifting'' the structured presentations from the level of the object logic to the level of the metalogic and, particularly, on the conditions under which proofs in the metalogic for lifted structured presentations soundly represent proofs for structured presentations in the object logic. These ideas are made explicit in the context of Logical Framework (LF) [\textit{R. Harper, F. Honsell} and \textit{G. Plotkin}, J. Assoc. Comput. Mach. 40, 143-184 (1993; Zbl 0778.03004)]as metalogic, a three-level typed \(\lambda\)-calculus with \(\pi\)-types, and a suitable meta-language for defining formal systems. LF provides the basic machinery not only for ``putting together theories'' through structured theory presentations, but also allows for ``putting together logics'' through structured logic presentations. LF opens the possibility of using several logical systems at the same time: e.g., the encoding of S4 modal logic as a combination of the truth and validity consequence relations of S4, the parametrization of Hoare logic of assertions, or adding a connective to a logic. Section 2 introduces a general definition of a logical system as a family of consequence relations indexed by signatures that satisfy a certain uniformity condition with respect to change of signature. The sorts of consequence relations that are considered to encoding in LF are limited to one-sided consequence relations which are closed under weakening, permutation, contraction, and cut, and satisfy the compactness property. Section 3 defines structured theory presentations in an arbitrary logical system, the natural proof system induced by the structure of the presentations being discussed in Section 4. Generalizing the LF approach, Section 5 defines the notion of a representation of one logical system in another and considers the problem of ``lifting'' a structured presentation along a representation of one logical system in another. The notion of proof is defined by the conditions of the representation and by the restrictions imposed by the metalogic. Section 6 introduces the LF metalogic as a logical system and defines the notion of logic presentation as an LF signature together with a representation of the object logic in the logical system by the representation. Section 7 returns to the problem of proof in structured theory presentations for the specific setting of logics encoded in LF, while Section 8 explores the colimit construction as a tool for building logics in a structured way. Finally, Sections 9 and 10 discuss related work and future research directions.
    0 references
    0 references
    0 references
    0 references
    0 references
    logical framework for structured theory presentation
    0 references
    building proof systems in a structured way
    0 references
    consequence relations
    0 references
    representation of one logical system in another
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references