Jump to ContentJump to Main Navigation
New Essays on Tarski and Philosophy$
Users without a subscription are not able to see the full content.

Douglas Patterson

Print publication date: 2008

Print ISBN-13: 9780199296309

Published to Oxford Scholarship Online: September 2010

DOI: 10.1093/acprof:oso/9780199296309.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 12 December 2019

Tarski's Thesis

Tarski's Thesis

Chapter:
(p.300) 12 Tarski's Thesis
Source:
New Essays on Tarski and Philosophy
Author(s):

Gila Sher

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199296309.003.0012

This chapter investigates the thesis that Invariance Under Isomorphisms is a criterion of logicality (logical operators) and the roots of this criterion in Tarski. It discusses the philosophical significance of this criterion, offers a philosophical justification for it, examines its ramifications for the relation between logic and mathematics, responds to Feferman's criticisms of this criterion, and critically examines Feferman's alternative criterion. The chapter also investigates methodological issues involved in a providing criterion of logicality (e.g. foundationalism vs. holism), logic's role in our system of knowledge, the relation between logicality and truth, and the idea of logicality as formality.

Keywords:   Tarski, Feferman, invariance under isomorphisms, criterion of logicality, formality, knowledge, foundationalism, holism

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .