We show that it is relatively consistent with ZFC that there is a non-meager set of reals [Formula: see text] such that for every non-meager [Formula: see text], there exist distinct [Formula: see text] such that [Formula: see text] is computable from the Turing join of [Formula: see text] and [Formula: see text].

The Principle of Dependent Choice is shown to be equivalent to: the Baire Category Theorem for Čech-complete spaces (or for complete metric spaces); the existence theorem for generic sets of forcing conditions; and a proof-theoretic principle that abstracts the "Henkin method" of proving deductive completeness of logical systems. The Rasiowa-Sikorski Lemma is shown to be equivalent to the conjunction of the Ultrafilter Theorem and the Baire Category Theorem for compact Hausdorff spaces.

In this work we give a complete answer as to the possible implications between some natural properties of Lebesgue measure and the Baire property. For this we prove general preservation theorems for forcing notions. Thus we answer a decade-old problem of J. Baumgartner and answer the last three open questions of the Kunen-Miller chart about measure and category. Explicitly, in \S1: (i) We prove that if we add a Laver real, then the old reals have outer measure one. (...) (ii) We prove a preservation theorem for countable-support forcing notions, and using this theorem we prove (iii) If we add ω 2 Laver reals, then the old reals have outer measure one. From this we obtain (iv) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg B(m) + \neg U(m) + U(c))$ . In \S2: (i) We prove a preservation theorem, for the finite support forcing notion, of the property " $F \subseteq ^\omega\omega$ is an unbounded family." (ii) We introduce a new forcing notion making the old reals a meager set but the old members of ω ω remain an unbounded family. Using this we prove (iii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + U(m) + \neg B(c) + \neg U(c) + C(c))$ . In \S3: (i) We prove a preservation theorem, for the finite support forcing notion, of a property which implies "the union of the old measure zero sets is not a measure zero set," and using this theorem we prove (ii) $\operatorname{Cons}(\mathrm{ZF}) \Rightarrow \operatorname{Cons}(\mathrm{ZFC} + \neg U(m) + C(m) + \neg C(c))$. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:166 HUME'S INTEREST IN NEWTON AND SCIENCE Many writers have been forced to examine — in their treatments of Hume's knowledge of and acquaintance with scientific theories of his day — the related questions of Hume's knowledge of and acquaintance with Isaac Newton and of the nature and extent of Newtonian influences upon Hume's thinking. Most have concluded that — in some sense — Hume was acquainted with and (...) influenced by Newton's thought in particular and scientific thought in general. The genesis of this paper is the recent point of view put forward by Peter Jones which challenges the many permutations of this almost ritualistic standard line by removing Hume entirely from the Newtonian and the scientific scenes of thought. Jones argues that Hume knew less about Newton and science, and needed to know less about Newton and 2 science, than he believes is required by the above interpretation. Indeed, Jones argues that Hume's fundamental assumptions, which, according to Jones, derive ultimately from a form of Ciceronian humanism, drive a "wedge" between Newton's thought and that of 3 Hume. Even Hume's introductory remarks in the Treatise about his universal "science of man" are, for Jones, a declaration of independence from the materialistic trend (as Jones sees it) of Newtonian 4 science and not, as so many commentators have maintained — however tenuously or strongly evidence for linkage of Hume's project with Newtonian or scientific thought. Jones baldly argues that Hume totally lacked interest in science in general and in Newton and Newtonian science in particular. Following J. H. Burton's observation that Hume's work is surprisingly free from the "opinions" of contemporary scientists, 167 Jones states there is no evidence that Hume ever studied science at the University of Edinburgh or that he "pursued" scientific studies of any formal sort. Regarding Newtonian scientific thought, he emphasizes the paucity of specifically Newtonian scientific textbooks in the early eighteenth century 7 which might have been available for Hume to study and argues that nowhere in Hume's writings is there evidence of precise and detailed knowledge of Newton's science beyond what is available in Q Chamber's Cyclopaedia. Jones acknowledges that, in the Introduction to the Treatise, Hume utilizes a "general version" of Newton's "Regulae Philosophandi" from the beginning of Book III of Newton's Principia. Nevertheless, in Jones' view, Hume's fundamentally humanistic orientation separates him completely from g any Newtonian influence. Finally, according to Jones, Hume does not betray the least bit of knowledge of Newton's mathematics and its role in Newton's experimental methodology. On this evidence Jones grounds his central claim of Hume's "total lack of interest in contemporary science." What references there are to Newton and to science in Hume's works Jones finds "traceable to essentially literary predecessors such as Fontenelle or Montesquieu, or to standard works of theologians ] 2 or free-thinkers." The absence of clearly direct references to what Jones feels are scientific works results both from Hume's "total lack of interest in science" and from his commitment to a form of Ciceronian humanism which is "inimical" to what Jones finds to be the obvious materialistic tendencies of 13 science in the early modern period. Jones' account of the Ciceronian and French contexts of Hume's thought is excellent. But his claim that Hume had no interest whatsoever in science 168 is simply too strong and finally forces us to view science in Hume's day as equivalent to science in our own time, a manifestly anachronistic point of view. Throughout this paper, my argument will be conditioned by my view that Hume's interest in science cannot be separated from his epistemology or his religious scepticism. Hume's interest in science was precisely that of a man of letters of the eighteenth century vitally engaged in determining the proper use of scientific methodology in establishing the limits of the secular science of man once it has 14 been freed from the fetters of theology. Hume's interest in theological and epistemological issues inevitably gave rise to a strong interest on his part in the science of his day and in Newton's contributions... (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Montaigne and the Coherence of EclecticismPierre ForceSince the publication of Pierre Hadot's essays on ancient philosophy by Arnold Davidson in 1995,2 Michel Foucault's late work on "the care of the self"3 has appeared in a new light. We now know that Hadot's work was familiar to Foucault as early as the 1950s.4 It is also clear that Foucault's notion of "techniques of the self" is very close to what (...) Hadot calls "spiritual exercises." At the same time, there are important differences between the views of these two philosophers, and Hadot has often expressed his regret that Foucault's untimely death prevented them from exploring these differences.5 One important point of disagreement was the status of eclecticism. In Foucault's interpretation of ancient philosophy, the "constitution of the self" implied a personal choice among disparate philosophical references: "Writing as a personal exercise done by the self and for the self, is an art of disparate truth."6 In a 1989 article Hadot argued from a historical point of view that, so far as Stoicism and Epicureanism were concerned, [End Page 523] eclecticism had no place in a mature practice of philosophy. Foucault's favorite example, Seneca's Letters to Lucilius, in which Stoic arguments were invoked along with Epicurean arguments, was a work for beginners. In a mature practice of Stoicism, one would stick to the arguments of the Stoic school, choose them for their coherence, and instead of trying to forge a spiritual identity for oneself through writing, one would "liberate oneself from one's individuality in order to raise oneself up to universality."7 Hadot added that "it is only in the New Academy—in the person of Cicero, for instance—that a personal choice is made according to what reason considers as most likely at a given moment."8 This discussion of Foucault may give the impression that Hadot was somewhat dismissive of eclecticism. Yet in a 2001 interview Hadot claimed that he had always admired Cicero's intellectual independence, and he proposed a reappraisal "of an attitude that has always had a bad reputation: eclecticism."9Something very similar is a stake in the work of Alexander Nehamas, as Lanier Anderson and Joshua Landy showed in their study of his Art of Living. In the conception of philosophy as a "way of life" (Hadot) or "care of the self" (Foucault) or "self-fashioning" (Nehamas), a central issue is the relationship between theoretical coherence and the coherence of the person who theorizes. Elaborating on Nehamas's chapter on Montaigne, Anderson and Landy argue that there is a move in Montaigne away from doctrinal coherence and towards a coherence of the self. As they put it, "the harmonious whole Montaigne commends [... ] is not a coherent body of fact or theory; it is the unified self of the theorizer."10 Anderson and Landy show that this brings up all kinds of difficulties: can this unified self be other than a fiction? If that is the case, how can philosophy be a way of life? Nehamas's answer is very much in the spirit of the late Foucault: there is a coherence of the self in Montaigne, and this coherence is the product of writing as a philosophical activity. The self is fashioned through writing.Because Montaigne writes in the ancient tradition of philosophy as a way of life, one may recall Hadot's suggestion that Foucault's notion of [End Page 524] "writing the self" is an intriguing but historically inaccurate description of ancient philosophical practice. But perhaps Hadot agrees with Foucault after all, since in his most recent interviews, he speaks favorably of eclecticism, a notion that is central to Foucault's analysis of self-fashioning through writing. The case of Montaigne is particularly interesting for these purposes, not only because the Essays seem to be the prototypical example of "writing the self," but also because eclecticism is both discussed and practiced throughout the Essays. I propose to take a fresh look at this issue by investigating the status of eclecticism in Montaigne's Essays. This must start with an examination of the philosophical tradition most closely associated with... (shrink)

We investigate Turing cones as sets of reals, and look at the relationship between Turing cones, measures, Baire category and special sets of reals, using these methods to show that Martin's proof of Turing Determinacy (every determined Turing closed set contains a Turing cone or is disjoint from one) does not work when you replace “determined” with “Blackwell determined”. This answers a question of Tony Martin.

Many special problems crop up when evolutionary theory turns, quite naturally, to the question of the adaptive value and causal role of consciousness in human and nonhuman organisms. One problem is that -- unless we are to be dualists, treating it as an independent nonphysical force -- consciousness could not have had an independent adaptive function of its own, over and above whatever behavioral and physiological functions it "supervenes" on, because evolution is completely blind to the difference between a conscious (...) organism and a functionally equivalent (Turing Indistinguishable) nonconscious "Zombie" organism: In other words, the Blind Watchmaker, a functionalist if ever there was one, is no more a mind reader than we are. Hence Turing-Indistinguishability = Darwin-Indistinguishability. It by no means follows from this, however, that human behavior is therefore to be explained only by the push-pull dynamics of Zombie determinism, as dictated by calculations of "inclusive fitness" and "evolutionarily stable strategies." We are conscious, and, more important, that consciousness is piggy-backing somehow on the vast complex of unobservable internal activity -- call it "cognition" -- that is really responsible for generating all of our behavioral capacities. Hence, except in the palpable presence of the irrational (e.g., our sexual urges) where distal Darwinian factors still have some proximal sway, it is as sensible to seek a Darwinian rather than a cognitive explanation for most of our current behavior as it is to seek a cosmological rather than an engineering explanation of an automobile's behavior. Let evolutionary theory explain what shaped our cognitive capacity (Steklis & Harnad 1976; Harnad 1996, but let cognitive theory explain our resulting behavior. (shrink)

For [Formula: see text], the coarse similarity class of A, denoted by [Formula: see text], is the set of all [Formula: see text] such that the symmetric difference of A and B has asymptotic density 0. There is a natural metric [Formula: see text] on the space [Formula: see text] of coarse similarity classes defined by letting [Formula: see text] be the upper density of the symmetric difference of A and B. We study the metric space of coarse similarity classes (...) under this metric, and show in particular that between any two distinct points in this space there are continuum many geodesic paths. We also study subspaces of the form [Formula: see text] where [Formula: see text] is closed under Turing equivalence, and show that there is a tight connection between topological properties of such a space and computability-theoretic properties of [Formula: see text]. We then define a distance between Turing degrees based on Hausdorff distance in the metric space [Formula: see text]. We adapt a proof of Monin to show that the Hausdorff distances between Turing degrees that occur are exactly 0, [Formula: see text], and 1, and study which of these values occur most frequently in the senses of Lebesgue measure and Baire category. We define a degree a to be attractive if the class of all degrees at distance [Formula: see text] from a has measure 1, and dispersive otherwise. In particular, we study the distribution of attractive and dispersive degrees. We also study some properties of the metric space of Turing degrees under this Hausdorff distance, in particular the question of which countable metric spaces are isometrically embeddable in it, giving a graph-theoretic sufficient condition for embeddability. Motivated by a couple of issues arising in the above work, we also study the computability-theoretic and reverse-mathematical aspects of a Ramsey-theoretic theorem due to Mycielski, which in particular implies that there is a perfect set whose elements are mutually 1-random, as well as a perfect set whose elements are mutually 1-generic. Finally, we study the completeness of [Formula: see text] from the perspectives of computability theory and reverse mathematics. (shrink)

We study higher analogues of the classical independence number on $\omega $. For $\kappa $ regular uncountable, we denote by $i(\kappa )$ the minimal size of a maximal $\kappa $ -independent family. We establish ZFC relations between $i(\kappa )$ and the standard higher analogues of some of the classical cardinal characteristics, e.g., $\mathfrak {r}(\kappa )\leq \mathfrak {i}(\kappa )$ and $\mathfrak {d}(\kappa )\leq \mathfrak {i}(\kappa )$. For $\kappa $ measurable, assuming that $2^{\kappa }=\kappa ^{+}$ we construct a maximal $\kappa $ -independent (...) family which remains maximal after the $\kappa $ -support product of $\lambda $ many copies of $\kappa $ -Sacks forcing. Thus, we show the consistency of $\kappa ^{+}=\mathfrak {d}(\kappa )=\mathfrak {i}(\kappa )<2^{\kappa }$. We conclude the paper with interesting open questions and discuss difficulties regarding other natural approaches to higher independence. (shrink)

Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in (...) view of Hilbert's program is discussed, as well as applications of our results to functional analysis. (shrink)

A notion of resource-bounded Baire category is developed for the class PC[0,1] of all polynomial-time computable real-valued functions on the unit interval. The meager subsets of PC[0,1] are characterized in terms of resource-bounded Banach-Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function in PC[0,1] is nowhere differentiable. This is a complexity-theoretic extension of the analogous classical result that Banach proved for the class C[0, 1] in 1931.

A notion of resource‐bounded Baire category is developed for the classPC[0,1]of all polynomial‐time computable real‐valued functions on the unit interval. The meager subsets ofPC[0,1]are characterized in terms of resource‐bounded Banach‐Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function inPC[0,1]is nowhere differentiable. This is a complexity‐theoretic extension of the analogous classical result that Banach proved for the classC[0, 1] in 1931. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, (...) Weinheim). (shrink)

Let κ be a regular cardinal and P a partial ordering preserving the regularity of κ. If P is (κ-Baire and) of density κ, then there is a mad family on κ killed in all generic extensions (if and) only if below each p∈P there exists a κ-sized antichain. In this case a mad family on κ is killed (if and) only if there exists an injection from κ onto a dense subset of Ult(P) mapping the elements of onto (...) nowhere dense sets. If 2< κ =κ, then in each generic extension of V, in which κ is the minimal cardinal obtaining new subsets, some mad family on κ is killed or an independent subset of κ appears. Also, the κ-Suslin Hypothesis holds iff there exists a mad family on κ which is killed in each generic extension containing new subsets of κ and preserving P(λ) for λ<κ. (shrink)

Let κ B be the least cardinal for which the Baire category theorem fails for the real line R. Thus κ B is the least κ such that the real line can be covered by κ many nowhere dense sets. It is shown that κ B cannot have countable cofinality. On the other hand it is consistent that the corresponding cardinal for 2 ω 1 be ℵ ω . Similar questions are considered for the ideal of measure zero (...) sets, other ω 1 saturated ideals, and the ideal of zero-dimensional subsets of R ω 1. (shrink)

Every definably complete expansion of an ordered field satisfies an analogue of the Baire Category Theorem.

We develop the concepts of recursively nowhere dense sets and sets that are recursively of first category and study closed sets of points in light of Baire's Category Theorem. Our theorems are primarily concerned with exdomains of recursive quantum functions and hence with avoidable points . An avoidance function is a recursive function which can be used to expel avoidable points from domains of recursive quantum functions. We define an avoidable set of points to be an arbitrary (...) subset of the avoidable points of a single avoidance function, and we study an effective union of such sets which we call a piecemeal avoidable set. We note that each of ‘the set of recursive points’ and ‘the set of avoidable points’ is of first category but not recursively of first category. We show an exdomain exists which is recursively nowhere dense, as well as one that is nowhere dense but not recursively nowhere dense. After establishing that every exdomain is recursively of first category, we prove that given any fixed exdomain, there is another exdomain, which while dense in the underlying space, is disjoint from the fixed exdomain. Finally, we show how to build a recursive sequence of recursive quantum functions that have mutually disjoint, dense exdomains. (shrink)

We study the uniform computational content of different versions of the Baire category theorem in the Weihrauch lattice. The Baire category theorem can be seen as a pigeonhole principle that states that a complete metric space cannot be decomposed into countably many nowhere dense pieces. The Baire category theorem is an illuminating example of a theorem that can be used to demonstrate that one classical theorem can have several different computational interpretations. For one, we (...) distinguish two different logical versions of the theorem, where one can be seen as the contrapositive form of the other one. The first version aims to find an uncovered point in the space, given a sequence of nowhere dense closed sets. The second version aims to find the index of a closed set that is somewhere dense, given a sequence of closed sets that cover the space. Even though the two statements behind these versions are equivalent to each other in classical logic, they are not equivalent in intuitionistic logic, and likewise, they exhibit different computational behavior in the Weihrauch lattice. Besides this logical distinction, we also consider different ways in which the sequence of closed sets is “given.” Essentially, we can distinguish between positive and negative information on closed sets. We discuss all four resulting versions of the Baire category theorem. Somewhat surprisingly, it turns out that the difference in providing the input information can also be expressed with the jump operation. Finally, we also relate the Baire category theorem to notions of genericity and computably comeager sets. (shrink)

In this paper, we generalize a result of Brown and Simpson [1] to prove that RCA0+Π0∞-BCT is conservative over RCA0 with respect to the set of formulae in the form ∃!Xφ, where φ is arithmetical. We also consider the conservation of Π00∞-BCT over Σb1-NIA+∇b1-CA.

We show that the statement “separable, countably compact, regular spaces are Baire” is deducible from a strictly weaker form than AC, namely, CAC . We also find some characterizations of the axiom of dependent choices.

We show that Miller partition forcing preserves selective independent families and P-points, which implies the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {u}=\mathfrak {i}<\mathfrak {a}_T=\omega _2$. In addition, we show that Shelah’s poset for destroying the maximality of a given maximal ideal preserves tight mad families and so we establish the consistency of $\mbox {cof}(\mathcal {N})=\mathfrak {a}=\mathfrak {i}=\omega _1<\mathfrak {u}=\mathfrak {a}_T=\omega _2$.

The paper continues my earlier Chat with OpenAI’s ChatGPT with a Focused LLM Experiment (FLEX). The idea is to conduct Large Language Model (LLM) based explorations of certain areas or concepts. The approach is based on crafting initial guiding prompts and then follow up with user prompts based on the LLMs’ responses. The goals include improving understanding of LLM capabilities and their limitations culminating in optimized prompts. The specific subjects explored as research subject matter include a) diagonalization techniques as practiced (...) by Cantor, Turing, Gödel, and the advances, such as the Forcing techniques introduced by Paul Cohen and later investigators, b) Knowledge Hierarchies & Mapping Exercises, c) Discussions of IJ Good’s Speculations Concerning the First Ultraintelligent Machine, AGI, and Super- intelligence. Results suggest variability between major models like ChatGPT-4, Llama-3, Cohere, Sonnet and Opus. Results also point to strong dependence on users’ preexisting knowledge and skill bases. The paper should be viewed as ’raw data’ rather than a polished authoritative reference. (shrink)

We define a formula φ in a first-order language L , to be an equation in a category of L -structures K if for any H in K , and set p = {φ;i ϵI, a i ϵ H} there is a finite set I 0 ⊂ I such that for any f : H → F in K , ▪. We say that an elementary first-order theory T which has the amalgamation property over substructures is equational if every (...) quantifier-free formula is equivalent in T to a boolean combination of equations in Mod, the category of models of T with embeddings for morphisms. Thus, we develop a theory of independence with respect to equations in general categories of structures, which is similar to the one introduced in stability but which, in our context, has an algebraic character. (shrink)

We exhibit a bridge between the theory of cellular categories, used in algebraic topology and homological algebra, and the model-theoretic notion of stable independence. Roughly speaking, we show that the combinatorial cellular categories (those where, in a precise sense, the cellular morphisms are generated by a set) are exactly those that give rise to stable independence notions. We give two applications: on the one hand, we show that the abstract elementary classes of roots of Ext studied by Baldwin–Eklof–Trlifaj are stable (...) and tame. On the other hand, we give a simpler proof (in a special case) that combinatorial categories are closed under 2-limits, a theorem of Makkai and Rosický. (shrink)

It is assumed that a Kripke–Joyal semantics \({\mathcal{A} = \left\langle \mathbb{C},{\rm Cov}, {\it F},\Vdash \right\rangle}\) has been defined for a first-order language \({\mathcal{L}}\) . To transform \({\mathbb{C}}\) into a Heyting algebra \({\overline{\mathbb{C}}}\) on which the forcing relation is preserved, a standard construction is used to obtain a complete Heyting algebra made up of cribles of \({\mathbb{C}}\) . A pretopology \({\overline{{\rm Cov}}}\) is defined on \({\overline{\mathbb{C}}}\) using the pretopology on \({\mathbb{C}}\) . A sheaf \({\overline{{\it F}}}\) is made up of sections of (...) F that obey functoriality. A forcing relation \({\overline{\Vdash}}\) is defined and it is shown that \({\overline{\mathcal{A}} = \left\langle \overline{\mathbb{C}},\overline{\rm{Cov}},\overline{{\it F}}, \overline{\Vdash} \right\rangle }\) is a Kripke–Joyal semantics that faithfully preserves the notion of forcing of \({\mathcal{A}}\) . That is to say, an object a of \({\mathbb{C}Ob}\) forces a sentence with respect to \({\mathcal{A}}\) if and only if the maximal a-crible forces it with respect to \({\overline{\mathcal{A}}}\) . This reduces a Kripke–Joyal semantics defined over an arbitrary site to a Kripke–Joyal semantics defined over a site which is based on a complete Heyting algebra. (shrink)

In model theory, a branch of mathematical logic, we can classify mathematical structures based on their logical complexity. This yields the so-called stability hierarchy. Independence relations play an important role in this stability hierarchy. An independence relation tells us which subsets of a structure contain information about each other, for example, linear independence in vector spaces yields such a relation.Some important classes in the stability hierarchy are stable, simple, and NSOP $_1$, each being contained in the next. For each of (...) these classes there exists a so-called Kim-Pillay style theorem. Such a theorem describes the interaction between independence relations and the stability hierarchy. For example, simplicity is equivalent to admitting a certain independence relation, which must then be unique.All of the above classically takes place in full first-order logic. Parts of it have already been generalised to other frameworks, such as continuous logic, positive logic, and even a very general category-theoretic framework. In this thesis we continue this work.We introduce the framework of AECats, which are a specific kind of accessible category. We prove that there can be at most one stable, simple, or NSOP $_1$ -like independence relation in an AECat. We thus recover (part of) the original stability hierarchy. For this we introduce the notions of long dividing, isi-dividing, and long Kim-dividing, which are based on the classical notions of dividing and Kim-dividing but are such that they work well without compactness.Switching frameworks, we generalise Kim-dividing in NSOP $_1$ theories to positive logic. We prove that Kim-dividing over existentially closed models has all the nice properties that it is known to have in full first-order logic. We also provide a full Kim-Pillay style theorem: a positive theory is NSOP $_1$ if and only if there is a nice enough independence relation, which then must be given by Kim-dividing.Abstract prepared by Mark Kamsma.E-mail:[email protected]:https://markkamsma.nl/phd-thesis. (shrink)

A general duality connecting the level of a formal theory and of a metatheory is proposed. Because of the role of natural numbers in a metatheory the existence of a dual theory is conjectured, in which the natural numbers become formal in the theory but in formalizing non-formal natural numbers taken from the dual metatheory these numbers become nonstandard. For any formal theory there may be in principle a dual theory. The dual shape of the lattice of projections over separable (...) Hilbert space is exhibited. The crucial ingredient of this dual theory is set-theoretical (Cohen) forcing. Then, some attempts have been made to exhibit the dual shape of the exotic smooth (small) structures on topological ℝ4. There are striking similarities of both pictures. Nonstandard solutions of the equations of motion of 10-dimensional superstring of IIB type are described as a model theoretic extension of standard ones. Based on Brans conjecture one can predict the existence of sources of gravity in 4 dimensions. By their dual origins they carry quantum information as well. The generalized Maldacena conjecture appears naturally, which sheds light on a definition of background independent string theory. (shrink)

We show that after forcing with a countable support iteration or a finite product of Sacks or splitting forcing over L, every analytic hypergraph on a Polish space admits a $\mathbf {\Delta }^1_2$ maximal independent set. This extends an earlier result by Schrittesser (see [25]). As a main application we get the consistency of $\mathfrak {r} = \mathfrak {u} = \mathfrak {i} = \omega _2$ together with the existence of a $\Delta ^1_2$ ultrafilter, a $\Pi ^1_1$ maximal independent family, and (...) a $\Delta ^1_2$ Hamel basis. This solves open problems of Brendle, Fischer, and Khomskii [5] and the author [23]. We also show in ZFC that $\mathfrak {d} \leq \mathfrak {i}_{cl}$, addressing another question from [5]. (shrink)

Kendall Walton’s “Categories of Art” seeks to situate aesthetic properties contextually. As such, certain knowledge is required to fully appreciate the aesthetic properties of a work, and without that knowledge the ‘correct’ or ‘true’ aesthetic properties of a work cannot be appreciated. The aim of this paper is to show that the way Walton conceives of his categories and art categorization is difficult to square with certain kinds of aesthetic experience—kinds of experience that seems to defy this claim of (...) class='Hi'>category-dependence for aesthetic properties. The argument will be advanced for category-free aesthetic experience by considering Barry C. Smith’s account of wine-tasting and his description of his wine drinking ‘epiphany’. (shrink)

If κω is a cardinal, a complete Boolean algebra is called κ-dependent if for each sequence bβ: β<κ of elements of there exists a partition of the unity, P, such that each pP extends bβ or bβ′, for κ-many βκ. The connection of this property with cardinal functions, distributivity laws, forcing and collapsing of cardinals is considered.

Pendant la construction de sa philosophie Dilthey montre qu’une de sa principale tâche est le travail con les catégories de la vie que, différemment de les catégories formelles de l’entendement, ne se comprennent pas isolées, mais comme part d’un tout. Même si ce tout soit donné comme la plus grande expression de la histoire, la signification est plus une catégorie de la vie que une catégorie de la histoire, parce que le concept de force, que est originalement de la vie (...) comme ce qui la move contre la pression exercé par le monde, se trouve aussi dans le monde historique, quand elle est l’essai du présent à solutionner les problèmes du passé. (shrink)

