27 found
Order:
Disambiguations
Andre Scedrov [25]Andrej Ščedrov [3]
  1.  20
    Decision Problems for Propositional Linear Logic.Patrick Lincoln, John Mitchell, Andre Scedrov & Natarajan Shankar - 1992 - Annals of Pure and Applied Logic 56 (1-3):239-311.
    Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic accounting of resources. This accounting is made possible by removing the ‘structural’ rules of contraction and weakening, adding a modal operator and adding finer versions of the propositional connectives. Linear logic has fundamental logical interest and applications to computer science, particularly to Petri nets, concurrency, storage allocation, garbage collection and the control structure of logic programs. In addition, there is a direct correspondence between polynomial-time computation (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   36 citations  
  2.  26
    Uniform Proofs as a Foundation for Logic Programming.Dale Miller, Gopalan Nadathur, Frank Pfenning & Andre Scedrov - 1991 - Annals of Pure and Applied Logic 51 (1-2):125-157.
    Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic 51 125–157. A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its operational meaning, provided by interpreting logical connectives as simple and fixed search instructions. The (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  3.  11
    Linearizing Intuitionistic Implication.Patrick Lincoln, Andre Scedrov & Natarajan Shankar - 1993 - Annals of Pure and Applied Logic 60 (2):151-177.
    An embedding of the implicational propositional intuitionistic logic into the nonmodal fragment of intuitionistic linear logic is given. The embedding preserves cut-free proofs in a proof system that is a variant of IIL. The embedding is efficient and provides an alternative proof of the PSPACE-hardness of IMALL. It exploits several proof-theoretic properties of intuitionistic implication that analyze the use of resources in IIL proofs.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  4.  3
    [Omnibus Review].Andre Scedrov - 1987 - Journal of Symbolic Logic 52 (2):561-561.
  5.  9
    Set Existence Property for Intuitionistic Theories with Dependent Choice.Harvey M. Friedman & Andrej Ščedrov - 1983 - Annals of Pure and Applied Logic 25 (2):129-140.
  6.  10
    On Some Non-Classical Extensions of Second-Order Intuitionistic Propositional Calculus.Andrej Ščedrov - 1984 - Annals of Pure and Applied Logic 27 (2):155-164.
  7.  9
    Lindenbaum Algebras of Intuitionistic Theories and Free Categories.Peter Freyd, Harvey Friedman & Andre Scedrov - 1987 - Annals of Pure and Applied Logic 35 (2):167-172.
    We consider formal theories synonymous with various free categories . Their Lindenbaum algebras may be described as the lattices of subobjects of a terminator. These theories have intuitionistic logic. We show that the Lindenbaum algebras of second order and higher order arithmetic , and set theory are not isomorphic to the Lindenbaum algebras of first order theories such as arithmetic . We also show that there are only five kernels of representations of the free Heyting algebra on one generator in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  8
    Diagonalization of Continuous Matrices as a Representation of Intuitionistic Reals.Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):201-206.
  9.  32
    Complete Topoi Representing Models of Set Theory.Andreas Blass & Andre Scedrov - 1992 - Annals of Pure and Applied Logic 57 (1):1-26.
    By a model of set theory we mean a Boolean-valued model of Zermelo-Fraenkel set theory allowing atoms (ZFA), which contains a copy of the ordinary universe of (two-valued,pure) sets as a transitive subclass; examples include Scott-Solovay Boolean-valued models and their symmetric submodels, as well as Fraenkel-Mostowski permutation models. Any such model M can be regarded as a topos. A logical subtopos E of M is said to represent M if it is complete and its cumulative hierarchy, as defined by Fourman (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  20
    Large Sets in Intuitionistic Set Theory.Harvey Friedman & Andrej Ščedrov - 1984 - Annals of Pure and Applied Logic 27 (1):1-24.
    We consider properties of sets in an intuitionistic setting corresponding to large cardinals in classical set theory. Adding such ‘large set axioms’ to intuitionistic ZF set theory does not violate well-know metamathematical properties of intuitionistic systems. Moreover, we consider statements in constructive analysis equivalent to the consistency of such ‘large set axioms’.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  10
    Intuitionistically Provable Recursive Well-Orderings.Harvey M. Friedman & Andre Scedrov - 1986 - Annals of Pure and Applied Logic 30 (2):165-171.
    We consider intuitionistic number theory with recursive infinitary rules . Any primitive recursive binary relation for which transfinite induction schema is provable is in fact well founded. Its ordinal is less than ε 0 if the transfinite induction schema is intuitionistically provable in elementary number theory. These results are provable intuitionistically. In fact, it suffices to consider transfinite induction with respect to one particular number-theoretic property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  7
    Some Properties of Epistemic Set Theory with Collection.Andre Scedrov - 1986 - Journal of Symbolic Logic 51 (3):748-754.
  13.  4
    Embedding Sheaf Models for Set Theory Into Boolean-Valued Permutation Models with an Interior Operator.Andre Scedrov - 1986 - Annals of Pure and Applied Logic 32:103-109.
  14.  4
    On the Impossibility of Explicit Upper Bounds on Lengths of Some Provably Finite Algorithms in Computable Analysis.Andre Scedrov - 1986 - Annals of Pure and Applied Logic 32:291-297.
  15. Stanford University, Stanford, CA March 19–22, 2005.Steve Awodey, Raf Cluckers, Ilijas Farah, Solomon Feferman, Deirdre Haskell, Andrey Morozov, Vladimir Pestov, Andre Scedrov, Andreas Weiermann & Jindrich Zapletal - 2006 - Bulletin of Symbolic Logic 12 (1).
     
    Export citation  
     
    Bookmark  
  16.  11
    18th Workshop on Logic, Language, Information and Computation (Wollic 2011).Lev Beklemishev, Ruy de Queiroz & Andre Scedrov - 2012 - Bulletin of Symbolic Logic 18 (1):152-153.
  17.  10
    Small Decidable Sheaves.Andreas Blass & Andre Scedrov - 1986 - Journal of Symbolic Logic 51 (3):726-731.
  18. ""Full-Text of Current Issues of The Bulletin of Symbolic Logic and The Journal of Symbolic Logic is Available to All ASL Members Electronically Via Project Euclid. Individual Members Who Wish to Gain Access Should Follow These Instructions:(1) Go to Http://Projecteuclid. Org:(2) in the" for Subscribers' Tab. Click on 'Log in for Existing Subscribers':(3) Click on" Create a Profile Here" in the Center of the Login Page:(4) Fill in at Least the Required Fields. [REVIEW]Deirdre Haskell Denis Hirschfeldt, Andre Scedrov & Ralf Schindler - 2006 - Bulletin of Symbolic Logic 12 (2):362.
     
    Export citation  
     
    Bookmark  
  19.  1
    Correction to: The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.Max Kanovich, Stepan Kuznetsov & Andre Scedrov - 2021 - Journal of Logic, Language and Information 30 (1):89-89.
    In the original publication, the affiliation of the author Max Kanovich was processed incorrectly. It has been updated in this correction.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  20.  3
    The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.Max Kanovich, Stepan Kuznetsov & Andre Scedrov - 2021 - Journal of Logic, Language and Information 30 (1):31-88.
    We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill’s calculi, and focus on their fragments including multiplicative connectives, additive conjunction and disjunction, brackets and bracket modalities, and the! subexponential modality. For both systems, we resolve issues connected with the cut rule and provide necessary modifications, after which we prove admissibility of cut. We also prove algorithmic undecidability for both (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  15
    Linear Logic Proof Games and Optimization.Patrick D. Lincoln, John C. Mitchell & Andre Scedrov - 1996 - Bulletin of Symbolic Logic 2 (3):322-338.
  22.  24
    A. A. Markov and N. M. Nagorny. The Theory of Algorithms. English Translation by M. Greendlinger of Teoriya Algorifmov. Mathematics and its Applications . Kluwer Academic Publishers, Dordrecht, Boston, and London, 1988, Xxiv + 369 Pp. [REVIEW]Andre Scedrov - 1991 - Journal of Symbolic Logic 56 (1):336-337.
  23.  5
    2001 Annual Meeting of the Association for Symbolic Logic.Andre Scedrov - 2001 - Bulletin of Symbolic Logic 7 (3):420-435.
  24.  8
    G. E. Mints. E Theorems. Journal of Soviet Mathematics, Vol. 8 , Pp. 323–329. - G. É. Minc. Ustojčivost' E-Téorém I Provérka Programm . Sémiotika I Informatika, Vol. 12 , Pp. 73–77. - Justus Diller. Functional Interpretations of Heyting's Arithmetic in All Finite Types. Nieuw Archief Voor Wiskunde, Ser. 3 Vol. 27 , Pp. 70–97. - Martin Stein. Interpretations of Heyting's Arithmetic—an Analysis by Means of a Language with Set Symbols. Annals of Mathematical Logic, Vol. 19 , Pp. 1–31. - Martin Stein. A General Theorem on Existence Theorems. Zeitschrifi Für Mathematische Logik Und Grundlagen der Mathematik, Vol. 27 , Pp. 435–452. [REVIEW]Andre Scedrov - 1987 - Journal of Symbolic Logic 52 (2):561-561.
  25.  3
    Preface.Andre Scedrov - 1994 - Annals of Pure and Applied Logic 69 (2-3):133.
  26.  10
    Review: A. A. Markov, N. M. Nagorny, M. Greendlinger, The Theory of Algorithms. [REVIEW]Andre Scedrov - 1991 - Journal of Symbolic Logic 56 (1):336-337.
  27. The Papers in This Special Issue Were Invited From Papers Presented at the 1992 IEEE Symposium on Logic in Computer Science. All of the Invited Papers Have Been Refereed in the Usual Manner; in Most Cases, They Are Substantially Revised and Expanded. I Thank the Authors and the Referees for Their Effort. [REVIEW]Andre Scedrov - 1994 - Annals of Pure and Applied Logic 69:133.