This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.

We show how to build various models of first-order theories, which also have properties like: tree with only definable branches, atomic Boolean algebras or ordered fields with only definable automorphisms. For this we use a set-theoretic assertion, which may be interesting by itself on the existence of quite generic subsets of suitable partial orders of power λ + , which follows from ♦ λ and even weaker hypotheses . For a related assertion, which is equivalent to the morass see (...) Shelah and Stanley [16]. The various specific constructions serve also as examples of how to use this set-theoretic lemma. We apply the method to construct rigid ordered fields, rigid atomic Boolean algebras, trees with only definable branches; all in successors of regular cardinals under appropriate set- theoretic assumptions. So we are able to answer the following algebraic question. Saltzman's Question . Is there a rigid real closed field, which is not a subfield of the reals? (shrink)

Falsificationism has dominated 20th century philosophy of science. It seemed to have eclipsed all forms of inductivism. Yet recent debates have revived a specific form of eliminative inductivism, the basic ideas of which go back to F. Bacon and J.S. Mill. These modern endorsements of eliminative inductivism claim to show that progressive problem solving is possible using induction, rather than falsification as a method of justification. But this common ground between falsificationism and eliminative inductivism has not led to a detailed (...) investigation into the relationship, if any, which may exist between these two methodologies. This paper reviews several versions of eliminative inductivism, establishes a natural relation between eliminative inductivism and falsificationism, which derives from the distinction between models and theories, and carries out this investigation against a case study of the construction of atom models. The result of the investigation is that falsificationism is a form of eliminative inductivism in the limit of certain constraints. (shrink)

Most of the early proofs of the decidability or completeness of certain mathematical theories were based on the method of eliminations of quantifiers. Various more recent results on completeness were obtained independently of such procedures. However, it is shown in the present paper that, conversely, the completeness of a mathematical theory will in certain circumstances entail the existence of an elimination method. The proof involves the application of the extended first ε‐theorem of Hilbert‐Bernays.ZusammenfassungDie meisten früheren Beweise der Vollständigkeit oder (...) Entscheidbarkeit gewisser mathematischer Theorien benutzten die sogenannte Quantoren‐eliminierungsmethode. Dagegen sind einige neuere Ergebnisse über Voll‐ständigkeit unabhängig von diesem Verfahren. Es ist deshalb von Interesse festzustellen, dass umgekehrt die Vollständigkeit einer mathematischen Theorie unter Umständen die Existenz einer Eliminierungsmethode fürdiese Theorie nach sich zieht. Der Beweis benutzt das erweiterte erste ε‐Theorem von Hilbert‐Bernays.SommaireBeaucoup de démonstrations concernant la complétude de certaines théories mathématiques, ou concernant l'existence d'un procédé de décision pour une telle théorie, sont basées sur des méthodes d'élimination de quantificateurs. Or, il y a des résultats plus récents sur la complétude de certaines théories qui ne dépendent pas de telles méthodes d'élimination. Toutefois on démontre ici que la complétude d'une théorie mathématique entraîne sous certaines conditions l'existence d'une méthode d'élimination. Au cours de la démonstration on se sert d'un des théorèmes‐ε de Hilbert‐Bernays. (shrink)

Elimination controversies are ubiquitous in philosophy and the human sciences. For example, it has been suggested that human races, hysteria, intelligence, mental disorder, propositional attitudes such as beliefs and desires, the self, and the super-ego should be eliminated from the list of respectable entities in the human sciences. I argue that eliminativist proposals are often presented in the framework of an oversimplified “phlogiston model” and suggest an alternative account that describes ontological elimination on a gradual scale between criticism (...) of empirical assumptions and conceptual choices. (shrink)

Arguments by Sorkin (Impossible measurements on quantum fields. In: Directions in general relativity: proceedings of the 1993 International Symposium, Maryland, vol 2, pp 293–305, 1993) and Borsten et al. (Phys Rev D 104(2), 2021. https://doi.org/10.1103/PhysRevD.104.025012 ) establish that a natural extension of quantum measurement theory from non-relativistic quantum mechanics to relativistic quantum theory leads to the unacceptable consequence that expectation values in one region depend on which unitary operation is performed in a spacelike separated region. Sorkin [ 1 ] labels (...) such scenarios ‘impossible measurements’. We explicitly present these arguments as a no-go result with the logical form of a reductio argument and investigate the consequences for measurement in quantum field theory (QFT). Sorkin-type impossible measurement scenarios clearly illustrate the moral that Microcausality is not by itself sufficient to rule out superluminal signalling in relativistic quantum theories that use Lüders’ rule. We review three different approaches to formulating an account of measurement for QFT and analyze their responses to the ‘impossible measurements’ problem. Two of the approaches are: a measurement theory based on detector models proposed in Polo-Gómez et al. (Phys Rev D, 2022. https://doi.org/10.1103/physrevd.105.065003 ) and a measurement framework for algebraic QFT proposed in Fewster and Verch (Commun Math Phys 378(2):851–889, 2020). Of particular interest for foundations of QFT is that they share common features that may hold general morals about how to represent measurement in QFT. These morals are about the role that dynamics plays in eliminating ‘impossible measurements’, the abandonment of the operational interpretation of local algebras \({\mathcal {A}}(O)\) as representing possible operations carried out in region _O_, and the interpretation of state update rules. Finally, we examine the form that the ‘impossible measurements’ problem takes in histories-based approaches and we discuss the remaining challenges. (shrink)

Elimination controversies are ubiquitous in philosophy and the human sciences. For example, it has been suggested that human races, hysteria, intelligence, mental disorder, propositional attitudes such as beliefs and desires, the self, and the super-ego should be eliminated from the list of respectable entities in the human sciences. I argue that eliminativist proposals are often presented in the framework of an oversimplified “phlogiston model” and suggest an alternative account that describes ontological elimination on a gradual scale between criticism (...) of empirical assumptions and conceptual choices. (shrink)

In this paper I call into question the commonplace assumption in Anglophone Nietzsche scholarship that ideal psychological self-cultivation comes about solely by means of the sublimation of all of one's drives. While the psychological incorporation of one’s drives and instincts plays a crucial role in promoting what Nietzsche considers a higher self, I argue that some degree of removal and elimination of particular drives and instincts could be, perhaps necessarily is, involved in ideal cases. Yet I will suggest that (...) we should not think of these cases as constituting ‘repressions’. I will seek to offer a better characterization of the discussions of productive removal and elimination in Nietzsche’s texts, and consider how they fit in his model of self-cultivation. Nietzsche’s texts demonstrate a more nuanced understanding of the ways in which certain kinds of removal and elimination can lead to greater integration for the would-be exemplary individual. My reading, I argue, helps to better understand the instances in the texts where Nietzsche valorizes the removal of particular drives and instincts. (shrink)

ABSTRACTIn this paper I call into question the commonplace assumption in Anglophone Nietzsche scholarship that ideal psychological self-cultivation comes about solely by means of the sublimation of all of one's drives. While the psychological incorporation of one’s drives and instincts plays a crucial role in promoting what Nietzsche considers a higher self, I argue that some degree of removal and elimination of particular drives and instincts could be, perhaps necessarily is, involved in ideal cases. Yet I will suggest that (...) we should not think of these cases as constituting ‘repressions’. I will seek to offer a better characterization of the discussions of productive removal and elimination in Nietzsche’s texts, and consider how they fit in his model of self-cultivation. Nietzsche’s texts demonstrate a more nuanced understanding of the ways in which certain kinds of removal and elimination can lead to greater integration for the would-be exemplary individual. My reading, I argue, helps to better understand the instances in the texts where Nietzsche valorizes the removal of particular drives and instincts. (shrink)

We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets (...) is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results. (shrink)

Elimination of quantifiers is shown to fail dramatically for a group of well‐known mathematical theories (classically enjoying the property) against a wide range of relevant logical backgrounds. Furthermore, it is suggested that only by moving to more extensional underlying logics can we get the property back.

In [2], Singer proved that the theory of ordered differential fields has a model completion, i.e, the theory of closed ordered differential fields, CODF. As a result, CODF admits elimination of quantifiers. In this paper we give an algorithm to eliminate the quantifiers of CODF-formulas.

We propose that the primary cause of schizophrenia is a pathological extension of synaptic pruning involving local connectivity that unfolds ordinarily during adolescence. Computer simulations suggest that this pathology provides reasonable accounts of a range of symptoms in schizophrenia, and is consistent with recent postmortem and genetic studies. NMDA-receptors play a regulatory role in maintaining and/or eliminating cortical synapses, and therefore may play a pathophysiological role.

In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretical argument, which provides no apparent bounds on the complexity of a decision procedure. We provide a syntactical argument that yields a procedure that is primitive recursive, although not elementary.

From classical, Fraïissé-homogeneous, ($\leq \omega$)-categorical theories over finite relational languages, we construct intuitionistic theories that are complete, prove negations of classical tautologies, and admit quantifier elimination. We also determine the intuitionistic universal fragments of these theories.

The logic CD is an intermediate logic which exactly corresponds to the Kripke models with constant domains. It is known that the logic CD has a Gentzen-type formulation called LD and rules are replaced by the corresponding intuitionistic rules) and that the cut-elimination theorem does not hold for LD. In this paper we present a modification of LD and prove the cut-elimination theorem for it. Moreover we prove a “weak” version of cut-elimination theorem for LD, saying (...) that all “cuts” except some special forms can be eliminated from a proof in LD. From these cut-elimination theorems we obtain some corollaries on syntactical properties of CD: fragments collapsing into intuitionistic logic. Harrop disjunction and existence properties, and a fact on the number of logical symbols in the axiom of CD. (shrink)

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting (...) of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory. (shrink)

The doctrine of eliminative materialism holds that belief-desire psychology is massively referentially disconnected. We claim, however, that it is not at all obvious what it means to be referentially (dis)connected. The two major accounts of reference both lead to serious difficulties for eliminativism: it seems that elimination is either impossible or omnipresent. We explore the idea that reference fixation is a much more local, partial, and context-dependent process than was supposed by the classical accounts. This pragmatic view suggests that (...) elimination is not the prime model for understanding the complex relations between the mind and brain sciences, and that we have little ground for concluding that in general psychological kinds do not exist. We suggest that reference changes are better seen as continuous rather than completely eliminative. (shrink)

Problems of self-interaction arise in both classical and quantum field theories. To understand how such problems are to be addressed in a quantum theory of the Dirac and electromagnetic fields (quantum electrodynamics), we can start by analyzing a classical theory of these fields. In such a classical field theory, the electron has a spread-out distribution of charge that avoids some of the problems of self-interaction facing point charge models. However, there remains the problem that the electron will experience self-repulsion. (...) This self-repulsion cannot be eliminated within classical field theory without also losing Coulomb interactions between distinct particles. But, electron self-repulsion can be eliminated from quantum electrodynamics in the Coulomb gauge by fully normal-ordering the Coulomb term in the Hamiltonian. After normal-ordering, the Coulomb term contains pieces describing attraction and repulsion between distinct particles and also pieces describing particle creation and annihilation, but no pieces describing self-repulsion. (shrink)

Hypersequent calculi can formalize various non-classical logics. In [9] we presented a non-commutative variant of HC for the weakest temporal logic of linear frames Kt4.3 and some its extensions for dense and serial flow of time. The system was proved to be cut-free HC formalization of respective temporal logics by means of Schütte/Hintikka-style semantical argument using models built from saturated hypersequents. In this paper we present a variant of this calculus for Kt4.3 with a constructive syntactical proof of cut (...) elimination. (shrink)

We continue the analysis of foundations of positive model theory as introduced by Ben Yaacov and Poizat. The objects of this analysis are $h$-inductive theories and their models, especially the “positively” existentially closed ones. We analyze topological properties of spaces of types, introduce forms of quantifier elimination, and characterize minimal completions of arbitrary $h$-inductive theories. The main technical tools consist of various forms of amalgamations in special classes of structures.

A general model of problem‐solving processes based on misconception elimination is presented to simulate both impasses and solving processes. The model operates on goal‐related rules and a set of constraint rules in the form of “if (state or goal), do not (Action)” for the explicit constraints in the instructions and the implicit constraints that come from misconceptions of legal moves. When impasses occur, a constraint elimination mechanism is applied. Because successive eliminations of implicit constraints enlarge the problem space (...) and have an effect on planning, the model integrates “plan‐based” and “constraint‐based” approaches to problem‐solving behavior.Simulating individual protocols of Tower of Hanoi situations shows that the model, which has a proper set of constraints, predicts a single move with no alternative on about 61% of the movements and that protocols are quite successfully simulated movement by movement. Finally, it is shown that many features of previous models are embedded in the constraint elimination model. (shrink)

