Order:
Disambiguations
Jon Erling Litland [4]Jon Litland [2]
See also
Jon Litland
University of Texas at Austin
  1. Grounding Grounding.Jon Litland - 2017 - Oxford Studies in Metaphysics 10.
    The Problem of Iterated Ground is to explain what grounds truths about ground: if Γ grounds φ, what grounds that Γ grounds φ? This paper develops a novel solution to this problem. The basic idea is to connect ground to explanatory arguments. By developing a rigorous account of explanatory arguments we can equip operators for factive and non-factive ground with natural introduction and elimination rules. A satisfactory account of iterated ground falls directly out of the resulting logic: non- factive grounding (...)
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  2. Grounding and Defining Identity.Jon Erling Litland - forthcoming - Noûs.
    I systematically defend a novel account of the grounds for identity and distinct- ness facts: they are all uniquely zero-grounded. First, the Null Account is shown to avoid a range of problems facing other accounts: a relation satisfying the Null Account would be an excellent candidate for being the identity relation. Second, a plenitudinist view of relations suggests that there is such a relation. To flesh out this plenitudinist view I sketch a novel framework for expressing real definitions, use this (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3.  59
    A Note on the Wilhelmine Inconsistency.Jon Erling Litland - 2022 - Analysis 81 (4):639-647.
    Wilhelm has recently shown that widely accepted principles about immediate ground are inconsistent with some principles of propositional identity. This note responds to this inconsistency by developing two ground-theoretic accounts of propositional individuation. On one account some of the grounding principles are incorrect; on the other account, the principles of propositional individuation are incorrect.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  94
    Collective Abstraction.Jon Litland - forthcoming - Philosophical Review.
    This paper develops a novel theory of abstraction—what we call collective abstraction. The theory solves a notorious problem for non-eliminative structuralism. The non-eliminative structuralist holds that in addition to various isomorphic systems there is a pure structure that can be abstracted from each of these systems; but existing accounts of abstraction fail for non- rigid systems like the complex numbers. The problem with the existing accounts is that they attempt to define a unique abstraction operation. The theory of collective abstraction (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Vagueness & Modality—An Ecumenical Approach.Jon Erling Litland & Juhani Yli-Vakkuri - 2016 - Philosophical Perspectives 30 (1):229-269.
    How does vagueness interact with metaphysical modality and with restrictions of it, such as nomological modality? In particular, how do definiteness, necessity (understood as restricted in some way or not), and actuality interact? This paper proposes a model-theoretic framework for investigating the logic and semantics of that interaction. The framework is put forward in an ecumenical spirit: it is intended to be applicable to all theories of vagueness that express vagueness using a definiteness (or: determinacy) operator. We will show how (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Topics in Philosophical Logic.Jon Erling Litland - 2012 - Dissertation, Harvard
    In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated by an assertability (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations