Second-order logic has a number of attractive features, in particular the strong expressive resources it offers, and the possibility of articulating categorical mathematical theories (such as arithmetic and analysis). But it also has its costs. Five major charges have been launched against second-order logic: (1) It is not axiomatizable; as opposed to first-order logic, it is inherently incomplete. (2) It also has several semantics, and there is no criterion to choose between them (Putnam, J Symbol Logic 45:464–482, 1980 ). Therefore, (...) it is not clear how this logic should be interpreted. (3) Second-order logic also has strong ontological commitments: (a) it is ontologically committed to classes (Resnik, J Phil 85:75–87, 1988 ), and (b) according to Quine (Philosophy of logic, Prentice-Hall: Englewood Cliffs, 1970 ), it is nothing more than “set theory in sheep’s clothing”. (4) It is also not better than its first-order counterpart, in the following sense: if first-order logic does not characterize adequately mathematical systems, given the existence of non - isomorphic first-order interpretations, second-order logic does not characterize them either, given the existence of different interpretations of second-order theories (Melia, Analysis 55:127–134, 1995 ). (5) Finally, as opposed to what is claimed by defenders of second-order logic [such as Shapiro (J Symbol Logic 50:714–742, 1985 )], this logic does not solve the problem of referential access to mathematical objects (Azzouni, Metaphysical myths, mathematical practice: the logic and epistemology of the exact sciences, Cambridge University Press, Cambridge, 1994 ). In this paper, I argue that the second-order theorist can solve each of these difficulties. As a result, second-order logic provides the benefits of a rich framework without the associated costs. (shrink)

Když jsem v roce 1992 začínal na filosofické fakultě UK přednášet teorii sémantiky, cítil jsem intenzivní potřebu poskytnout studentům nějaký učební text. O překotném vývoji tohoto interdisciplinárního oboru, který odstartovalo v sedmdesátých letech úspěšné “zkřížení logiky s lingvistikou” Richardem Montaguem a dalšími a který se nezpomalil dodnes, totiž v češtině neexistovaly prakticky žádné zprávy (s čestnou výjimkou přístupu tzv. transparentní intenzionální logiky, který byl dílem českého emigranta Pavla Tichého a o kterém u nás psal Pavel Materna). Přehledové publikace, jaké jsou (...) potřeba pro někoho, kdo se chce v dané problematice zorientovat, se ovšem v té době i po světě teprve začínaly objevovat: v roce 1990 vyšla kniha An Introduction to Semantics Gennara Chierchii a Sally McConell-Ginnetové a v roce 1991 vydala skupina holandských logiků pod kolektivním pseudonymem L.T.F. Gamut dvousvazkovou knihu Language and Meaning. Za této situace jsem se pokusil co nejrychleji sepsat učební text, který by moji studenti i jiní zájemci o sémantiku mohli použít; a protože o jeho vydání paradoxně projevila větší zájem filosofická fakulta Masarykovy univerzity v Brně (kde jsem já osobně nikdy neučil; ale zájem o sémantiku tam neúnavně podněcoval a vydání mého textu tam zprostředkoval kolega Materna) než filosofická fakulta mojí domovské Karlovy univerzity, vyšel tento text v Brně, a to pod názvem Úvod do teoretické sémantiky. (shrink)

The relation between logic and philosophy of science, often taken for granted, is in fact problematic. Although current fashionable criticisms of the usefulness of logic are usually mistaken, there are indeed difficulties which should be taken seriously — having to do, amongst other things, with different scientific mentalities in the two disciplines (section 1). Nevertheless, logic is, or should be, a vital part of the theory of science. To make this clear, the bulk of this paper is devoted to the (...) key notion of a scientific theory in a logical perspective. First, various formal explications of this notion are reviewed (section 2), then their further logical theory is discussed (section 3). In the absence of grand inspiring programs like those of Klein in mathematics or Hilbert in metamathematics, this preparatory ground-work is the best one can do here. The paper ends on a philosophical note, discussing applicability and merits of the formal approach to the study of science (section 4). (shrink)

In this thesis I argue against unrestricted mereological hybridism, the view that there are absolutely no constraints on wholes having parts from many different logical or ontological categories, an exemplar of which I take to be ‘mixed fusions’. These are composite entities which have parts from at least two different categories – the membered (as in classes) and the non-membered (as in individuals). As a result, mixed fusions can also be understood to represent a variety of cross-category summation such as (...) the abstract with the concrete, the physical with the non-physical, and the possible with the impossible, just to name a few. -/- Proposed by David Lewis (1991) alongside his defence of classical mereology (the major theory of parthood which permits such transcategorial composites through its principle of unrestricted composition) it is my contention that mixed fusions are an under-examined consequence of indiscriminate mereological fusion which harbour a multitude of complications. In my attempt to discern their substantive character, throughout this thesis I make a case study of mixed fusions and uncover several problematic consequences which I think follow from their most plausible assessment. -/- These include: (1) that mixed fusions’ probable membership relations may lead to dubious foundational loops in the mereological Universe, or (2) otherwise that mixed fusions oblige an implausible ontological priority of the mereological Universe as a whole; (3) that mixed fusions contradict the reductive account of set theory they are proposed within, by plausibly being seen to have the same members as their class parts, and (4) that mixed fusions therefore confound a mereological thesis of Composition as Identity, which some (including Lewis) use to support classical mereology – a consequence which is potentially self-defeating; (5) that mixed fusions as sums of abstract and concrete entities both subvert Lewis’s (1986) system of modal realism, while (6) also undermining less expansive theories of possible worlds; and finally, (7) that even where some of the foregoing is resisted, it remains implausible that mixed fusions are ontologically innocent, because their supposed distinction from their parts in this case ensures that they need to be counted as additional entities in one’s ontology. -/- To be clear, I do not advance a theory of mereological hybrid nihilism in the sense of denying all cases of transcategorial composition. (I only cover a few select instances of mereological hybridism via mixed fusions after all.) Rather, I deny that mereological hybridism is plausible in full generality, by demonstrating that any cases of it are at least limited by the constraints that I identify. This in turn vindicates a call for a restriction on parthood theories and composition principles which allow certain types of categorially mixed entities – including restricting classical mereology with its principle of unrestricted composition. -/- Although theories of parthood like the standard classical mereology are not ordinarily developed for the sake of mereological hybrids like mixed fusions, these and other transcategorial composites are still among the logical consequences of such parthood systems operating with sufficient generality. The significance of my thesis, then, comes from showcasing how some of these kinds of entities do not conform to the systems in which they are included as required, and hence I argue for the rejection of unrestricted mereological hybridism as well as any mereological principles which support it. (shrink)

Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (including the Compactness theorem, Saturation and Ehrenfeucht games). Moreover, we consider what happens to this (...) general theory when one restricts attention to special classes of transition systems (in particular, finite ones), as well as extended logical languages (in particular, infinitary first-order logic). We hope that this puts standard logical formalisms on the map as a serious option for a theory of computational processes. As a side benefit, our approach increases comparability with several other existing formalisms over labeled transition systems (such as Process Algebra or Modal Logic). We provide some pointers to this effect, too. (shrink)

A ground-motive for this study of some historical and metaphysical implications of the diagonal lemmas of Cantor and Gödel is Cantor's insightful remark to Dedekind in 1899 that the Inbegriff alles Denkbaren (aggregate of everything thinkable) might, like some class-theoretic entities, be inkonsistent. In the essay's opening sections, I trace some recent antecedents of Cantor's observation in logical writings of Bolzano and Dedekind (more remote counterparts of his language appear in the First Critique), then attempt to relativize the notion of (...) Inkonsistenz to self-sufficient theories T which interpret themselves. In effect, I argue that Gödel's diagonal lemma suggests a sense in which metatheoretic notions of proof, well-foundeness and satisfaction are object-theoretically inkonsistent. With respect to Cantor's Inbegriff, for example, the lemma yields that any object-theoretic reconstruction of thinkability generates an antidiagonal sentence , which one can paraphrase asSelf-referential application of the assertion that. (shrink)

Introduction to mathematical logic. Part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.

Kniha, jako je tato, nemůže být tak docela dílem jediného člověka. Dovést ji do podoby koherentního celku bych nedokázal bez pomoci svých kolegů, kteří po mně text četli a upozornili mě na spoustu chyb a nedůsledností, které se v něm vyskytovaly. Můj dík v tomto směru patří zejména Vojtěchu Kolmanovi, Liboru Běhounkovi a Martě Bílkové. Za připomínky k různým částem rukopisu jsem vděčen i Pavlu Maternovi, Milanu Matouškovi, Prokopu Sousedíkovi, Vladimíru Svobodovi, Petru Hájkovi a Grahamu Priestovi. Kniha vznikla v rámci (...) projektu podpořeného grantem AV ČR číslo A0009001/00. (shrink)

Labeled transition systems are key structures for modeling computation. In this paper, we show how they lend themselves to ordinary logical analysis (without any special new formalisms), by introducing their standard first-order theory. This perspective enables us to raise several basic model-theoretic questions of definability, axiomatization and preservation for various notions of process equivalence found in the computational literature, and answer them using well-known logical techniques (including the Compactness theorem, Saturation and Ehrenfeucht games). Moreover, we consider what happens to this (...) general theory when one restricts attention to special classes of transition systems (in particular, finite ones), as well as extended logical languages (in particular, infinitary first-order logic). We hope that this puts standard logical formalisms on the map as a serious option for a theory of computational processes. As a side benefit, our approach increases comparability with several other existing formalisms over labeled transition systems (such as Process Algebra or Modal Logic). We provide some pointers to this effect, too. (shrink)

Modern belief revision theory is based to a large extent on partial meet contraction that was introduced in the seminal article by Carlos Alchourrón, Peter Gärdenfors, and David Makinson that appeared in 1985. In the same year, Alchourrón and Makinson published a significantly different approach to the same problem, called safe contraction. Since then, safe contraction has received much less attention than partial meet contraction. The present paper summarizes the current state of knowledge on safe contraction, provides some new results (...) and offers a list of unsolved problems that are in need of investigation. (shrink)

We address in this paper the problem of counting the models of a propositional theory under incremental changes to its literals. Specifcally, we show that if a propositional theory Δ is in a special form that we call smooth, deterministic, decomposable negation normal form, then for any consistent set of literals S, we can simultaneously count the models of Δ ∪ S and the models of every theory Δ ∪ T where T results from adding, removing or flipping a literal (...) in S. We present two results relating to the time and space complexity of compiling propositional theories into sd-DNNF. First, we show that if a conjunctive normal form has a bounded treewidth, then it can be compiled into an sd-DNNF in time and space which are linear in its size. Second, we show that sd-DNNF is a strictly more space efficient representation than Free Binary Decision Diagrams. Finally, we discuss some applications of the counting results to truth maintenance systems, belief revision, and model-based diagnosis. (shrink)

This paper develops a (nontrivial) theory of cardinal numbers from a naive set comprehension principle, in a suitable paraconsistent logic. To underwrite cardinal arithmetic, the axiom of choice is proved. A new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.

Though regarded today as one of the most important results in logic, the compactness theorem was largely ignored until nearly two decades after its discovery. This paper describes the vicissitudes of its evolution and transformation during the period 1930-1970, with special attention to the roles of Kurt Gödel, A. I. Maltsev, Leon Henkin, Abraham Robinson, and Alfred Tarski.

Two of Hilary Putnam's model-theoretic arguments against metaphysical realism are examined in detail. One of them is developed as an extension of a model-theoretic argument against mathematical realism based on considerations concerning the so-called Skolem-Paradox in set theory. This argument against mathematical realism is also treated explicitly. The article concentrates on the fine structure of the arguments because most commentators have concentrated on the major premisses of Putnam's argument and especially on his treatment of metaphysical realism. It is shown that (...) the validity of Putnam's arguments is doubtful and that realists are by no means forced to accept the theses Putnam ascribes to them. It is concluded that Putnam fails to give convincing arguments for rejecting mathematical or metaphysical realism. Furthermore, Putnam's internal realism is discussed critically. (shrink)

Questions of definedness are ubiquitous in mathematics. Informally, these involve reasoning about expressions which may or may not have a value. This paper surveys work on logics in which such reasoning can be carried out directly, especially in computational contexts. It begins with a general logic of partial terms, continues with partial combinatory and lambda calculi, and concludes with an expressively rich theory of partial functions and polymorphic types, where termination of functional programs can be established in a natural way.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources (...) of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method”, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the role of logic in philosophy. (shrink)

We give an overview of recent results in ordinal analysis. Therefore, we discuss the different frameworks used in mathematical proof-theory, namely "subsystem of analysis" including "reverse mathematics", "Kripke-Platek set theory", "explicit mathematics", "theories of inductive definitions", "constructive set theory", and "Martin-Löf's type theory".

This article presents a reconstruction of the so-called classical, formal or Mendelian genetics, which is intended to be more complete and adequate than existing reconstructions. This reconstruction has been carried out with the instruments, duly modified and extended with respect to the case under consideration, of the structuralist conception of theories. The so-called Mendel’s Laws, as well as linkage genetics and gene mapping are formulated in a precise manner while the global structure of genetics is represented as a theory-net. These (...) results are of methodological, philosophical and didactical relevance. (shrink)

My goal is to emphasize the way we generally use the word ‘logic’ and the sort of problems related to the definition of logic and the sort of problems related to the definition of logic. I also wish to underline the differences between human intelligence and artificial intelligence.

Deflationists have argued that truth is an ontologically thin property which has only an expressive function to perform, that is, it makes possible to express semantic generalizations like 'All the theorems are true', 'Everything Peter said is true', etc. Some of the deflationists have also argued that although truth is ontologically thin, it suffices in conjunctions with other facts not involving truth to explain all the facts about truth. The purpose of this paper is to show that in the case (...) of arithmetic, it is difficult to combine the expressive with the explanatory function of truth if the latter is understood in a deflationist way. We will make our point by investigating several logical systems: first-order logic, full second-order logic, and existential second-order (?11-) logic. (shrink)

Using nonstandard methods, we generalize the notion of an algebraic primitive element to that of an hyperalgebraic primitive element, and show that under mild restrictions, such elements can be found infinitesimally close to any given element of a topological field.