An AE-sentence is a sentence in prenex normal form with all universal quantifiers preceding all existential quantifiers, and the AE-theory of a structure is the set of all AE-sentences true in the structure. We show that the AE-theory of \, \cap, \cup, 0, 1)\) is decidable by giving a procedure which, for any AE-sentence in the language, determines the truth or falsity of the sentence in our structure.

This thesis examines the prospects for mechanical procedures that can identify true, complete, universal, first-order logical theories on the basis of a complete enumeration of true atomic sentences. A sense of identification is defined that is more general than those which are usually studied in the learning theoretic and inductive inference literature. Some identification algorithms based on confirmation relations familiar in the philosophy of science are presented. Each of these algorithms is shown to identify all purely universal theories (...) without function symbols. It is demonstrated that no procedure can solve this universal theory inference problem in the more usual senses of identification. The question of efficiency for theory inference systems is addressed, and some definitions of limiting complexity are examined. It is shown that several aspects of obvious strategies for solving the universal theory inference problem are NP-hard. Finally, some non-worst case heuristic search strategies are examined in light of these NP-completeness results. These strategies are based upon an isomorphism between clausal entailments of a certain class and partition lattices, and are applicable to the improvement of earlier work on language acquisition and logical inductive inference. (shrink)

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to have a model completion, extending a characterization provided by Wheeler. For varieties of algebras that have equationally definable principal congruences and the compact intersection property, these conditions yield a more elegant characterization obtained (in a slightly more restricted setting) by Ghilardi and Zawadowski. Moreover, it is shown that under certain further assumptions on congruence lattices, the existence of a (...) model completion implies that the variety has equationally definable principal congruences. This result is then used to provide necessary and sufficient conditions for the existence of a model completion for theories of Hamiltonian varieties of pointed residuated lattices, a broad family of varieties that includes lattice-ordered abelian groups and MV-algebras. Notably, if the theory of a Hamiltonian variety of pointed residuated lattices has a model completion, it must have equationally definable principal congruences. In particular, the theories of lattice-ordered abelian groups and MV-algebras do not have a model completion, as first proved by Glass and Pierce, and Lacava, respectively. Finally, it is shown that certain varieties of pointed residuated lattices generated by their linearly ordered members, including lattice-ordered abelian groups and MV-algebras, can be extended with a binary operation to obtain theories that do have a model completion. (shrink)

I offer a mereological bundle of universals theory of material objects. The theory says that objects are identical to fusions of immanent universals at regions of space. Immanent universals are in the objects that instantiate them, and they can be wholly located at many regions of space. The version of the bundle theory I offer explains these characteristics of immanent universals, and it captures the instantiation relation in terms of the part-whole relation. The version of the (...) class='Hi'>theory I offer is simpler and more unified than other mereological bundle theories. Yet, it is not as encompassing as other versions. For I suppose throughout that space is a particular substance, but not a bundle of properties. (shrink)

The strongly innovative theory of whole-parts relations outlined by Husserl in his Third logical Investigation—to which he attributed a basic value for his entire phenomenology—has recently attracted a renewed interest. Although many important issues have been clarified (especially by Kit Fine) the subject seems still worth being revisited. To this aim Husserlian universes are introduced. These are lower bounded distributive lattices endowed with a unary operation of defect and a binary relation of isogeneity. Husserl's contents are identified with (...) nonzero elements of a Husserlian universe and the dependence relations among contents are defined and studied starting from the idea that the defect of xis what x needs in order to ‘exist’ i.e., in order to be ‘closed’ with respect to the closure operation defined as the sup of x and its defect. It turns out that there are (at least) eight dependence relations which are worth to be considered. Many other questions concerning the world of contents (among them the proofs of the famous Husserl's Sätze) may now be discussed and clarified. Then the theory of species and genera is developed. Ultimate species (for short: species) are identified with equivalence classes of contents modulo isogeneity, and species in general (for short: genera) are identified with arbitrary unions of species. On the basis of the relation obtaining among two contents when they are isogeneous to two contents the first of which is a part of the second it becomes possible to develop a rather satisfying interpretation of Husserl's theory of the dependencies among species and genera and of the material a priori laws. By strengthening the notion of Husserlian universe into the notion of rigid Husserlian universe, the theory of species and genera obtains a stronger version. Three models of the theory are exhibited. The first one, suggested by combinatorial-topological considerations, identifies contents with finite non-empty sets of natural numbers; the second one identifies contents with non-empty sets of formulas of a formal language; the third one (not totally ‘rigid’) identifies contents with positive integers. (shrink)