We consider the theoryT IT of infinite terms. The axioms for the theoryT IT are analogous to the Mal'cev's axioms for the theoryT IT of finite terms whose models are the locally free algebras. Recently Maher [Ma] has proved that the theoryT IT in a finite non singular signature plus the Domain Closure Axiom is complete. We give a description of all the complete extension ofT IT from which an effective decision procedure forT IT is obtained. Our approach considers (...) formulas built up with syntactic terms containing pointers. Using such a technique, the analysis of the theoryT IT can be carried out in analogy with Mal'cev's analysis ofT FT. Our results follow from an effective quantifier elimination procedure for formulas with pointers. (shrink)

We will give here a purely algebraic proof of the cut elimination theorem for various sequent systems. Our basic idea is to introduce mathematical structures, called Gentzen structures, for a given sequent system without cut, and then to show the completeness of the sequent system without cut with respect to the class of algebras for the sequent system with cut, by using the quasi-completion of these Gentzen structures. It is shown that the quasi-completion is a generalization of the MacNeille (...) completion. Moreover, the finite model property is obtained for many cases, by modifying our completeness proof. This is an algebraic presentation of the proof of the finite model property discussed by Lafont [12] and Okada-Terui [17]. (shrink)

The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, we (...) notice that cut remains eliminable when suitable arithmetical axioms are added to the system. Finally, we establish a direct link between cut-free derivability in infinitary formulations of the systems considered and fixed-point semantics. Noticeably, unlike what happens with other background logics, such links are established without imposing any restriction to the premisses of the truth rules. (shrink)

We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets (...) is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results. (shrink)

This paper extends theorems of Belegradek about poly-regular groups of finite rank to certain poly-regular groups of infinite rank. A model-theoretic property aiding these investigations is the elimination of unbounded quantifiers, and the paper establishes both a general model-theoretic test for this property and results about bounded quantifiers in the special context of ordered Abelian groups.

We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets B such that A ⊆ B ⊆ acl and closed subgroups of the Galois group Aut/A). We also characterize when the topology of the Galois group is the quotient topology.

A comprehensive model for describing various forms of developments in science is defined in precise, set-theoretic terms, and in the spirit of the structuralist approach in the philosophy of science. The model emends previous accounts in centering on single systems in a homogenous way, eliminating notions which essentially refer to sets of systems. This is achieved by eliminating the distinction between theoretical and non-theoretical terms as a primitive, and by introducing the notion of intended links. The force of the model (...) is demonstrated by formally incorporating many of the important, precise meta-theoretic concepts occurring in the literature. (shrink)

For the past three decades linguistic theory has been based on the assumption that sentences are interpreted and constructed by the brain by means of computational processes analogous to those of a serial-digital computer. The recent interest in devices based on the neural network or parallel distributed processor (PDP) principle raises the possibility ("eliminative connectionism") that such devices may ultimately replace the S-D computer as the model for the interpretation and generation of language by the brain. An analysis of the (...) differences between the two models suggests that the effect of such a development would be to steer linguistic theory towards a return to the empiricism and behaviorism which prevailed before it was driven by Chomsky towards nativism and mentalism. Linguists, however, will not be persuaded to return to such a theory unless and until it can deal with the phenomenon of novel sentence construction as effectively as its nativist/mentalist rival. (shrink)

