Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
[In this chapter I will explore the logic governing derivations of infinite concatenating regresses. There are at least two reasons why it is important to understand this logic: it will help us to improve our presentation and evaluation of infinite regress arguments that use concatenating regresses; and such regress arguments seem to be the most common. To facilitate this exploration I will make use of the notion of a recurring term, or a loop, and then prove that a regress formula entails a concatenating regress only if it blocks all possible recurring terms, or in other words, only if it blocks all possible loops. A further goal is to show that a strictly formal analysis of a regress formula is inadequate to give a complete account of the derivation of its intended concatenating regress: various semantic and contextual aspects of regress formulas need to be considered.]
Published: Nov 27, 2009
Keywords: Relational Statement; Transitive Relation; Trigger Statement; Infinite Regress; Asymmetric Relation
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.