## Results for 'truth, Gödel, Tarski, syntax, logic, incompleteness'

999 found
Order:
1. A teaching document I've used in my courses on truth and on incompleteness. Aimed at students who have a good grasp of basic logic, and decent math skills, it attempts to give them the background they need to understand a proper statement of the classic results due to Gödel and Tarski, and sketches their proofs. Topics covered include the notions of language and theory, the basics of formal syntax and arithmetization, formal arithmetic (Q and PA), representability, diagonalization, and the (...)

Export citation

Bookmark
2. Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...)

Export citation

Bookmark   3 citations
3. Truth, correspondence, models, and Tarski.Panu Raatikainen - 2007 - In Approaching Truth: Essays in Honour of Ilkka Niiniluoto. London: College Press. pp. 99-112.
In the early 20th century, scepticism was common among philosophers about the very meaningfulness of the notion of truth – and of the related notions of denotation, definition etc. (i.e., what Tarski called semantical concepts). Awareness was growing of the various logical paradoxes and anomalies arising from these concepts. In addition, more philosophical reasons were being given for this aversion.1 The atmosphere changed dramatically with Alfred Tarski’s path-breaking contribution. What Tarski did was to show that, assuming that the syntax of (...)

Export citation

Bookmark   5 citations
4. The development of mathematical logic from Russell to Tarski, 1900-1935.Paolo Mancosu, Richard Zach & Calixto Badesa - 2009 - In Leila Haaparanta (ed.), The Development of Modern Logic. Oxford University Press.
The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...)

Export citation

Bookmark   25 citations
5. Tarski’s Convention T: condition beta.John Corcoran - forthcoming - South American Journal of Logic 1 (1).
Tarski’s Convention T—presenting his notion of adequate definition of truth (sic)—contains two conditions: alpha and beta. Alpha requires that all instances of a certain T Schema be provable. Beta requires in effect the provability of ‘every truth is a sentence’. Beta formally recognizes the fact, repeatedly emphasized by Tarski, that sentences (devoid of free variable occurrences)—as opposed to pre-sentences (having free occurrences of variables)—exhaust the range of significance of is true. In Tarski’s preferred usage, it is part of the meaning (...)

Export citation

Bookmark
6. Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.

Export citation

Bookmark
7. Truth and Existence.Jan Heylen & Leon Horsten - 2017 - Thought: A Journal of Philosophy 6 (1):106-114.
Halbach has argued that Tarski biconditionals are not ontologically conservative over classical logic, but his argument is undermined by the fact that he cannot include a theory of arithmetic, which functions as a theory of syntax. This article is an improvement on Halbach's argument. By adding the Tarski biconditionals to inclusive negative free logic and the universal closure of minimal arithmetic, which is by itself an ontologically neutral combination, one can prove that at least one thing exists. The result can (...)

Export citation

Bookmark   1 citation
8. Truth, Proof and Gödelian Arguments: A Defence of Tarskian Truth in Mathematics.Markus Pantsar - 2009 - Dissertation, University of Helsinki
One of the most fundamental questions in the philosophy of mathematics concerns the relation between truth and formal proof. The position according to which the two concepts are the same is called deflationism, and the opposing viewpoint substantialism. In an important result of mathematical logic, Kurt Gödel proved in his first incompleteness theorem that all consistent formal systems containing arithmetic include sentences that can neither be proved nor disproved within that system. However, such undecidable Gödel sentences can be established (...)

Export citation

Bookmark   7 citations
9. To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.

Export citation

Bookmark
10. On Universal Roots in Logic.Andrzej K. Rogalski & Urszula Wybraniec-Skardowska - 1998 - Dialogue and Universalism 8 (11):143-154.
The aim of this study is to discuss in what sense one can speak about universal character of logic. The authors argue that the role of logic stands mainly in the generality of its language and its unrestricted applications to any field of knowledge and normal human life. The authors try to precise that universality of logic tends in: (a) general character of inference rules and the possibility of using those rules as a tool of justification of theorems of every (...)

Export citation

Bookmark
11. It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than (...)

Export citation

Bookmark
12. We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled atheistic'. -/- We then adopt what may (...)

Export citation

Bookmark
13. Was Tarski's Theory of Truth Motivated by Physicalism?Greg Frost-Arnold - 2004 - History and Philosophy of Logic 25 (4):265-280.
Many commentators on Alfred Tarski have, following Hartry Field, claimed that Tarski's truth-definition was motivated by physicalism—the doctrine that all facts, including semantic facts, must be reducible to physical facts. I claim, instead, that Tarski did not aim to reduce semantic facts to physical ones. Thus, Field's criticism that Tarski's truth-definition fails to fulfill physicalist ambitions does not reveal Tarski to be inconsistent, since Tarski's goal is not to vindicate physicalism. I argue that Tarski's only published remarks that speak approvingly (...)

Export citation

Bookmark   7 citations
14. Lies, half-truths, and falsehoods about Tarski’s 1933 “liar” antinomies.John Corcoran & Joaquin Miller - 2012 - Bulletin of Symbolic Logic 18 (1):140-141.
We discuss misinformation about “the liar antinomy” with special reference to Tarski’s 1933 truth-definition paper [1]. Lies are speech-acts, not merely sentences or propositions. Roughly, lies are statements of propositions not believed by their speakers. Speakers who state their false beliefs are often not lying. And speakers who state true propositions that they don’t believe are often lying—regardless of whether the non-belief is disbelief. Persons who state propositions on which they have no opinion are lying as much as those who (...)

Export citation

Bookmark
15. The Truth Table Formulation of Propositional Logic.Tristan Grøtvedt Haze - forthcoming - Teorema: International Journal of Philosophy.
Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for groups of (...)

Export citation

Bookmark
16. Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Hans Kleine Büning (ed.), Computer Science Logic. CSL 1995. Selected Papers. Berlin: Springer. pp. 1--15.
It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the authors' temporal (...)

Export citation

Bookmark   1 citation
17. The Semantic Theory of Truth: Field’s Incompleteness Objection.Glen A. Hoffmann - 2007 - Philosophia 35 (2):161-170.
According to Field’s influential incompleteness objection, Tarski’s semantic theory of truth is unsatisfactory since the definition that forms its basis is incomplete in two distinct senses: (1) it is physicalistically inadequate, and for this reason, (2) it is conceptually deficient. In this paper, I defend the semantic theory of truth against the incompleteness objection by conceding (1) but rejecting (2). After arguing that Davidson and McDowell’s reply to the incompleteness objection fails to pass muster, I argue that, (...)

Export citation

Bookmark   1 citation
18. The Metaphysical Interpretation of Logical Truth.Tuomas Tahko - 2014 - In Penelope Rush (ed.), The Metaphysics of Logic: Logical Realism, Logical Anti-Realism and All Things In Between. Cambridge: Cambridge University Press. pp. 233-248.
The starting point of this paper concerns the apparent difference between what we might call absolute truth and truth in a model, following Donald Davidson. The notion of absolute truth is the one familiar from Tarski’s T-schema: ‘Snow is white’ is true if and only if snow is white. Instead of being a property of sentences as absolute truth appears to be, truth in a model, that is relative truth, is evaluated in terms of the relation between sentences and models. (...)

Export citation

Bookmark   7 citations
19. Tarski.Benedict Eastaugh - 2017 - In Alex Malpass & Marianna Antonutti Marfori (eds.), The History of Philosophical and Formal Logic: From Aristotle to Tarski. London: Bloomsbury. pp. 293-313.
Alfred Tarski was one of the greatest logicians of the twentieth century. His influence comes not merely through his own work but from the legion of students who pursued his projects, both in Poland and Berkeley. This chapter focuses on three key areas of Tarski's research, beginning with his groundbreaking studies of the concept of truth. Tarski's work led to the creation of the area of mathematical logic known as model theory and prefigured semantic approaches in the philosophy of language (...)

Export citation

Bookmark   1 citation
20. Foundational Holism, Substantive Theory of Truth, and A New Philosophy of Logic: Interview with Gila Sher BY Chen Bo.Gila Sher & Chen Bo - 2019 - Philosophical Forum 50 (1):3-57.
Gila Sher interviewed by Chen Bo: -/- I. Academic Background and Earlier Research: 1. Sher’s early years. 2. Intellectual influence: Kant, Quine, and Tarski. 3. Origin and main Ideas of The Bounds of Logic. 4. Branching quantifiers and IF logic. 5. Preparation for the next step. -/- II. Foundational Holism and a Post-Quinean Model of Knowledge: 1. General characterization of foundational holism. 2. Circularity, infinite regress, and philosophical arguments. 3. Comparing foundational holism and foundherentism. 4. A post-Quinean model of knowledge. (...)

Export citation

Bookmark
21. Does Gödel's Incompleteness Theorem Prove that Truth Transcends Proof?Joseph Vidal-Rosset - 2006 - In Johan van Benthem, Gerhard Heinzman, M. Rebushi & H. Visser (eds.), The Age of Alternative Logics. Springer. pp. 51--73.

Export citation

Bookmark   1 citation
22. Both Tarski and Gödel “prove” that provability can diverge from Truth. When we boil their claim down to its simplest possible essence it is really claiming that valid inference from true premises might not always derive a true consequence. This is obviously impossible.

Export citation

Bookmark
23. REVIEW OF Alfred Tarski, Collected Papers, vols. 1-4 (1986) edited by Steven Givant and Ralph McKenzie. [REVIEW]John Corcoran - 1991 - MATHEMATICAL REVIEWS 91 (h):01101-4.
Alfred Tarski (1901--1983) is widely regarded as one of the two giants of twentieth-century logic and also as one of the four greatest logicians of all time (Aristotle, Frege and Gödel being the other three). Of the four, Tarski was the most prolific as a logician. The four volumes of his collected papers, which exclude most of his 19 monographs, span over 2500 pages. Aristotle's writings are comparable in volume, but most of the Aristotelian corpus is not about logic, whereas (...)

Export citation

Bookmark   4 citations
24. Incompleteness and Computability: An Open Introduction to Gödel's Theorems.Richard Zach - 2019 - Open Logic Project.
Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

Export citation

Bookmark
25. The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

Export citation

Bookmark
26. String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...)

Export citation

Bookmark   44 citations
27. The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...)

Export citation

Bookmark   2 citations
28. Within the (Haskell Curry) notion of a formal system we complete Tarski's formal correctness: ∀x True(x) ↔ ⊢ x and use this finally formalized notion of Truth to refute his own Undefinability Theorem (based on the Liar Paradox), the Liar Paradox, and the (Panu Raatikainen) essence of the conclusion of the 1931 Incompleteness Theorem.

Export citation

Bookmark
29. The Absence of Multiple Universes of Discourse in the 1936 Tarski Consequence-Definition Paper.John Corcoran & José Miguel Sagüillo - 2011 - History and Philosophy of Logic 32 (4):359-374.
This paper discusses the history of the confusion and controversies over whether the definition of consequence presented in the 11-page 1936 Tarski consequence-definition paper is based on a monistic fixed-universe framework?like Begriffsschrift and Principia Mathematica. Monistic fixed-universe frameworks, common in pre-WWII logic, keep the range of the individual variables fixed as the class of all individuals. The contrary alternative is that the definition is predicated on a pluralistic multiple-universe framework?like the 1931 Gödel incompleteness paper. A pluralistic multiple-universe framework recognizes (...)

Export citation

Bookmark   6 citations
30. The inexpressibility of validity.Julien Murzi - 2014 - Analysis 74 (1):65-81.
Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...)

Export citation

Bookmark   10 citations
31. Prior to Kripke's seminal work on the semantics of modal logic, McKinsey offered an alternative interpretation of the necessity operator, inspired by the Bolzano-Tarski notion of logical truth. According to this interpretation, `it is necessary that A' is true just in case every sentence with the same logical form as A is true. In our paper, we investigate this interpretation of the modal operator, resolving some technical questions, and relating it to the logical interpretation of modality and some views in (...)

Export citation

Bookmark   1 citation
32. CORCORAN REVIEWS THE 4 VOLUMES OF TARSKI's COLLECTED PAPERS.John Corcoran - 1991 - MATHEMATICAL REVIEWS 91 (I):110-114.
CORCORAN REVIEWS THE 4 VOLUMES OF TARSKI’S COLLECTED PAPERS Alfred Tarski (1901--1983) is widely regarded as one of the two giants of twentieth-century logic and also as one of the four greatest logicians of all time (Aristotle, Frege and Gödel being the other three). Of the four, Tarski was the most prolific as a logician. The four volumes of his collected papers, which exclude most of his 19 monographs, span over 2500 pages. Aristotle's writings are comparable in volume, but most (...)

Export citation

Bookmark
33. Logical Foundations of Local Gauge Symmetry and Symmetry Breaking.Yingrui Yang - 2022 - Journal of Human Cognition 6 (1):18-23.
The present paper intends to report two results. It is shown that the formula P(x)=∀y∀z[¬G(x, y)→¬M(z)] provides the logic underlying gauge symmetry, where M denotes the predicate of being massive. For the logic of spontaneous symmetry breaking, by Higgs mechanism, we have P(x)=∀y∀z[G(x, y)→M(z)]. Notice that the above two formulas are not logically equivalent. The results are obtained by integrating four components, namely, gauge symmetry and Higgs mechanism in quantum field theory, and Gödel's incompleteness theorem and Tarski's indefinability theorem (...)

Export citation

Bookmark
34. Taxonomy, truth-value gaps and incommensurability: a reconstruction of Kuhn's taxonomic interpretation of incommensurability.Xinli Wang - 2002 - Studies in History and Philosophy of Science Part A 33 (3):465-485.
Kuhn's alleged taxonomic interpretation of incommensurability is grounded on an ill defined notion of untranslatability and is hence radically incomplete. To supplement it, I reconstruct Kuhn's taxonomic interpretation on the basis of a logical-semantic theory of taxonomy, a semantic theory of truth-value, and a truth-value conditional theory of cross-language communication. According to the reconstruction, two scientific languages are incommensurable when core sentences of one language, which have truth values when considered within its own context, lack truth values when considered within (...)

Export citation

Bookmark   6 citations
35. The generalized conclusion of the Tarski and Gödel proofs: All formal systems of greater expressive power than arithmetic necessarily have undecidable sentences. Is not the immutable truth that Tarski made it out to be it is only based on his starting assumptions. -/- When we reexamine these starting assumptions from the perspective of the philosophy of logic we find that there are alternative ways that formal systems can be defined that make undecidability inexpressible in all of these formal systems.

Export citation

Bookmark
36. Gödel's incompleteness theorems, free will and mathematical thought.Solomon Feferman - 2011 - In Richard Swinburne (ed.), Free Will and Modern Science. Oup/British Academy.
The determinism-free will debate is perhaps as old as philosophy itself and has been engaged in from a great variety of points of view including those of scientific, theological, and logical character. This chapter focuses on two arguments from logic. First, there is an argument in support of determinism that dates back to Aristotle, if not farther. It rests on acceptance of the Law of Excluded Middle, according to which every proposition is either true or false, no matter whether the (...)

Export citation

Bookmark   5 citations
37. Defining Gödel Incompleteness Away.P. Olcott - manuscript
We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory expressions are neither provable (...)

Export citation

Bookmark
38. Truth as Consistent Assertion.Adam Rozycki - 2023 - Preprints.Org.
This paper presents four key results. Firstly, it distinguishes between _partial_ and _consistent_ assertion of a sentence, and introduces the concept of an _equivocal_ sentence, which is both partially asserted and partially denied. Secondly, it proposes a novel definition of truth, stating that _a true sentence is one that is consistently asserted_. This definition is immune from the Liar paradox, does not restrict classical logic, and can be applied to declarative sentences in the language used by any particular person. Thirdly, (...)

Export citation

Bookmark
39. An Observation about Truth.David Kashtan - 2017 - Dissertation, University of Jerusalem
Tarski's analysis of the concept of truth gives rise to a hierarchy of languages. Does this fragment the concept all the way to philosophical unacceptability? I argue it doesn't, drawing on a modification of Kaplan's theory of indexicals.

Export citation

Bookmark   1 citation
40. Two-method errors: having it both ways.John Corcoran & Idris Samawi Hamid - forthcoming - Bulletin of Symbolic Logic.
►JOHN CORCORAN AND IDRIS SAMAWI HAMID, Two-method errors: having it both ways. Philosophy, University at Buffalo, Buffalo, NY 14260-4150, USA E-mail: [email protected] Philosophy, Colorado State University, Fort Collins, CO 80523-1781 USA E-mail: [email protected] Where two methods produce similar results, mixing the two sometimes creates errors we call two-method errors, TMEs: in style, syntax, semantics, pragmatics, implicature, logic, or action. This lecture analyzes examples found in technical and in non-technical contexts. One can say “Abe knows whether Ben draws” in two other (...)

