63 research outputs found

    An Open Logical Framework

    Get PDF
    The LFP Framework is an extension of the Harper-Honsell-Plotkin's Edinburgh Logical Framework LF with external predicates, hence the name Open Logical Framework. This is accomplished by defining lock type constructors, which are a sort of \u25a1-modality constructors, releasing their argument under the condition that a possibly external predicate is satisfied on an appropriate typed judgement. Lock types are defined using the standard pattern of constructive type theory, i.e. via introduction, elimination and equality rules. Using LFP, one can factor out the complexity of encoding specific features of logical systems, which would otherwise be awkwardly encoded in LF, e.g. side-conditions in the application of rules in Modal Logics, and sub-structural rules, as in non-commutative Linear Logic. The idea of LFP is that these conditions need only to be specified, while their verification can be delegated to an external proof engine, in the style of the Poincar Principle or Deduction Modulo. Indeed such paradigms can be adequately formalized in LFP. We investigate and characterize the meta-theoretical properties of the calculus underpinning LFP: strong normalization, confluence and subject reduction. This latter property holds under the assumption that the predicates are well-behaved, i.e. closed under weakening, permutation, substitution and reduction in the arguments. Moreover, we provide a canonical presentation of LFP, based on a suitable extension of the notion of \u3b2\u3b7-long normal form, allowing for smooth formulations of adequacy statements. \ua9 The Author, 2013

    Reasoning about Resource-Sensitive Multi-Agents

    Get PDF

    Transfinite Step-indexing for Termination

    Get PDF

    Proceedings of the Workshop on Linear Logic and Logic Programming

    Get PDF
    Declarative programming languages often fail to effectively address many aspects of control and resource management. Linear logic provides a framework for increasing the strength of declarative programming languages to embrace these aspects. Linear logic has been used to provide new analyses of Prolog\u27s operational semantics, including left-to-right/depth-first search and negation-as-failure. It has also been used to design new logic programming languages for handling concurrency and for viewing program clauses as (possibly) limited resources. Such logic programming languages have proved useful in areas such as databases, object-oriented programming, theorem proving, and natural language parsing. This workshop is intended to bring together researchers involved in all aspects of relating linear logic and logic programming. The proceedings includes two high-level overviews of linear logic, and six contributed papers. Workshop organizers: Jean-Yves Girard (CNRS and University of Paris VII), Dale Miller (chair, University of Pennsylvania, Philadelphia), and Remo Pareschi, (ECRC, Munich)

    A logic of negative trust

    Get PDF
    We present a logic to model the behaviour of an agent trusting or not trusting messages sent by another agent. The logic formalises trust as a consistency checking function with respect to currently available information. Negative trust is modelled in two forms: distrust, as the rejection of incoming inconsistent information; mistrust, as revision of previously held information becoming undesirable in view of new incoming inconsistent information, which the agent wishes to accept. We provide a natural deduction calculus, a relational semantics and prove soundness and completeness results. We overview a number of applications which have been investigated for the proof-theoretical formulation of the logic

    Modalities and Parametric Adjoints

    Get PDF

    Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

    Get PDF
    This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL , in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established

    Labeled natural deduction for temporal logics

    Get PDF
    Nonostante la notevole rilevanza delle logiche temporali in molti campi dell'informatica, la loro analisi teorica non è certo da ritenersi conclusa. In particolare, molti sono i punti ancora aperti nell'ambito della teoria della dimostrazione, specialmente se consideriamo le logiche temporali di tipo branching. Il principale contributo di questa tesi consiste nella presentazione di un approccio modulare per la definizione di sistemi di deduzione naturale etichettata per un'ampia gamma di logiche temporali. Viene innanzitutto proposto un sistema per la logica temporale minimale di Prior; si mostra quindi come estenderlo in maniera modulare allo scopo di trattare logiche più complesse, quali ad esempio LTL. Viene infine proposta un'estensione al caso delle logiche branching, concentrando l'attenzione sulle logiche con semantica di tipo Ockhamist e bundled. Per i sistemi proposti, viene condotta una dettagliata analisi dal punto di vista della teoria della dimostrazione. In particolare, nel caso delle logiche del tempo discreto, per le quali si richiedono regole che modellino un principio di induzione, viene definita una procedura di normalizzazione ispirata da quelle dei sistemi per l'Aritmetica di Heyting. Come conseguenza, si ottiene una dimostrazione puramente sintattica della consistenza dei sistemi.Despite the great relevance of temporal logics in many applications of computer science, their theoretical analysis is far from being concluded. In particular, we still lack a satisfactory proof theory for temporal logics and this is especially true in the case of branching-time logics. The main contribution of this thesis consists in presenting a modular approach to the definition of labeled (natural) deduction systems for a large class of temporal logics. We start by proposing a system for the basic Priorean tense logic and show how to modularly enrich it in order to deal with more complex logics, like LTL. We also consider the extension to the branching case, focusing on the Ockhamist branching-time logics with a bundled semantics. A detailed proof-theoretical analysis of the systems is performed. In particular, in the case of discrete-time logics, for which rules modeling an induction principle are required, we define a procedure of normalization inspired to those of systems for Heyting Arithmetic. As a consequence of normalization, we obtain a purely syntactical proof of the consistency of the systems
    • …
    corecore