Well prior to the invention of the term ‘biology’ in the early 1800s by Lamarck and Treviranus (and lesser-known figures in the decades prior), and also prior to the appearance of terms such as ‘organism’ under the pen of Leibniz and Stahl in the early 1700s, the question of ‘Life’, that is, the status of living organisms within the broader physico-mechanical universe, agitated different corners of the European intellectual scene. From modern Epicureanism to medical Newtonianism, from Stahlian animism to the (...) discourse on the ‘animal economy’ in vitalist medicine, models of living being were constructed in opposition to ‘merely anatomical’, structural, mechanical models. It is therefore striking that the classic narratives of the Scientific Revolution conspicuously avoid any consideration of what status to grant living beings in a newly physicalized universe (I discuss this in Wolfe 2011, 2019 chapt. 1). Neither Harvey, nor Boyle, nor Locke (to name some likely candidates, the latter having studied with Willis and collaborated with Sydenham) ever ask what makes organisms unique, or conversely, what does not. In this chapter I seek to establish how something we might call ‘the knowledge of Life’, to use an expression of Georges Canguilhem’s, emerged as part of early modernity without being part of the mainstream history of life science. This leads to the question, can one can correlate early modern “knowledge of life” with the emergence of a science called ‘biology’? (see Zammito 2018, Wolfe 2019, Bognon-Küss and Wolfe eds. 2019). It was once fashionable to speak of, e.g. ‘precursors of Darwin’, and then Canguilhem and Foucault famously did away with the category of precursor. But how then do we account for the phase that precedes the constitution of a science? With the case of biology, how do we account for the increasing fascination with the ontology of Life during the decades prior to the ‘naming of biology’, as McLaughlin has called it, at the end of the eighteenth century? This increased focus on Life and the ontology of Life sits awkwardly, both with mainstream narratives of the Scientific Revolution and of the history of biology. In seeking to address this increased focus (in which vitalism plays a role but was by no means the only conceptual actor: Wolfe 2020), I critically examine Foucault’s notorious claim (Foucault 1966) that there was no such thing as ‘Life’ in the eighteenth century and thus no such thing as biology. (shrink)

This work presents a model-theoretic approach to the study of the amalgamation property for varieties of semilinear commutative residuated lattices. It is well-known that if a first-order theory T enjoys quantifier elimination in some language L, the class of models of the set of its universal consequences \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\rm T_\forall}$$\end{document} has the amalgamation property. Let \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}(\mathbb{K})}$$\end{document} be the theory of an (...) elementary subclass \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{K}}$$\end{document} of the linearly ordered members of a variety \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} of semilinear commutative residuated lattices. We show that whenever \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}(\mathbb{K})}$$\end{document} has elimination of quantifiers, and every linearly ordered structure in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} is a model of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\rm Th}_\forall(\mathbb{K})}$$\end{document}, then \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb{V}}$$\end{document} has the amalgamation property. We exploit this fact to provide a purely model-theoretic proof of amalgamation for particular varieties of semilinear commutative residuated lattices. (shrink)

We describe a model-theoretic approach to ordinal analysis via the finite combinatorial notion of an α-large set of natural numbers. In contrast to syntactic approaches that use cut elimination, this approach involves constructing finite sets of numbers with combinatorial properties that, in nonstandard instances, give rise to models of the theory being analyzed. This method is applied to obtain ordinal analyses of a number of interesting subsystems of first- and second-order arithmetic.

While some branches of complexity theory are advancing rapidly, the same cannot be said for our understanding of emergence. Despite a complete knowledge of the rules underlying the interactions between the parts of many systems, we are often baffled by their sudden transitions from simple to complex. Here I propose a solution to this conceptual problem. Given that emergence is often the result of many interactions occurring simultaneously in time and space, an ability to intuitively grasp it would require the (...) ability to consciously think in parallel. A simple exercise is used to demonstrate that we do not possess this ability. Our surprise at the behaviour of cellular automata models, and the natural cases of pattern formation they mimic, is then explained from this perspective. This work suggests that the cognitive limitations of the mind can be as significant a barrier to scientific progress as the limitations of our senses. (shrink)

A Steiner triple system (STS) is a set S together with a collection B of subsets of S of size 3 such that any two elements of S belong to exactly one element of B. It is well known that the class of finite STS has a Fraïssé limit M_F. Here, we show that the theory T of M_F is the model completion of the theory of STSs. We also prove that T is not small and it has quantifier (...) class='Hi'>elimination, TP2, NSOP1, elimination of hyperimaginaries and weak elimination of imaginaries. (shrink)

We study the theory of a Hilbert space H as a module for a unital C*-algebra ${\mathcal{A}}$ from the point of view of continuous logic. We give an explicit axiomatization for this theory and describe the structure of all the representations which are elementary equivalent to it. Also, we show that this theory has quantifier elimination and we characterize the model companion of the incomplete theory of all non-degenerate representations of ${\mathcal{A}}$ . Finally, we show that there is an (...) homeomorphism between the space of types of norm less than 1 in this model companion, and the space of quasistates of the C*-algebra ${\mathcal{A}}$. (shrink)