The ‘theory of universals’ of St. Thomas Aquinas has been interpreted in one of two ways by most commentators. Traditionally, commentators have attributed to Thomas the theory which is usually also attributed to Aristotle: “moderate realism,” the view that universals exist in things, subject in some way to individuating principles in the things. For example, according to Copleston.

We study the computational complexity of the universal and quasi-equational theories of classes of bounded distributive lattices with a negation operation, i.e., a unary operation satisfying a subset of the properties of the Boolean negation. The upper bounds are obtained through the use of partial algebras. The lower bounds are either inherited from the equational theory of bounded distributive lattices or obtained through a reduction of a global satisfiability problem for a suitable system of propositional modal (...) logic. (shrink)

This is a study, in two volumes, of one of the longest-standing philosophical problems: the problem of universals. In volume I David Armstrong surveys and criticizes the main approaches and solutions to the problems that have been canvassed, rejecting the various forms of nominalism and 'Platonic' realism. In volume II he develops an important theory of his own, an objective theory of universals based not on linguistic conventions, but on the actual and potential findings of natural science. He (...) thus reconciles a realism about qualities and relations with an empiricist epistemology. The theory allows, too, for a convincing explanation of natural laws as relations between these universals. (shrink)

A logical space is a pair of a non-empty set A and a subset of . Since is identified with {0, 1} A and {0, 1} is a typical lattice, a pair of a non-empty set A and a subset of for a certain lattice is also called a -valued functional logical space. A deduction system on A is a pair (R, D) of a subset D of A and a relation R between A* and A. In terms of these (...) simplest concepts, a general framework for studying the logical completeness is constructed. (shrink)

In this paper we show that some standard topological constructions may be fruitfully used in the theory of closure spaces (see [5], [4]). These possibilities are exemplified by the classical theorem on the universality of the Alexandroff's cube for T 0-closure spaces. It turns out that the closure space of all filters in the lattice of all subsets forms a generalized Alexandroff's cube that is universal for T 0-closure spaces. By this theorem we obtain the following characterization of (...) the consequence operator of the classical logic: If is a countable set and C: P() P() is a closure operator on X, then C satisfies the compactness theorem iff the closure space ,C is homeomorphically embeddable in the closure space of the consequence operator of the classical logic.We also prove that for every closure space X with a countable base such that the cardinality of X is not greater than 2 there exists a subset X of irrationals and a subset X of the Cantor's set such that X is both a continuous image of X and a continuous image of X. (shrink)

Universals are putative objects like wisdom, morality, redness, etc. Although we believe in properties (which, we argue, are not a kind of object), we do not believe in universals. However, a number of ordinary, natural language constructions seem to commit us to their existence. In this paper, we provide a fictionalist theory of universals, which allows us to speak as if universals existed, whilst denying that any really do.

Orthomodular lattices with a two-valued Jauch–Piron state split into a generalized orthomodular lattice and its dual. GOMLs are characterized as a class of L-algebras, a quantum structure which arises in the theory of Garside groups, algebraic logic, and in connections with solutions of the quantum Yang–Baxter equation. It is proved that every GOML X embeds into a group G with a lattice structure such that the right multiplications in G are lattice automorphisms. Up to isomorphism, X is uniquely (...) determined by G, and the embedding \\) is a universal group-valued measure on X. (shrink)

Many philosophers have declared that everything which exists is a particular. There is a weak interpretation of this doctrine which I believe to be a true proposition, and a strong one which I believe to be false.

A theory purporting to solve the problem of universals must be able to explain predication, recurrence, and classification. How Platonism does this is well known. Here I take a hard look at an attempt by M.J. Cresswell to give an Aristotelian answer and show it to be a complete and utter failure. The answer does not eliminate commitment to universals and it is only half an answer anyway because it does not cover relational predicates, an omission that Russell noted (...) dooms answers by other philosophers as well. (shrink)

David Lewis famously argued against structural universals since they allegedly required what he called a composition “sui generis” that differed from standard mereological com¬position. In this paper it is shown that, although traditional Boolean mereology does not describe parthood and composition in its full generality, a better and more comprehensive theory is provided by the foundational theory of categories. In this category-theoretical framework a theory of structural universals can be formulated that overcomes the conceptual difficulties that Lewis (...) and his followers regarded as unsurmountable. As a concrete example of structural universals groups are considered in some detail. (shrink)

