Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • PURE LOGIC OF ITERATED FULL GROUND

  • JON ERLING LITLAND
  • Journal:
    The Review of Symbolic Logic / Volume 11 / Issue 3 / September 2018
    Published online by Cambridge University Press:
    13 July 2018, pp. 411-435
    Print publication:
    September 2018

  • This article develops the Pure Logic of Iterated Full Ground (plifg), a logic of ground that can deal with claims of the form “ϕ grounds that (ψ grounds θ)”—what we call iterated grounding claims. The core idea is that some truths Γ ground a truth ϕ when there is an explanatory argument (of a certain sort) from premisses Γ to conclusion ϕ. By developing a deductive system that distinguishes between explanatory and nonexplanatory arguments we can give introduction rules for operators for factive and nonfactive full ground, as well as for a propositional “identity” connective. Elimination rules are then found by using a proof-theoretic inversion principle.