6 found
Sort by:
  1. Andreja Prijatelj (2001). Free Ordered Algebraic Structures Towards Proof Theory. Journal of Symbolic Logic 66 (2):597-608.
    In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction (n ≥ 2). Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  2. Andreja Prijatelj (1996). Free Algebras Corresponding to Multiplicative Classical Linear Logic and Some of Its Extensions. Notre Dame Journal of Formal Logic 37 (1):53-70.
    In this paper, constructions of free algebras corresponding to multiplicative classical linear logic, its affine variant, and their extensions with -contraction () are given. As an application, the cardinality problem of some one-variable linear fragments with -contraction is solved.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Andreja Prijatelj (1996). Bounded Contraction and Gentzen-Style Formulation of Łukasiewicz Logics. Studia Logica 57 (2-3):437 - 456.
    In this paper, we consider multiplicative-additive fragments of affine propositional classical linear logic extended with n-contraction. To be specific, n-contraction (n 2) is a version of the contraction rule where (n+ 1) occurrences of a formula may be contracted to n occurrences. We show that expansions of the linear models for (n + 1)- valued ukasiewicz logic are models for the multiplicative-additive classical linear logic, its affine version and their extensions with n-contraction. We prove the finite axiomatizability for the classes (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Andreja Prijatelj (1995). Connectification Forn-Contraction. Studia Logica 54 (2):149 - 171.
    In this paper, we introduce connectification operators for intuitionistic and classical linear algebras corresponding to linear logic and to some of its extensions withn-contraction. In particular,n-contraction (n2) is a version of the contraction rule, wheren+1 occurrences of a formula may be contracted ton occurrences. Since cut cannot be eliminated from the systems withn-contraction considered most of the standard proof-theoretic techniques to investigate meta-properties of those systems are useless. However, by means of connectification we establish the disjunction property for both intuitionistic (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  5. Andreja Prijatelj (1995). Reflections on “Difficult” Embeddings. Journal of Philosophical Logic 24 (1):71 - 84.
    The main purpose of this note is to present "difficult" embeddings of minimal and full intuitionistic logic into classical linear logic, and to prove their soundness and faithfulness. Moreover, it is also pointed out that Girard's translation of intuitionistic logic into classical linear logic is provably equivalent to one of the translations considered in this paper.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Andreja Prijatelj (1992). Lambek Calculus with Restricted Contraction and Expansion. Studia Logica 51 (1):125 - 143.
    This paper deals with some strengthenings of the non-directional product-free Lambek calculus by means of additional structural rules. In fact, the rules contraction and expansion are restricted to basic types. For each of the presented systems the usual proof-theoretic notions are discussed, some new concepts especially designed for these calculi are introduced reflecting their intermediate position between the weaker and the stronger sequent-systems.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation