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 (...) Alfred Tarski, whom many recognize as “the man who defined truth”, linking him to the formulation of the distinction between object and metalanguage. In the paper, I argue with historians of philosophy who claim that this distinction was first set by the logician and philosopher of the Lvov-Warsaw school Stanislaw Leśniewski (whose Tarski was the only doctoral student) accusing Tarski of violating professional laws without attributing the authorship of this distinction to Leśniewski. I show that this is not true and I cite the places where Tarski clearly emphasizes Leśniewski ‘s contribution. (shrink)

Clark and Chalmers propose that the mind extends further than skin and skull. If they are right, then we should expect this to have some effect on our way of knowing our own mental states. If the content of my notebook can be part of my belief system, then looking at the notebook seems to be a way to get to know my own beliefs. However, it is at least not obvious whether self-ascribing a belief by looking at my notebook (...) is a case of introspection the same way that knowing my non-extended beliefs is. Traditionally this sort of introspection is thought to be privileged and special in ways that the extended introspection case seems not to be. There is nothing privileged about looking at my notebook. Anyone could do it. The aim of the paper is to find out how to understand extended introspection and whether there is something privileged and special about knowing one’s own extended beliefs. Moreover, the notebook case has close analogs using twenty-first century technology. It seems possible to know our beliefs that are extended to smartphones, wearable technology or a cloud-based data store. First, I present the case of extended introspection. I then discuss whether it should be understood as ordinary introspection or as mind-reading. Both seem to be bad fits, which finally prompts an original account for extended introspection based on epistemic rules. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. It is based on a special type of relation called CAT4, which is interpreted to provide a semantic representation. This is Part 1 of a five-part introduction. The focus here is on defining the key mathematical structures first, and presenting the semantic-database application in subsequent Parts. We focus in Part 1 (...) on general axioms for the structures, and introduce key concepts. Part 2 analyses the CAT2 sub-relation of CAT4 in more detail. The interpretation of fact networks is introduced in Part 3, where we turn to interpreting semantics. We start with examples of relational and graph databases, with methods to translate them into CAT3 networks, with the aim of retaining the meaning of information. The full application to semantic theory comes in Part 4, where we introduce general functions, including the language interpretation or linguistic functions. The representation of linear symbolic languages, including natural languages and formal symbolic languages, is a function that CAT4 is uniquely suited to. In Part 5, we turn to software design considerations, to show how files, indexes, functions and screens can be defined to implement a CAT4 system efficiently. (shrink)

This work is an analysis of F. P. Ramsey's philosophy of science. Twentieth-century philosophy of science was marked by attempts to consider the relation between scientific theories and our knowledge of the empirical world through considerations of abstract mathematical structure. Such considerations led Bertrand Russell to an account of the relation between our theoretical picture of the world and its real nature as a relation of structural similarity. Subsequently, Max Newman gave what has become a well-known logico-mathematical objection to this (...) account. William Demopoulos recently showed that Newman's problem applied not only to Russell's realist account, but also to a variety of otherwise disparate accounts of theoretical knowledge. The common element underlying these accounts is a conception of theories as abstract formal structures. Many such accounts have incorporated key elements of Ramsey's views, most notably the Ramsey-sentence. Moreover, Demopoulos has interpreted Ramsey's own view of theories as sharing the essential features of those abstract views, and therefore their common problem. My analysis aims to show that this abstract conception of theories does not adequately characterize Ramsey's view. Namely, his account of theories was not an attempt to do the epistemology of science in the fashion of Russell or Eddington, or of subsequent structuralist views that have adopted the Ramsey-sentence. I show this by a broader exposition of Ramsey's work on the nature of theories, comparing his seminal paper with his many other remarks on the nature and purpose of theories. I begin by discussing the historical context of Newman's objection, and a generalization of it that shows its broad applicability to abstract characterizations of theoretical knowledge. I then reconstruct Ramsey's view of theories, to show how far it extends beyond the Ramsey-sentence picture. Finally, I discuss the relevance of this view to contemporary debates concerning realism and instrumentalism. I characterize Ramsey's view as focused not on grounding our theoretical knowledge in abstract structure, but instead on demystifying the role of theoretical language and concepts in a theory's application to the world. (shrink)

There exist two known types of ultrafilter extensions of first-order models, both in a certain sense canonical. One of them comes from modal logic and universal algebra, and in fact goes back to Jónsson and Tarski :891–939, 1951; 74:127–162, 1952). Another one The infinity project proceeding, Barcelona, 2012) comes from model theory and algebra of ultrafilters, with ultrafilter extensions of semigroups as its main precursor. By a classical fact of general topology, the space of ultrafilters over a discrete space is (...) its largest compactification. The main result of Saveliev The infinity project proceeding, Barcelona, 2012), which confirms a canonicity of this extension, generalizes this fact to discrete spaces endowed with an arbitrary first-order structure. An analogous result for the former type of ultrafilter extensions was obtained in Saveliev. Results of such kind are referred to as extension theorems. After a brief introduction, we offer a uniform approach to both types of extensions based on the idea to extend the extension procedure itself. We propose a generalization of the standard concept of first-order interpretations in which functional and relational symbols are interpreted rather by ultrafilters over sets of functions and relations than by functions and relations themselves, and define ultrafilter models with an appropriate semantics for them. We provide two specific operations which turn ultrafilter models into ordinary models, establish necessary and sufficient conditions under which the latter are the two canonical ultrafilter extensions of some ordinary models, and obtain a topological characterization of ultrafilter models. We generalize a restricted version of the extension theorem to ultrafilter models. To formulate the full version, we propose a wider concept of ultrafilter models with their semantics based on limits of ultrafilters, and show that the former concept can be identified, in a certain way, with a particular case of the latter; moreover, the new concept absorbs the ordinary concept of models. We provide two more specific operations which turn ultrafilter models in the narrow sense into ones in the wide sense, and establish necessary and sufficient conditions under which ultrafilter models in the wide sense are the images of ones in the narrow sense under these operations, and also are two canonical ultrafilter extensions of some ordinary models. Finally, we establish three full versions of the extension theorem for ultrafilter models in the wide sense. The results of the first three sections of this paper were partially announced in Poliakov and Saveliev On two concepts of ultrafilter extensions of first-order models and their generalizations, Springer, Berlin, 2017). (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. This is Part 3 of a five-part introduction. The focus here is on explaining the semantic model for CAT4. Points in CAT4 graphs represent facts. We introduce all the formal (data) elements used in the classic semantic model: sense or intension (1st and 2nd joins), reference (3rd join), functions (4th join), (...) time and truth (logical fields), and symbolic content (name/value fields). Concepts are introduced through examples alternating with theoretical discussion. Some concepts are assumed from Part 1 and 2, but key ideas are re-introduced. The purpose is to explain the CAT4 interpretation, and why the data structure and CAT4 axioms have been chosen: to make the semantic model consistent and complete. We start with methods to translate information from database tables into graph DBs and into CAT4. We conclude with a method for translating natural language into CAT4. We conclude with a comparison of the system with an advanced semantic logic, the hyper-intensional logic TIL, which also aims to translate NL into a logical calculus. The CAT4 Natural Language Translator is discussed in further detail in Part 4, when we introduce functions more formally. Part 5 discusses software design considerations. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary quantifiers. (...) We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...) problems. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then combined into a “geometric technique” used to prove several results about countable non-standard models of set theory. In particular, back-and-forth constructions are carried out to establish various generalizations and refinements of Friedman’s theorem on the existence of rank-initial embeddings between countable non-standard models of the fragment (...) \ + \-Separation of \; and Gaifman’s technique of iterated ultrapowers is employed to show that any countable model of \ can be elementarily rank-end-extended to models with well-behaved automorphisms whose sets of fixed points equal the original model. These theoretical developments are then utilized to prove various results relating self-embeddings, automorphisms, their sets of fixed points, strong rank-cuts, and set theories of different strengths. Two examples: The notion of “strong rank-cut” is characterized in terms of the theory \, and in terms of fixed-point sets of self-embeddings. (shrink)

This article consists in two parts that are complementary and autonomous at the same time. -/- In the first one, we develop some surprising consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. On a conceptual level, it allows to see sets in a new light and to give a legitimacy to the empty set. On a technical level, it leads to a relative resolution of (...) the anomaly of the intersection of a family free of sets. -/- In the second part, we show the interest of introducing an operator of potentiality into a standard set theory. Among other results, this operator allows to prove the existence of a hierarchy of empty sets and to propose a solution to the puzzle of "ubiquity" of the empty set. -/- Both theories are presented with equi-consistency results (model and interpretation). -/- Here is a declaration of intent : in each case, the starting point is a conceptual questionning; the technical tools come in a second time\\[0.4cm] \textbf{Keywords:} nothing, void, empty set, null-class, zero-order logic with quantifiers, potential, effective, empty set, ubiquity, hierarchy, equality, equality by the bottom, identity, identification. (shrink)

The classical theory of definitions bans so-called circular definitions, namely, definitions of a unary predicate P, based on stipulations of the form $$Px =_{\mathsf {Df}} \phi,$$where ϕ is a formula of a fixed first-order language and the definiendumP occurs into the definiensϕ. In their seminal book The Revision Theory of Truth, Gupta and Belnap claim that “General theories of definitions are possible within which circular definitions [...] make logical and semantic sense” [p. IX]. In order to sustain their claim, they (...) develop in this book one general theory of definitions based on revision sequences, namely, ordinal-length iterations of the operator which is induced by the definition of the predicate. Gupta-Belnap’s approach to circular definitions has been criticised, among others, by D. Martin and V. McGee. Their criticisms point to the logical complexity of revision sequences, to their relations with ordinary mathematical practice, and to their merits relative to alternative approaches. I will present an alternative general theory of definitions, based on a combination of supervaluation and ω-length revision, which aims to address some criticisms raised against revision sequences, while preserving the philosophical and mathematical core of revision. (shrink)

The aim of this paper is to present a new logic-based understanding of the connection between classical kinematics and relativistic kinematics. We show that the axioms of special relativity can be interpreted in the language of classical kinematics. This means that there is a logical translation function from the language of special relativity to the language of classical kinematics which translates the axioms of special relativity into consequences of classical kinematics. We will also show that if we distinguish a class (...) of observers in special relativity and exclude the non-slower-than light observers from classical kinematics by an extra axiom, then the two theories become definitionally equivalent. Furthermore, we show that classical kinematics is definitionally equivalent to classical kinematics with only slower-than-light inertial observers, and hence by transitivity of definitional equivalence that special relativity theory extended with “Ether” is definitionally equivalent to classical kinematics. So within an axiomatic framework of mathematical logic, wee xplicitly show that the transition from classical kinematics to relativistic kinematics is the knowledge acquisition that there is no “Ether”, accompanied by a redefinition of the concepts of time and space. (shrink)

Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these extensions are often justified (...) only by example rather than by rigorous proof. In this paper, we provide proofs of many of these claims and present a more complete picture of the expressive landscape for such languages. (shrink)

Hybrid languages are introduced in order to evaluate the strength of “minimal” mereologies with relatively strong frame definability properties. Appealing to a robust form of nominalism, I claim that one investigated language \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {m}}$\end{document} is maximally acceptable for nominalistic mereology. In an extension \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {gem}}$\end{document} of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {m}}$\end{document}, a modal analog (...) for the classical systems of Leonard and Goodman and Leśniewski is introduced and shown to be complete with respect to 0-deleted Boolean algebras. We characterize the formulas of first-order logic invariant for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {gem}}$\end{document}-bisimulations. (shrink)

I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes that only the (...) cardinalities of these sets matters, and that not all pairs of infinite sets determine the same logic. I use so-called two-cardinal theorems from model theory to investigate the space of logics and consequence relations determined by pairs of infinite sets, and show how to eliminate the assumption that worlds are individuals from Williamson’s argument. (shrink)

This paper is a critical response to Andreas Bartels’ sophisticated defense of a structural account of scientific representation. We show that, contrary to Bartels’ claim, homomorphism fails to account for the phenomenon of misrepresentation. Bartels claims that homomorphism is adequate in two respects. First, it is conceptually adequate, in the sense that it shows how representation differs from misrepresentation and non-representation. Second, if properly weakened, homomorphism is formally adequate to accommodate misrepresentation. We question both claims. First, we show that homomorphism (...) is not the right condition to distinguish representation from misrepresentation and non-representation: a “representational mechanism” actually does all the work, and it is independent of homomorphism – as of any structural condition. Second, we test the claim of formal adequacy against three typical kinds of inaccurate representation in science which, by reference to a discussion of the notorious billiard ball model, we define as abstraction, pretence, and simulation. We first point out that Bartels equivocates between homomorphism and the stronger condition of epimorphism, and that the weakened form of homomorphism that Bartels puts forward is not a morphism at all. After providing a formal setting for abstraction, pretence and simulation, we show that for each morphism there is at least one form of inaccurate representation which is not accommodated. We conclude that Bartels’ theory – while logically laying down the weakest structural requirements – is nonetheless formally inadequate in its own terms. This should shed serious doubts on the plausibility of any structural account of representation more generally. (shrink)

A dialectical contradiction can be appropriately described within the framework of classical formal logic. It is in harmony with the law of noncontradiction. According to our definition, two theories make up a dialectical contradiction if each of them is consistent and their union is inconsistent. It can happen that each of these two theories has an intended model. Plenty of examples are to be found in the history of science.

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there is an (...) inaccessible cardinal” proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define α-Mahlo models and ${\Pi_1^1}$ -indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form ${Loc({\rm ZFC}+\phi)}$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved. (shrink)

I provide an explicit formulation of empirical adequacy, the central concept of constructive empiricism, and point out a number of problems. Based on one of the inspirations for empirical adequacy, I generalize the notion of a theory to avoid implausible presumptions about the relation of theoretical concepts and observations, and generalize empirical adequacy with the help of approximation sets to allow for lack of knowledge, approximations, and successive gain of knowledge and precision. As a test case, I provide an application (...) of these generalizations to a simple interference phenomenon. (shrink)

We present a streamlined axiom system of special relativity in first-order logic. From this axiom system we "derive" an axiom system of general relativity in two natural steps. We will also see how the axioms of special relativity transform into those of general relativity. This way we hope to make general relativity more accessible for the non-specialist.

Judgment aggregation theory, or rather, as we conceive of it here, logical aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of merely preference judgments. It derives from Kornhauser and Sager’s doctrinal paradox and List and Pettit’s discursive dilemma, two problems that we distinguish emphatically here. The current theory has developed from the discursive dilemma, rather than the doctrinal paradox, and the final objective of the paper is to give the latter (...) its own theoretical development along the line of recent work by Dietrich and Mongin. However, the paper also aims at reviewing logical aggregation theory as such, and it covers impossibility theorems by Dietrich, Dietrich and List, Dokow and Holzman, List and Pettit, Mongin, Nehring and Puppe, Pauly and van Hees, providing a uniform logical framework in which they can be compared with each other. The review goes through three historical stages: the initial paradox and dilemma, the scattered early results on the independence axiom, and the so-called canonical theorem, a collective achievement that provided the theory with its specific method of analysis. The paper goes some way towards philosophical logic, first by briefly connecting the aggregative framework of judgment with the modern philosophy of judgment, and second by thoroughly discussing and axiomatizing the ‘general logic’ built in this framework. (shrink)

Many philosophers have become worried about the use of standard real numbers for the probability function that represents an agent's credences. They point out that real numbers can't capture the distinction between certain extremely unlikely events and genuinely impossible ones—they are both represented by credence 0, which violates a principle known as “regularity.” Following Skyrms 1980 and Lewis 1980, they recommend that we should instead use a much richer set of numbers, called the “hyperreals.” This essay argues that this popular (...) view is the result of two mistakes. The first mistake, which this essay calls the “numerical fallacy,” is to assume that a distinction that isn't represented by different numbers isn't represented at all in a mathematical representation. In this case, the essay claims that although the real numbers do not make all relevant distinctions, the full mathematical structure of a probability function does. The second mistake is that the hyperreals make too many distinctions. They have a much more complex structure than credences in ordinary propositions can have, so they make distinctions that don't exist among credences. While they might be useful for generating certain mathematical models, they will not appear in a faithful mathematical representation of credences of ordinary propositions. (shrink)

Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating readings (...) first and testing their acceptability afterwards will not be feasible. -/- This insight has led a series of researchers to adopt a level of representation at which ambiguities remain unresolved. The idea here is not to generate and test many possible interpretations but to first generate one `underspecified' representation which in a sense represents all its complete specifications and then use whatever information is available to further specify the result. -/- One central hypothesis in the paper will be that the relation between an underspecified representation and its full representations is not so much the relation between one structure and a set of other structures but is in fact the relation between a description (a set of logical sentences) and its models. (shrink)

This paper considers the question: what becomes of the notion of a logic as a way of codifying valid arguments when the customary assumption is dropped that the premisses and conclusions of these arguments are statements from some single language? An elegant treatment of the notion of a logic, when this assumption is in force, is that provided by Dana Scott's theory of consequence relations; this treatment is appropriately generalized in the present paper to the case where we do not (...) make this assumption of linguistic homogeneity. Several applications of the resulting concept of a heterogeneous logic are suggested, but the main emphasis is on the formal development. One topic touched on is a certain contrast between the boolean and the intensional sentence-connectives in this more general setting. (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 recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate logic (...) are desirable, and in this paper I present two such results. The main developments in this area can be split into two directions, differing in the question whether the ordering of time is world-independent or not. Semantically, this difference appears in the discussion whether T x W-frames or Kamp-frames (resp. Ockham-frames) provide a suitable semantics for combinations of tense and modality. Here, two calculi are presented, the first adequate with respect to Kamp-semantics, the second to T x Wsemantics. (Both calculi contain an appropriate version of Gabbay's irreflexivity rule.) Furthermore, the proposed constructions of canonical frames simplify some of those which have hitherto been discussed. (shrink)

We establish several first- or second-order properties of models of first-order theories by considering their elements as atoms of a new universe of set theory and by extending naturally any structure of Boolean model on the atoms to the whole universe. For example, complete f-rings are "boundedly algebraically compact" in the language $(+,-,\cdot,\wedge,\vee,\leq)$ , and the positive cone of a complete l-group with infinity adjoined is algebraically compact in the language (+, ∨, ≤). We also give an example with any (...) first-order language. The proofs can be translated into "naive set theory" in a uniform way. (shrink)

Clark and Krauss [1977] presents a classification of complete, satisfiable and o-categorical theories in first order languages with finite non-logical vocabularies. In 1988 the first author modified this classification and raised three questions about the distribution of finitely axiomatizable theories. This paper answers two of those questions.

In this paper we mainly deal with first-order languages without equality and introduce a weak form of equality predicate, the so-called Leibniz equality. This equality is characterized algebraically by means of a natural concept of congruence; in any structure, it turns out to be the maximum congruence of the structure. We show that first-order logic without equality has two distinct complete semantics (fll semantics and reduced semantics) related by the reduction operator. The last and main part of the paper contains (...) a series of Birkhoff-style theorems characterizing certain classes of structures defined without equality, not only full classes but also reduced ones. (shrink)

We formulate a general institution-independent (i.e. independent of the details of the actual logic formalised as institution) version of the Craig Interpolation Theorem and prove it in dependence of Birkhoff-style axiomatizability properties of the actual logic.We formalise Birkhoff-style axiomatizability within the general abstract model theoretic framework of institution theory by the novel concept of Birkhoff institution.

Kim's argument appears to render causally efficacious emergence impossible: Hume's argument appears to render normative emergence impossible, and, in its general form, it precludes any emergence at all. I argue that both of these barriers can be overcome, and, in fact, that they each constitute reductions of their respective underlying presuppositions. In particular, causally efficacious ontological emergence can be modeled, but only within a process metaphysics, thus avoiding Kim's argument, and making use of non-abbreviatory forms of definition, thus avoiding Hume's (...) argument. I illustrate these points with models of the emergent nature of normative function and of representation. (shrink)

To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of computation against (...) a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind. (shrink)

Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the supervised learning game—to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the learning process, and she may also ignore the potential relation between different hypotheses; on the other (...) hand, Teacher is able to correct Learner’s mistakes, eliminate potential mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning and study its properties. Broadly, this work takes a small step towards studying the interaction between graph games, logics and formal learning theory. (shrink)

CAT4 is proposed as a general method for representing information, enabling a powerful programming method for large-scale information systems. It enables generalised machine learning, software automation and novel AI capabilities. It is based on a special type of relation called CAT4, which is interpreted to provide a semantic representation. This is Part 2 of a five-part introduction. The focus here is on defining key mathematical properties of CAT2, identifying the topology and defining essential functions over a coordinate system. The analysis (...) is from first principles. This develops on from the axioms introduced in Part 1. The interpretation of fact networks is introduced in Part 3, and the full application to semantic theory comes in Part 4, where we introduce general functions, including the language interpretation or linguistic functions. In Part 5, we turn to software design considerations, to show how files, indexes, functions and screens can be defined to implement a CAT4 system efficiently. (shrink)

Juliette Kennedy’s new book brims with intriguing ideas. I don’t understand all of them, and I’m not convinced that the ones I do understand all fit together, b.

A model \ of ZF is said to be condensable if \\prec _{\mathbb {L}_{{\mathcal {M}}}} {\mathcal {M}}\) for some “ordinal” \, where \:=,\in )^{{\mathcal {M}}}\) and \ is the set of formulae of the infinitary logic \ that appear in the well-founded part of \. The work of Barwise and Schlipf in the 1970s revealed the fact that every countable recursively saturated model of ZF is cofinally condensable \prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \). Moreover, it (...) can be readily shown that any \-nonstandard condensable model of \ is recursively saturated. These considerations provide the context for the following result that answers a question posed to the author by Paul Kindvall Gorbow.Theorem A. Assuming a modest set-theoretic hypothesis, there is a countable model \ of ZFC that is both definably well-founded is in the well-founded part of \}\) and cofinally condensable. We also provide various equivalents of the notion of condensability, including the result below.Theorem B. The following are equivalent for a countable model \ of \: \ is condensable. \ is cofinally condensable. \ is nonstandard and \\prec _{\mathbb {L}_{{\mathcal {M}}}}{\mathcal {M}}\) for an unbounded collection of \. (shrink)

According to the so-called Lockean thesis, a rational agent believes a proposition just in case its probability is sufficiently high, i.e., greater than some suitably fixed threshold. The Preface paradox is usually taken to show that the Lockean thesis is untenable, if one also assumes that rational agents should believe the conjunction of their own beliefs: high probability and rational belief are in a sense incompatible. In this paper, we show that this is not the case in general. More precisely, (...) we consider two methods of computing how probable must each of a series of propositions be in order to rationally believe their conjunction under the Lockean thesis. The price one has to pay for the proposed solutions to the paradox is what we call “quasi-dogmatism”: the view that a rational agent should believe only those propositions which are “nearly certain” in a suitably defined sense. (shrink)

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have a relational semantics provided by structures based on polarities. Such structures have associated complete lattices of stable subsets, and these have been used to construct canonical extensions of lattice-based algebras. We study classes of structures that are closed under ultraproducts and whose (...) stable set lattices have additional operators that are first-order definable in the underlying structure. We show that such classes generate varieties of algebras that are closed under canonical extensions. The proof makes use of a relationship between canonical extensions and MacNeille completions. (shrink)

The aim of this article is to contribute to a better understanding of Frege’s views on semantics and metatheory by looking at his take on several themes in nineteenth century geometry that were significant for the development of modern model-theoretic semantics. I will focus on three issues in which a central semantic idea, the idea of reinterpreting non-logical terms, gradually came to play a substantial role: the introduction of elements at infinity in projective geometry; the study of transfer principles, especially (...) the principle of duality; and the use of counterexamples in independence arguments. Based on a discussion of these issues and how nineteenth century geometers reflected about them, I will then look into Frege’s take on these matters. I conclude with a discussion of Frege’s views and what they entail for the debate about his stance towards semantics and metatheory more generally. (shrink)

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

Situational aspects of action are discussed. The presented approach emphasizes the role of situational contexts in which actions are performed. These contexts influence the course of an action; they are determined not only by the current state of the system but also shaped by other factors as time, the previously undertaken actions and their succession, the agents of actions and so on. The distinction between states and situations is explored from the perspective of action systems. The notion of a situational (...) action system is introduced and its theory is expounded. Numerous examples illustrate the reach of the theory. (shrink)

It is a commonplace of set theory to say that there is no set of all well-orderings nor a set of all sets. We are implored to accept this due to the threat of paradox and the ensuing descent into unintelligibility. In the absence of promising alternatives, we tend to take up a conservative stance and tow the line: there is no universe. In this paper, I am going to challenge this claim by taking seriously the idea that we can (...) talk about the collection of all the sets and many more collections beyond that. A method of articulating this idea is offered through an indefinitely extending hierarchy of set theories. It is argued that this approach provides a natural extension to ordinary set theory and leaves ordinary mathematical practice untouched. (shrink)

We examine some of Connes’ criticisms of Robinson’s infinitesimals starting in 1995. Connes sought to exploit the Solovay model S as ammunition against non-standard analysis, but the model tends to boomerang, undercutting Connes’ own earlier work in functional analysis. Connes described the hyperreals as both a “virtual theory” and a “chimera”, yet acknowledged that his argument relies on the transfer principle. We analyze Connes’ “dart-throwing” thought experiment, but reach an opposite conclusion. In S , all definable sets of reals are (...) Lebesgue measurable, suggesting that Connes views a theory as being “virtual” if it is not definable in a suitable model of ZFC. If so, Connes’ claim that a theory of the hyperreals is “virtual” is refuted by the existence of a definable model of the hyperreal field due to Kanovei and Shelah. Free ultrafilters aren’t definable, yet Connes exploited such ultrafilters both in his own earlier work on the classification of factors in the 1970s and 80s, and in Noncommutative Geometry, raising the question whether the latter may not be vulnerable to Connes’ criticism of virtuality. We analyze the philosophical underpinnings of Connes’ argument based on Gödel’s incompleteness theorem, and detect an apparent circularity in Connes’ logic. We document the reliance on non-constructive foundational material, and specifically on the Dixmier trace −∫ (featured on the front cover of Connes’ magnum opus) and the Hahn–Banach theorem, in Connes’ own framework. We also note an inaccuracy in Machover’s critique of infinitesimal-based pedagogy. (shrink)