This paper formulates a notion of independence of subobjects of an object in a general (i.e. not necessarily concrete) category. Subobject independence is the categorial generalization of what is known as subsystem independence in the context of algebraic relativistic quantum field theory. The content of subobject independence formulated in this paper is morphism co-possibility: two subobjects of an object will be defined to be independent if any two morphisms on the two subobjects of an object are jointly implementable by (...) a single morphism on the larger object. The paper investigates features of subobject independence in general, and subobject independence in the category of C∗ - algebras with respect to operations (completely positive unit preserving linear maps on C∗ - algebras)as morphisms is suggested as a natural subsystem independence axiom to express relativistic locality of the covariant functor in the categorial approach to quantum field theory. (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We introduce bounded category forcing axioms for well-behaved classes [math]. These are strong forms of bounded forcing axioms which completely decide the theory of some initial segment of the universe [math] modulo forcing in [math], for some cardinal [math] naturally associated to [math]. These axioms naturally extend projective absoluteness for arbitrary set-forcing — in this situation [math] — to classes [math] with [math]. Unlike projective absoluteness, these higher bounded (...) class='Hi'>category forcing axioms do not follow from large cardinal axioms but can be forced under mild large cardinal assumptions on [math]. We also show the existence of many classes [math] with [math] giving rise to pairwise incompatible theories for [math]. (shrink)

This article attempts a subjectively based approach, in fact one phenomenologically motivated, toward some key concepts of forcing theory, primarily the concepts of a generic set and its global properties and the absoluteness of certain fundamental relations in the extension to a forcing model M[G]. By virtue of this motivation and referring both to the original and current formulation of forcing I revisit certain set-theoretical notions serving as underpinnings of the theory and try to establish their deeper subjectively founded content (...) and also their influence in reaching relative consistency results by the forcing method. In this perspective, the present approach may be seen as offering an alternative view of the consistency results of K. Gödel and P. Cohen in mathematical foundations reaching a subjective level that may be taken as ultimately conditioning the non-decidability of key infinity statements on the level of formal theory. (shrink)

We give an introduction to Turing categories, which are a convenient setting for the categorical study of abstract notions of computability. The concept of a Turing category first appeared in the work of Longo and Moggi; later, Di Paolo and Heller introduced the closely related recursion categories. One of the purposes of Turing categories is that they may be used to develop categorical formulations of recursion theory, but they also include other notions of computation, such as (...) models of combinatory logic and of the lambda calculus. In this paper our aim is to give an introduction to the basic structural theory, while at the same time illustrating how the notion is a meeting point for various other areas of logic and computation. We also provide a detailed exposition of the connection between Turing categories and partial combinatory algebras and show the sense in which the study of Turing categories is equivalent to the study of PCAs. (shrink)

This paper commences from the critical observation that the Turing Test (TT) might not be best read as providing a definition or a genuine test of intelligence by proxy of a simulation of conversational behaviour. Firstly, the idea of a machine producing likenesses of this kind served a different purpose in Turing, namely providing a demonstrative simulation to elucidate the force and scope of his computational method, whose primary theoretical import lies within the realm of mathematics rather than (...) cognitive modelling. Secondly, it is argued that a certain bias in Turing’s computational reasoning towards formalism and methodological individualism contributed to systematically unwarranted interpretations of the role of the TT as a simulation of cognitive processes. On the basis of the conceptual distinction in biology between structural homology vs. functional analogy, a view towards alternate versions of the TT is presented that could function as investigative simulations into the emergence of communicative patterns oriented towards shared goals. Unlike the original TT, the purpose of these alternate versions would be co-ordinative rather than deceptive. On this level, genuine functional analogies between human and machine behaviour could arise in quasi-evolutionary fashion. (shrink)

The aim of this article is to analyse the new forms of militarism as well as the position and the role of the armed forces in Latin American political systems in the twenty-first century. The first part analyses two selected forms of military participation in politics: the participation of former servicemembers in presidential elections and their performance as presidents, and the militarisation of political parties. The second part of the article focuses on the issue of contemporary civil-military relations in Latin (...) America, discussing the problems associated with the establishment of democratic control over the armed forces, the reform of the Ministries of Defense and the redefinition of the functions of the army. (shrink)

In the 1950s, Alan Turing proposed his influential test for machine intelligence, which involved a teletyped dialogue between a human player, a machine, and an interrogator. Two readings of Turing's rules for the test have been given. According to the standard reading of Turing's words, the goal of the interrogator was to discover which was the human being and which was the machine, while the goal of the machine was to be indistinguishable from a human being. According (...) to the literal reading, the goal of the machine was to simulate a man imitating a woman, while the interrogator – unaware of the real purpose of the test – was attempting to determine which of the two contestants was the woman and which was the man. The present work offers a study of Turing's rules for the test in the context of his advocated purpose and his other texts. The conclusion is that there are several independent and mutually reinforcing lines of evidence that support the standard reading, while fitting the literal reading in Turing's work faces severe interpretative difficulties. So, the controversy over Turing's rules should be settled in favor of the standard reading. (shrink)

Proceedings of the papers presented at the Symposium on "Revisiting Turing and his Test: Comprehensiveness, Qualia, and the Real World" at the 2012 AISB and IACAP Symposium that was held in the Turing year 2012, 2–6 July at the University of Birmingham, UK. Ten papers. - http://www.pt-ai.org/turing-test --- Daniel Devatman Hromada: From Taxonomy of Turing Test-Consistent Scenarios Towards Attribution of Legal Status to Meta-modular Artificial Autonomous Agents - Michael Zillich: My Robot is Smarter than Your Robot: (...) On the Need for a Total Turing Test for Robots - Adam Linson, Chris Dobbyn and Robin Laney: Interactive Intelligence: Behaviour-based AI, Musical HCI and the Turing Test - Javier Insa, Jose Hernandez-Orallo, Sergio España - David Dowe and M.Victoria Hernandez-Lloreda: The anYnt Project Intelligence Test (Demo) - Jose Hernandez-Orallo, Javier Insa, David Dowe and Bill Hibbard: Turing Machines and Recursive Turing Tests — Francesco Bianchini and Domenica Bruni: What Language for Turing Test in the Age of Qualia? - Paul Schweizer: Could there be a Turing Test for Qualia? - Antonio Chella and Riccardo Manzotti: Jazz and Machine Consciousness: Towards a New Turing Test - William York and Jerry Swan: Taking Turing Seriously (But Not Literally) - Hajo Greif: Laws of Form and the Force of Function: Variations on the Turing Test. (shrink)

It is consistent that each union of many families in the Baire space which are not finitely dominating is not dominating. In particular, it is consistent that for each nonprincipal ultrafilter , the cofinality of the reduced ultrapower is greater than . The model is constructed by oracle chain condition forcing, to which we give a self-contained introduction.

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)