Switch to: References

Add citations

You must login to add citations.
  1. Is Classical Mathematics Appropriate for Theory of Computation?Farzad Didehvar - manuscript
    Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Characterizing generics are material inference tickets: a proof-theoretic analysis.Preston Stovall - 2019 - Inquiry: An Interdisciplinary Journal of Philosophy (5):668-704.
    An adequate semantics for generic sentences must stake out positions across a range of contested territory in philosophy and linguistics. For this reason the study of generic sentences is a venue for investigating different frameworks for understanding human rationality as manifested in linguistic phenomena such as quantification, classification of individuals under kinds, defeasible reasoning, and intensionality. Despite the wide variety of semantic theories developed for generic sentences, to date these theories have been almost universally model-theoretic and representational. This essay outlines (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Constructive semantics, admissibility of rules and the validity of Peirce's law.W. De Campos Sanz, T. Piecha & P. Schroeder-Heister - 2014 - Logic Journal of the IGPL 22 (2):297-308.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Definitional Reflection and Basic Logic.Peter Schroeder-Heister - 2013 - Annals of Pure and Applied Logic 164 (4):491-501.
    In their Basic Logic, Sambin, Battilotti and Faggian give a foundation of logical inference rules by reference to certain reflection principles. We investigate the relationship between these principles and the principle of Definitional Reflection proposed by Hallnäs and Schroeder-Heister.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Failure of Completeness in Proof-Theoretic Semantics.Thomas Piecha, Wagner de Campos Sanz & Peter Schroeder-Heister - 2015 - Journal of Philosophical Logic 44 (3):321-335.
    Several proof-theoretic notions of validity have been proposed in the literature, for which completeness of intuitionistic logic has been conjectured. We define validity for intuitionistic propositional logic in a way which is common to many of these notions, emphasizing that an appropriate notion of validity must be closed under substitution. In this definition we consider atomic systems whose rules are not only production rules, but may include rules that allow one to discharge assumptions. Our central result shows that Harrop’s rule (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Steps Towards a Proof-Theoretical Semantics.Enrico Moriconi - 2012 - Topoi 31 (1):67-75.
    The aim of this paper is to reconsider several proposals that have been put forward in order to develop a Proof-Theoretical Semantics, from the by now classical neo-verificationist approach provided by D. Prawitz and M. Dummett in the Seventies, to an alternative, more recent approach mainly due to the work of P. Schroeder-Heister and L. Hallnäs, based on clausal definitions. Some other intermediate proposals are very briefly sketched. Particular attention will be given to the role played by the so-called Fundamental (...)
    Download  
     
    Export citation  
     
    Bookmark