27 found
Order:
  1.  47
    Extending the Curry-Howard Interpretation to Linear, Relevant and Other Resource Logics.Dov M. Gabbay & Ruy J. G. B. de Queiroz - 1992 - Journal of Symbolic Logic 57 (4):1319-1365.
  2.  19
    A Proof‐Theoretic Account of Programming and the Role of Reduction Rules.Ruy J. G. B. de Queiroz - 1988 - Dialectica 42 (4):265-282.
    SummaryLooking at proof theory as an attempt to ‘code’ the general pattern of the logical steps of a mathematical proof, the question of what kind of rules can make the meaning of a logical connective completely explicit does not seem to have been answered satisfactorily. The lambda calculus seems to have been more coherent simply because the use of ‘λ’ together with its projection 'apply' is specified by what can be called a 'reduction' rule: β‐conversion. We attempt to analyse the (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  68
    On Reduction Rules, Meaning-as-Use, and Proof-Theoretic Semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211-247.
    The intention here is that of giving a formal underpinning to the idea of ‘meaning-is-use’ which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett–Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i.e. the so-called reduction rules. For that we suggest an extension (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  22
    On Reduction Rules, Meaning-as-Use, and Proof-Theoretic Semantics.Ruy J. G. B. de Queiroz - 2008 - Studia Logica 90 (2):211 - 247.
    The intention here is that of giving a formal underpinning to the idea of 'meaning-is-use' which, even if based on proofs, it is rather different from proof-theoretic semantics as in the Dummett-Prawitz tradition. Instead, it is based on the idea that the meaning of logical constants are given by the explanation of immediate consequences, which in formalistic terms means the effect of elimination rules on the result of introduction rules, i. e. the so-called reduction rules. For that we suggest an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  31
    Abstract Data Types and Type Theory: Theories as Types.Ruy J. G. B. de Queiroz & Thomas S. E. Maibaum - 1991 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 37 (9-12):149-166.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  29
    Proof Theory and Computer Programming.Ruy J. G. B. de Queiroz & Thomas S. E. Maibaum - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (5):389-414.
  7.  17
    Proof Theory and Computer Programming.Ruy J. G. B. de Queiroz & Thomas S. E. Maibaum - 1990 - Mathematical Logic Quarterly 36 (5):389-414.
  8.  14
    Abstract Data Types and Type Theory: Theories as Types.Ruy J. G. B. de Queiroz & Thomas S. E. Maibaum - 1991 - Mathematical Logic Quarterly 37 (9‐12):149-166.
  9.  7
    The Functional Interpretation of the Existential Quantifier.Ruy J. G. B. de Queiroz & Dov M. Gabbay - 1995 - Logic Journal of the IGPL 3 (2-3):243-290.
  10. Normalisation and Languages-Games.Ruy J. G. B. de Queiroz - 1994 - Dialectica 48 (2):83-123.
     
    Export citation  
     
    Bookmark   2 citations  
  11. 10th Workshop on Logic, Language, Information and Computation (WoLLIC '2003): Co-Sponsored by the Association for Symbolic Logic, Ouro Preto (Minas Gerais), Brazil July 29-August 1, 2003. [REVIEW]Ruy J. G. B. de Queiroz - 2004 - Bulletin of Symbolic Logic 10 (2):295-296.
  12.  42
    Second Workshop on Logic, Language, Information and Computation.Ruy J. G. B. de Queiroz - 1996 - Logic Journal of the IGPL 4 (2):309-344.
  13.  37
    12th Workshop on Logic, Language, Information and Computation.Ruy J. G. B. de Queiroz - 2005 - Bulletin of Symbolic Logic 11 (4):558-559.
  14.  34
    9th Workshop on Logic, Language, Information and Computation.Rio de Janeiro & Ruy J. G. B. de Queiroz - 2003 - Bulletin of Symbolic Logic 9 (1):121-122.
  15. 12th Workshop on Logic, Language, Information and Computation, Florianópolis, Brasil, 19 a 22 de Julho de 2005.Ruy J. G. B. de Queiroz, Angus Macintyre & Guilherme Bittencourt (eds.) - 2005 - [S.N.].
     
    Export citation  
     
    Bookmark  
  16.  36
    Eighth Workshop on Logic, Language, Information and Computation (WoLLIC '2001).Ruy J. G. B. de Queiroz - 2002 - Bulletin of Symbolic Logic 8 (2):319-320.
  17.  15
    Propositional Intuitionistic Multiple-Conclusion Calculus Via Proof Graphs.Ruan V. B. Carvalho, Anjolina G. de Oliveira & Ruy J. G. B. de Queiroz - forthcoming - Logic Journal of the IGPL.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  21
    11th Workshop on Logic, Language, Information and Computation.Ruy J. G. B. de Queiroz - 2005 - Bulletin of Symbolic Logic 11 (1):120-121.
  19.  20
    Conferences.Ruy J. G. B. de Queiroz - 1996 - Logic Journal of the IGPL 4 (3):473-527.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  20
    5th Workshop on Logic, Language, Information and Computation.Ruy J. G. B. de Queiroz - 1999 - Bulletin of Symbolic Logic 5 (3):422-423.
  21.  22
    5th Workshop on Logic, Language, Information and Computation (Wollic'98).Ruy J. G. B. de Queiroz - 1999 - Bulletin of Symbolic Logic 5 (3):422-423.
  22.  18
    7th Workshop on Logic, Language, Information and Computation (WoLLIC'2000).Ruy J. G. B. de Queiroz - 2001 - Bulletin of Symbolic Logic 7 (2):293-294.
  23.  18
    On Dividing Chains in Simple Theories.Steffen Lewitzka & Ruy J. G. B. De Queiroz - 2005 - Archive for Mathematical Logic 44 (7):897-911.
    Dividing chains have been used as conditions to isolate adequate subclasses of simple theories. In the first part of this paper we present an introduction to the area. We give an overview on fundamental notions and present proofs of some of the basic and well-known facts related to dividing chains in simple theories. In the second part we discuss various characterizations of the subclass of low theories. Our main theorem generalizes and slightly extends a well-known fact about the connection between (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24.  16
    6th Workshop on Logic, Language, Information and Computation (Wollic'99).Ruy J. G. B. de Queiroz & Walter Carnielli - 1999 - Bulletin of Symbolic Logic 5 (3):424-425.
  25.  14
    3rd Workshop on Logic, Language, Information and Computation (Wollic'96).Ruy J. G. B. de Queiroz - 1996 - Bulletin of Symbolic Logic 2 (3):374-374.
  26.  4
    ∞-Groupoid Generated by an Arbitrary Topological Λ-Model.Daniel O. Martínez-Rivillas & Ruy J. G. B. de Queiroz - 2022 - Logic Journal of the IGPL 30 (3):465-488.
    The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the application of a term/function to any other term/function, including itself. The calculus can be seen as a formal theory with certain pre-established axioms and inference rules, which can be interpreted by models. Dana Scott proposed the first non-trivial model of the extensional lambda calculus, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  27.  6
    8th Workshop on Logic, Language, Information and Computation.Ruy J. G. B. de Queiroz - 2002 - Bulletin of Symbolic Logic 8 (2):319-320.