Export citation

Bookmark
41. Talking about trees and truth-conditions.Reinhard Muskens - 2001 - Journal of Logic, Language and Information 10 (4):417-455.
We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...)

Export citation

Bookmark   4 citations
42. How Mathematics Isn’t Logic.Roger Wertheimer - 1999 - Ratio 12 (3):279–295.
If logical truth is necessitated by sheer syntax, mathematics is categorially unlike logic even if all mathematics derives from definitions and logical principles. This contrast gets obscured by the plausibility of the Synonym Substitution Principle implicit in conceptions of analyticity: synonym substitution cannot alter sentence sense. The Principle obviously fails with intercepting: nonuniform term substitution in logical sentences. 'Televisions are televisions' and 'TVs are televisions' neither sound alike nor are used interchangeably. Interception synonymy gets assumed because logical sentences and their (...)

Export citation

Bookmark
43. The man who defined truth and the lvov crisis.Miroslava Trajkovski - 2021 - In Nenad Cekić (ed.), Етика и истина у доба кризе. Belgrade: University of Belgrade - Faculty of Philosophy. pp. 97-110.
In the period after the First World War when the various national-ideological “truths” that led to it were not well resolved which resulted in the Second World War, one of the greatest world crises occurs. In those turbulent times, one philosopher renounces his national identity (changes his religion and name), wanting not to save himself from an evil world that is emerging but to join the creation of a completely new world – the world of modern logic. This man is (...)

Export citation

Bookmark
44. Modeling the concept of truth using the largest intrinsic fixed point of the strong Kleene three valued semantics (in Croatian language).Boris Culina - 2004 - Dissertation, University of Zagreb
The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual semantic connection of sentences, (...)

Export citation

Bookmark
45. The Logical Strength of Compositional Principles.Richard Heck - 2018 - Notre Dame Journal of Formal Logic 59 (1):1-33.
This paper investigates a set of issues connected with the so-called conservativeness argument against deflationism. Although I do not defend that argument, I think the discussion of it has raised some interesting questions about whether what I call “compositional principles,” such as “a conjunction is true iff its conjuncts are true,” have substantial content or are in some sense logically trivial. The paper presents a series of results that purport to show that the compositional principles for a first-order language, taken (...)

Export citation

Bookmark   4 citations
46. The Strength of Truth-Theories.Richard Heck - manuscript
This paper attempts to address the question what logical strength theories of truth have by considering such questions as: If you take a theory T and add a theory of truth to it, how strong is the resulting theory, as compared to T? It turns out that, in a wide range of cases, we can get some nice answers to this question, but only if we work in a framework that is somewhat different from those usually employed in discussions of (...)

Export citation

Bookmark   6 citations
47. Semantyczna teoria prawdy a antynomie semantyczne [Semantic Theory of Truth vs. Semantic Antinomies].Jakub Pruś - 2021 - Rocznik Filozoficzny Ignatianum 1 (27):341–363.
The paper presents Alfred Tarski’s debate with the semantic antinomies: the basic Liar Paradox, and its more sophisticated versions, which are currently discussed in philosophy: Strengthen Liar Paradox, Cyclical Liar Paradox, Contingent Liar Paradox, Correct Liar Paradox, Card Paradox, Yablo’s Paradox and a few others. Since Tarski, himself did not addressed these paradoxes—neither in his famous work published in 1933, nor in later papers in which he developed the Semantic Theory of Truth—therefore, We try to defend his concept of truth (...)

Export citation

Bookmark
48. Boole's criteria for validity and invalidity.John Corcoran & Susan Wood - 1980 - Notre Dame Journal of Formal Logic 21 (4):609-638.
It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...)

Export citation

Bookmark   11 citations
49. What is mathematical logic?John Corcoran & Stewart Shapiro - 1978 - Philosophia 8 (1):79-94.
This review concludes that if the authors know what mathematical logic is they have not shared their knowledge with the readers. This highly praised book is replete with errors and incoherency.