We observe that Schrödinger’s equation may be written as two real coupled Hamilton–Jacobi (HJ)-like equations, each involving a quantum potential. Developing our established programme of representing the quantum state through exact free-standing deterministic trajectory models, it is shown how quantum evolution may be treated as the autonomous propagation of two coupled congruences. The wavefunction at a point is derived from two action functions, each generated by a single trajectory. The model shows that conservation as expressed through a continuity equation (...) is not a necessary component of a trajectory theory of state. Probability is determined by the difference in the action functions, not by the congruence densities. The theory also illustrates how time-reversal symmetry may be implemented through the collective behaviour of elements that individually disobey the conventional transformation (T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm{T}$$\end{document}) of displacement (scalar) and velocity (reversal). We prove that an integral curve of the linear superposition of two vectors can be derived algebraically from the integral curves of one of the constituent vectors labelled by integral curves associated with the other constituent. A corollary establishes relations between displacement functions in diverse trajectory models, including where the functions obey different symmetry transformations. This is illustrated by showing that a (T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm{T}$$\end{document}-obeying) de Broglie-Bohm trajectory is a sequence of points on the (non-T\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm{T}$$\end{document}) HJ trajectories, and vice versa. (shrink)

This paper will argue that there is no such thing as introspective access to judgments and decisions. It won't challenge the existence of introspective access to perceptual and imagistic states, nor to emotional feelings and bodily sensations. On the contrary, the model presented in Section 2 presumes such access. Hence introspection is here divided into two categories: introspection of propositional attitude events, on the one hand, and introspection of broadly perceptual events, on the other. I shall assume that the latter (...) exists while arguing that the former doesn't (or not in the case of judgments and decisions, at least). Section 1 makes some preliminary points and distinctions, and outlines the scope of the argument. Section 2 presents and motivates the general model of introspection that predicts a divided result. Section 3 provides independent evidence for the conclusion that judgments and decisions aren't introspectable. Section 4 then replies to a number of objections to the argument, the most important of which is made from the perspective of so-called "dual systems theories" of belief formation and decision making. The upshot is a limited form of eliminativism about introspection, in respect of at least two core categories of propositional attitude. (shrink)

This paper studies some model-theoretic properties of special groups of finite type. Special groups are a first-order axiomatization of the algebraic theory of quadratic forms, introduced by Dickmann and Miraglia, which is essentially equivalent to abstract Witt rings. More precisely, we consider elementary equivalence, saturation, elementary embeddings, quantifier elimination, stability and Morley rank.

We find the model completion of the theory modules over ������, where ������ is a finitely generated commutative algebra over a field K. This is done in a context where the field K and the module are represented by sorts in the theory, so that constructible sets associated with a module can be interpreted in this language. The language is expanded by additional sorts for the Grassmanians of all powers of $K^n $ , which are necessary to achieve quantifier (...) class='Hi'>elimination. The result turns out to be that the model completion is the theory of a certain class of "big" injective modules. In particular, it is shown that the class of injective modules is itself elementary. We also obtain an explicit description of the types in this theory. (shrink)

Practical wisdom eliminativism has recently been proposed in both philosophy and psychology, on the grounds of the alleged redundancy of practical wisdom (Miller 2021 ) and its purported developmental/psychological implausibility (Lapsley 2021 ). Here we respond to these challenges by drawing on an improved version of a view of practical wisdom, the “Aretai model”, that we have presented elsewhere (De Caro et al. 2021 ; Vaccarezza et al. 2023 ; De Caro et al. forthcoming ). According to this model, practical (...) wisdom is conceptualized: (i) as virtuousness _tout court_, i.e., as the _ratio essendi_ of the virtues, and (ii) as a form of ethical expertise. By appealing to the first thesis, we counter the charge of psychological implausibility, while we rely on the second thesis to address the accusation of redundancy. In conclusion we argue that the Aretai model implies a significant paradigm shift in virtue ethics. Practical wisdom emerges as both necessary and sufficient for virtuousness, thereby downsizing – without eliminating entirely – the role that individual virtues play in our ethical lives. (shrink)

The Joint Non-Trivialization Theorem, two Definability Theorems and the generalized Quantifier Elimination Theorem are proved for J 3-theories. These theories are three-valued with more than one distinguished truth-value, reflect certain aspects of model type logics and can. be paraconsistent. J 3-theories were introduced in the author's doctoral dissertation.