Switch to: References

Add citations

You must login to add citations.
  1. Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach.Ivo Pezlar - 2017 - Logic and Logical Philosophy 26 (4):473-508.
    In this paper we examine two approaches to the formal treatment of the notion of problem in the paradigm of algorithmic semantics. Namely, we will explore an approach based on Martin-Löf’s Constructive Type Theory, which can be seen as a direct continuation of Kolmogorov’s original calculus of problems, and an approach utilizing Tichý’s Transparent Intensional Logic, which can be viewed as a non-constructive attempt of interpreting Kolmogorov’s logic of problems. In the last section we propose Kolmogorov and CTT-inspired modifications to (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Substitution contradiction, its resolution and the Church-Rosser Theorem in TIL.Miloš Kosterec - 2020 - Journal of Philosophical Logic 49 (1):121-133.
    I present an analysis according to which the current state of the definition of substitution leads to a contradiction in the system of Transparent Intensional Logic. I entail the contradiction using only the basic definitions of TIL and standard results. I then analyse the roots of the contradiction and motivate the path I take in resolving the contradiction. I provide a new amended definition of collision-less substitution which blocks the contradiction in a non-ad hoc way. I elaborate on the consequences (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Substitution inconsistencies in Transparent Intensional Logic.Miloš Kosterec - 2021 - Journal of Applied Non-Classical Logics 31 (3-4):355-371.
    This paper presents several important results for Transparent Intensional Logic. The conversions that are standardly taken to be valid – namely restricted β-conversion by name and β-reduction...
    Download  
     
    Export citation  
     
    Bookmark  
  • On the number of types.Miloš Kosterec - 2017 - Synthese 194 (12):5005-5021.
    In this paper, I investigate type theories from several perspectives. First, I present and elaborate the philosophical and technical motivations for these theories. I then offer a formal analysis of various TTs, focusing on the cardinality of the set of types contained in each. I argue that these TTs can be divided into four formal categories, which are derived from the cardinality of the set of their basic elementary types and the finiteness of the lengths of their molecular types. The (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Transparent quantification into hyperpropositional attitudes de dicto.Bjørn Jespersen & Marie Duží - 2022 - Linguistics and Philosophy 45 (5):1119-1164.
    We prove how to validly quantify into hyperpropositional contexts de dicto in Transparent Intensional Logic. Hyperpropositions are sentential meanings and attitude complements individuated more finely than up to logical equivalence. A hyperpropositional context de dicto is a context in which only co-hyperintensional propositions can be validly substituted. A de dicto attitude ascription is one that preserves the attributee’s perspective when one complement is substituted for another. Being an extensional logic of hyperintensions, Transparent Intensional Logic validates all the rules of extensional (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Structured lexical concepts, property modifiers, and Transparent Intensional Logic.Bjørn Jespersen - 2015 - Philosophical Studies 172 (2):321-345.
    In a 2010 paper Daley argues, contra Fodor, that several syntactically simple predicates express structured concepts. Daley develops his theory of structured concepts within Tichý’s Transparent Intensional Logic . I rectify various misconceptions of Daley’s concerning TIL. I then develop within TIL an improved theory of how structured concepts are structured and how syntactically simple predicates are related to structured concepts.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Should Propositions Proliferate?Bjørn Jespersen - 2015 - Thought: A Journal of Philosophy 4 (4):243-251.
    Soames's cognitive propositions are strings of acts to be performed by an agent, such as predicating a property of an individual. King takes these structured propositions to task for proliferating too easily. King's objection is based on an example that purports to show that three of Soames's propositions are really just one proposition. I translate the informally stated propositions King attributes to Soames into the intensional λ-calculus. It turns out that they are all β-equivalent to the proposition King claims Soames's (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • First among equals: co-hyperintensionality for structured propositions.Bjørn Jespersen - 2020 - Synthese 199 (1-2):4483-4497.
    Theories of structured meanings are designed to generate fine-grained meanings, but they are also liable to overgenerate structures, thus drawing structural distinctions without a semantic difference. I recommend the proliferation of very fine-grained structures, so that we are able to draw any semantic distinctions we think we might need. But, in order to contain overgeneration, I argue we should insert some degree of individuation between logical equivalence and structural identity based on structural isomorphism. The idea amounts to forming an equivalence (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • If structured propositions are logical procedures then how are procedures individuated?Marie Duží - 2019 - Synthese 196 (4):1249-1283.
    This paper deals with two issues. First, it identifies structured propositions with logical procedures. Second, it considers various rigorous definitions of the granularity of procedures, hence also of structured propositions, and comes out in favour of one of them. As for the first point, structured propositions are explicated as algorithmically structured procedures. I show that these procedures are structured wholes that are assigned to expressions as their meanings, and their constituents are sub-procedures occurring in executed mode. Moreover, procedures are not (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Transparent quantification into hyperintensional objectual attitudes.Bjørn Jespersen & Marie Duží - 2015 - Synthese 192 (3):635-677.
    We demonstrate how to validly quantify into hyperintensional contexts involving non-propositional attitudes like seeking, solving, calculating, worshipping, and wanting to become. We describe and apply a typed extensional logic of hyperintensions that preserves compositionality of meaning, referential transparency and substitutivity of identicals also in hyperintensional attitude contexts. We specify and prove rules for quantifying into hyperintensional contexts. These rules presuppose a rigorous method for substituting variables into hyperintensional contexts, and the method will be described. We prove the following. First, it (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Transparent quantification into hyperpropositional contexts de re.Duží Marie & Bjørn Jespersen - 2012 - Logique & Analyse 55 (220):513-554.
    This paper is the twin of (Duží and Jespersen, in submission), which provides a logical rule for transparent quantification into hyperprop- ositional contexts de dicto, as in: Mary believes that the Evening Star is a planet; therefore, there is a concept c such that Mary be- lieves that what c conceptualizes is a planet. Here we provide two logical rules for transparent quantification into hyperpropositional contexts de re. (As a by-product, we also offer rules for possible- world propositional contexts.) One (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation