We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used to establish whether an (...) algebra is ω-categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another two-player game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this approach are looked at, and include the step by step method. (shrink)

Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers ω as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on ω. For example, (...) in every sense of relative ubiquity considered here, the set of dense linear orderings on ω is ubiquitous in the set of linear orderings on ω. (shrink)

In the the passage just quoted from the Dialogues concerning Natural Religion, David Hume developed a thought-experiment that contravened his better-known views about "chance" expressed in his Treatise and first Enquiry. For among other consequences of the 'eternal-recurrence' hypothesis Philo proposes in this passage, it may turn out that what the vulgar call cause is nothing but a secret and concealed chance. (In this sentence, I have simply reversed "cause" and "chance" in a well-known passage from Hume's Treatise, p. 130). (...) In the first eight sections of this essay, I develop one topological and model-theoretic analogue of Hume's thought-experiment, in which 'most' ('A-generic') models M of a 'scientific' theory U are both 'eternally recurrent' and topologically random (in a sense which will be made precise), even though they are 'inductively' defined, via a step-by-step ('empirical'?) procedure that Hume might have been inclined to endorse. The last aspect of this model-theoretic thought-experiment also serves to distinguish it from simpler measure-theoretic prototypes that are known to follow from Kolmogorov's Zero-One Law (cf. the Introduction, 5.2, 6.1 and 6.7 below). In the last three sections, I will argue more informally (1) that the metamathematical thought-experiments just mentioned do have a genuine metaphysical relevance, and that this relevance is predominantly skeptical in its implications; (2) that such 'nonstandard' instances of semantic underdetermination and 'pathology' seem to be the metatheoretic rule rather than the exception; and therefore, (3) that metamathematical and metatheoretic 'malign-genius' arguments are quite coherent, contrary (e.g.) to assertions such as that of Putnam (1980), pp. 7-8. In the essay's conclusion, finally, I assimilate (2) and (3) to the familiar datum that 'simplicity', rather than 'pathology', has more often than not turned out to be an anomalous 'special case' in the historical development of scientific and mathematical ontology. (shrink)

We use the spaces T n and E n of complete types and of existential types to investigate various notions which appear in the theory of the algebraic structure of models.

Before Abraham Robinson and Kurt Gödel became familiar with Paul Cohen’s Results, both logicians held a naïve Platonic approach to philosophy. In this paper I demonstrate how Cohen’s results influenced both of them. Robinson declared himself a Formalist, while Gödel basically continued to hold onto the old Platonic approach. Why were the reactions of Gödel and Robinson to Cohen’s results so drastically different in spite of the fact that their initial philosophical positions were remarkably similar? I claim that the key (...) to these different responses stems from the meanings that Gödel and Robinson gave to the concept of intuition, as well as to the relationship between epistemology and ontology. I also illustrate that although it might initially appear that Gödel’s and Robinson’s positions after Cohen’s results were quite different, this was not necessarily the case. (shrink)

In the the passage just quoted from theDialogues concerning Natural Religion, David Hume developed a thought-experiment that contravened his better-known views about chance expressed in hisTreatise and firstEnquiry.For among other consequences of the eternal-recurrence hypothesis Philo proposes in this passage, it may turn out that what the vulgar call cause is nothing but a secret and concealed chance.

Given a theoryTextending that of dense linear orders without endpoints, in a language ℒ ⊇ {<}, we are interested in extensionsT′ ofTin languages extending ℒ by unary relation symbols that are each interpreted in models ofT′ as sets that are both dense and codense in the underlying sets of the models.There is a canonically “wild” example, namelyT= Th andT′ = Th. Recall thatTis o-minimal, and so every open set definable in any model ofThas only finitely many definably connected components. But (...) it is well known that 〈ℝ, <, +, · ℚ 〉 defines every real Borel set, in particular, every open subset of any finite cartesian power of ℝ and every subset of any finite cartesian power of ℚ. To put this another way, the definable open sets in models ofTare essentially as simple as possible, whileT′ has a model where the definable open sets are as complicated as possible, as is the structure induced on the new predicate.In contrast to the preceding example, if ℝalgis the set of real algebraic numbers andT′ Th, then no model ofT′ defines any open set that is not definable in the underlying model ofT. (shrink)

For every natural numberm, the existentially closed models of the theory of fields withmcommuting derivations can be given a first-order geometric characterization in several ways. In particular, the theory of these differential fields has a model-companion. The axioms are that certain differential varieties determined by certain ordinary varieties are nonempty. There is no restriction on the characteristic of the underlying field.

In this paper we study the notion of forcing for Łukasiewicz predicate logic (Ł∀, for short), along the lines of Robinson’s forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for Ł∀, while for the latter, we study the generic and existentially complete standard models of Ł∀.

In this paper we study the notion of forcing for Łukasiewicz predicate logic (Ł∀, for short), along the lines of Robinson’s forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for Ł∀, while for the latter, we study the generic and existentially complete standard models of Ł∀.

Iterated admissibility embodies a minimal criterion of rationality in interactions. The epistemic characterization of this solution has been actively investigated in recent times: it has been shown that strategies surviving \ rounds of iterated admissibility may be identified as those that are obtained under a condition called rationality and m assumption of rationality in complete lexicographic type structures. On the other hand, it has been shown that its limit condition, with an infinity assumption of rationality ), might not be satisfied (...) by any state in the epistemic structure, if the class of types is complete and the types are continuous. In this paper we analyze the problem in a different framework. We redefine the notion of type as well as the epistemic notion of assumption. These new definitions are sufficient for the characterization of iterated admissibility as the class of strategies that indeed satisfy \. One of the key methodological innovations in our approach involves defining a new notion of generic types and employing these in conjunction with Cohen’s technique of forcing. (shrink)