Switch to: Citations

References in:

Reasoning about knowledge in linear logic: modalities and complexity

In S. Rahman J. Symons (ed.), Logic, Epistemology, and the Unity of Science. Kluwer Academic Publisher. pp. 327--350 (2004)

Add references

You must login to add references.
  1. Logic and the complexity of reasoning.Hector J. Levesque - 1988 - Journal of Philosophical Logic 17 (4):355 - 389.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • The Complexity of Propositional Proofs.Nathan Segerlind - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Feasibility In Logic.Jacques Dubucs - 2002 - Synthese 132 (3):213-237.
    The paper is a defense of a strict form of anti-realism, competing the "in principle" form defended by Michael Dummett. It proposes to ground anti-realism on the basis of two principles ("immanence" and "implicitness") and to develop the consequences of these principles in the light of sub-structural logics.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The formulæ-as-types notion of construction.W. A. Howard - 1995 - In Philippe De Groote (ed.), The Curry-Howard isomorphism. Louvain-la-Neuve: Academia.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • Knowledge and Belief: An Introduction to the Logic of the Two Notions.Jaakko Hintikka - 1962 - Studia Logica 16:119-122.
    Download  
     
    Export citation  
     
    Bookmark   675 citations  
  • Knowledge and belief.Jaakko Hintikka - 1962 - Ithaca, N.Y.,: Cornell University Press.
    Download  
     
    Export citation  
     
    Bookmark   720 citations  
  • The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
    Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Radical anti-realism and substructural logics.Jacques Dubucs & Mathieu Marion - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 235--249.
    According to the realist, the meaning of a declarative, non-indexical sentence is the condition under which it is true and the truth-condition of an undecidable sentence can obtain or fail to obtain independently of our capacity, even in principle, to recognize that it obtains or that fails to do so.1 In a series of papers, beginning with “Truth” in 1959, Michael Dummett challenged the position that the classical notion of truth-condition occupied as the central notion of a theory of meaning, (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The formulae-as-types notion of construction.William Alvin Howard - 1980 - In Haskell Curry, Hindley B., Seldin J. Roger & P. Jonathan (eds.), To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism. Academic Press.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • The calculus of constructions.Thierry Coquand & Gerard Huet - 1988 - Information And Computation 76 (2-3):95--120.
    Download  
     
    Export citation  
     
    Bookmark   22 citations