This paper concerns Tarski’s use of the term “model” in his 1936 paper “On the Concept of Logical Consequence.” Against several of Tarski’s recent defenders, I argue that Tarski employed a non-standard conception of models in that paper. Against Tarski’s detractors, I argue that this non-standard conception is more philosophically plausible than it may appear. Finally, I make a few comments concerning the traditionally puzzling case of Tarski’s ω-rule example.

The concept of indiscernibility in a structure is analysed with the aim of emphasizing that in asserting that two objects are indiscernible, it is useful to consider these objects as members of (the domain of) a structure. A case for this usefulness is presented by examining the consequences of this view to the philosophical discussion on identity and indiscernibility in quantum theory.

Computational complexity theory is a branch of computer science dedicated to classifying computational problems in terms of their difficulty. While computability theory tells us what we can compute in principle, complexity theory informs us regarding our practical limits. In this chapter I argue that the science of \emph{quantum computing} illuminates complexity theory by emphasising that its fundamental concepts are not model-independent, but that this does not, as some suggest, force us to radically revise the foundations of the theory. For model-independence (...) never has been essential to those foundations. The fundamental aim of complexity theory is to describe what is achievable in practice under various models of computation for our various practical purposes. Reflecting on quantum computing illuminates complexity theory by reminding us of this, too often under-emphasised, fact. (shrink)

I consider the well-known criticism of Quine's characterization of first-order logical truth that it expands the class of logical truths beyond what is sanctioned by the model-theoretic account. Briefly, I argue that at best the criticism is shallow and can be answered with slight alterations in Quine's account. At worse the criticism is defective because, in part, it is based on a misrepresentation of Quine. This serves not only to clarify Quine's position, but also to crystallize what is and what (...) is not at issue in choosing the model-theoretic account of first-order logical truth over one in terms of substitutions. I conclude by highlighting the need for justifying the belief that the definition of first-order logical truth in terms of models is superior to its definition in terms of substitutions. (shrink)

In this first paper of a series of works on the foundations of science, we examine the significance of logical and mathematical frameworks used in foundational studies. In particular, we emphasize the distinction between the order of a language and the order of a structure to prevent confusing models of scientific theories with first-order structures, and which are studied in standard model theory. All of us are, of course, bound to make abuses of language even in putatively precise contexts. This (...) is not a problem—in fact, it is part of scientific and philosophical practice. But it is important to be sensitive to the dierent uses that structure, model, and language have. In this paper, we examine these topics in the context of classical logic; only in the last section we touch upon briefly on non-classical ones. (shrink)

This paper explores the main philosophical approaches of David Hilbert’s theory of proof. Specifically, it is focuses on his ideas regarding logic, the concept of proof, the axiomatic, the concept of truth, metamathematics, the a priori knowledge and the general nature of scientific knowledge. The aim is to show and characterize his epistemological approach on the foundation of knowledge, where logic appears as a guarantee of that foundation. Hilbert supposes that the propositional apriorism, proposed by him to support mathematics, sustains (...) — on its turn — a general method for the treatment of the problem in other areas such as natural sciences. This method is axiomatic. Broadly speaking, we intend to recover and update the Hilbert’s philosophical thinking about the role of logic for scientific knowledge. (shrink)

The original decision criterion and method of the combined calculus, presented by D. Hilbert and W. Ackermann, and applied by later logicians, are illuminating, but also go seriously awry and lead the universality and preciseness of the combined calculus to be damaged. The main error is that they confuse the two levels of the combined calculus in the course of calculating. This paper aims to resolve the problem through dividing the levels of the combined calculus, introducing a mixed operation mode, (...) and therefore finding a normal-form decision method approximated by that in sentential logic. Finally, this paper provides a more precise proof of Hauber’s theorem by using the normal-form decision method of the combined calculus. (shrink)

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 (...) to the compound formulas of PA over N---I_PA(N; SV ) and I_PA(N; SC). We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both I_PA(N; SV ) and I_PA(N; SC). We then show: (a) that if we assume the satisfaction and truth of the compound formulas of PA are always non-finitarily decidable under I_PA(N; SV ), then this assignment corresponds to the classical non-finitary putative standard interpretation I_PA(N; S) of PA over the domain N; and (b) that the satisfaction and truth of the compound formulas of PA are always finitarily decidable under the assignment I_PA(N; SC), from which we may finitarily conclude that PA is consistent. We further conclude that the appropriate inference to be drawn from Goedel's 1931 paper on undecidable arithmetical propositions is that we can define PA formulas which---under interpretation---are algorithmically verifiable as always true over N, but not algorithmically computable as always true over N. We conclude from this that Lucas' Goedelian argument is validated if the assignment I_PA(N; SV ) can be treated as circumscribing the ambit of human reasoning about `true' arithmetical propositions, and the assignment I_PA(N; SC) as circumscribing the ambit of mechanistic reasoning about `true' arithmetical propositions. (shrink)

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 (...) be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then 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. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)