One of the tasks of ontology in information science is to support the classification of entities according to their kinds and qualities. We hold that to realize this task as far as entities such as material objects are concerned we need to distinguish four kinds of entities: substance particulars, quality particulars, substance universals, and quality universals. These form, so to speak, an ontological square. We present a formal theory of classification based on this idea, including both a semantics for (...) the theory and a provably sound axiomatization. (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)

Several variants of Lewis's Best System Account of Lawhood have been proposed that avoid its commitment to perfectly natural properties. There has been little discussion of the relative merits of these proposals, and little discussion of how one might extend this strategy to provide natural property-free variants of Lewis's other accounts, such as his accounts of duplication, intrinsicality, causation, counterfactuals, and reference. We undertake these projects in this paper. We begin by providing a framework for classifying and assessing the variants (...) of the Best System Account. We then evaluate these proposals, and identify the most promising candidates. We go on to develop a proposal for systematically modifying Lewis's other accounts so that they, too, avoid commitment to perfectly natural properties. We conclude by briefly considering a different route one might take to developing natural property-free versions of Lewis's other accounts, drawing on recent work by Williams. (shrink)

by D. M. Armstrong In the history of the discussion of the problem of universals, G. F. Stout has an honoured, and special. place. For the Nominalist, meaning by that term a philosopher who holds that existence of repeatables - kinds, sorts, type- and the indubitable existence of general terms, is a problem. The Nominalist's opponent, the Realist, escapes the Nominalist's difficulty by postulating universals. He then faces difficulties of his own. Is he to place these universals in a special (...) realm? Or is he to bring them down to earth: perhaps turning them into repeatable properties of particulars, and repeatable relations between universals? Whichever solution he opts for, there are well-known difficulties about how particulars stand to these universals. Under these circumstances the Nominalist may make an important con cession to the Realist, a concession which he can make without abandoning his Nominalism. He may concede that metaphysics ought to recognize that particulars have properties and are related by relations. But, he can maintain, these properties and relations are particulars, not universals. Nor, indeed, is such a position entirely closed to the Realist. A Realist about universals may, and some Realists do, accept particularized properties and relations in addition to universals. As Dr. Seargent shows at the beginning of his book. a doctrine of part icularized properties and relations has led at least a submerged existence from Plato onwards. The special, classical. (shrink)

This book presents the foundations of a general theory of algebras. Often called “universal algebra”, this theory provides a common framework for all algebraic systems, including groups, rings, modules, fields, and lattices. Each chapter is replete with useful illustrations and exercises that solidify the reader's understanding. The book begins by developing the main concepts and working tools of algebras and lattices, and continues with examples of classical algebraic systems like groups, semigroups, monoids, and categories. The (...) essence of the book lies in Chapter 4, which provides not only basic concepts and results of general algebra, but also the perspectives and intuitions shared by practitioners of the field. The book finishes with a study of possible uniqueness of factorizations of an algebra into a direct product of directly indecomposable algebras. There is enough material in this text for a two semester course sequence, but a one semester course could also focus primarily on Chapter 4, with additional topics selected from throughout the text. (shrink)

In his 2000 paper, “Determinables are Universals”, Ingvar Johansson defends a version of immanent realism according to which universals are either lowest determinates, or highest determinables – either maximally specific and exact features (like Red27 or Perfectly Circular) or maximally general respects of similarity (like Colored or Voluminous). On Johansson 2000’s view, there are no intermediate-level determinable universals between the highest and the lowest. Let me call this the Protestant Theory of Determinable Universals, because according to it the humble (...) lowest determinates commune directly with the most high determinables. My question here shall be whether the Protestant theory is not too austere, and whether a more Catholic approach, with a richer hierarchy, is called for. I will be arguing that it may be: between Red27 and Colored, we may need Cardinal Red to intervene. I will here develop several challenges to the Protestant view. Each challenge presents a task that determinable universals should perform if we are going to invoke them at all, but that turns out to be something they can only do if we countenance more of them than the austere Protestant allows. In section one I will consider the task of analyzing resemblance relations, in section two I will consider some tasks to do with causation and the laws of nature, and in section three I will consider the task of making sense of the possibility of continuous change in gunky objects. (shrink)