In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction (n ≥ 2). Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.

In this paper, constructions of free ordered algebras on one generator are given that correspond to some one-variable fragments of affine propositional classical logic and their extensions with n-contraction. Moreover, embeddings of the already known infinite free structures into the algebras introduced below are furnished with; thus, solving along the respective cardinality problems.

The philosophy of mathematics has been accused of paying insufficient attention to mathematical practice: one way to cope with the problem, the one we will follow in this paper on extensive magnitudes, is to combine the `history of ideas' and the `philosophy of models' in a logical and epistemological perspective. The history of ideas allows the reconstruction of the theory of extensive magnitudes as a theory of ordered algebraic structures; the philosophy of models allows an investigation into (...) the way epistemology might affect relevant mathematical notions. The article takes two historical examples as a starting point for the investigation of the role of numerical models in the construction of a system of non-Archimedean magnitudes. A brief exposition of the theories developed by Giuseppe Veronese and by Rodolfo Bettazzi at the end of the 19th century will throw new light on the role played by magnitudes and numbers in the development of the concept of a non-Archimedean order. Different ways of introducing non-Archimedean models will be compared and the influence of epistemological models will be evaluated. Particular attention will be devoted to the comparison between the models that oriented Veronese's and Bettazzi's works and the mathematical theories they developed, but also to the analysis of the way epistemological beliefs affected the concepts of continuity and measurement. (shrink)

Historical work on the emergence of sheaf theory has mainly concentrated on the topological origins of sheaf cohomology in the period from 1945 to 1950 and on subsequent developments. However, a shift of emphasis both in time-scale and disciplinary context can help gain new insight into the emergence of the sheaf concept. This paper concentrates on Henri Cartan’s work in the theory of analytic functions of several complex variables and the strikingly different roles it played at two stages of (...) the emergence of sheaf theory: the definition of a new structure and formulation of a new research programme in 1940–1944; the unexpected integration into sheaf cohomology in 1951–1952. In order to bring this two-stage structural transition into perspective, we will concentrate more specifically on a family of problems, the so-called Cousin problems, from Poincaré (1883) to Cartan. This medium-term narrative provides insight into two more general issues in the history of contemporary mathematics. First, we will focus on the use of problems in theory-making. Second, the history of the design of structures in geometrically flavoured contexts—such as for the sheaf and fibre-bundle structures—which will help provide a more comprehensive view of the structuralist moment, a moment whose algebraic component has so far been the main focus for historical work. (shrink)

The “centre-periphery” relationship historically structured scientific exchanges between metropolis and province, between the fount of empire and its outposts. But the exchange, if regarded merely as a one-way flow of scientific information, ignores both the politics of knowledge and the nature of its appropriation. Arguably, imperial structures do not entirely determine scientific practices and the exchange of knowledge. Several factors neutralise the over-determining influence of politics—and possibly also the normative values of science—on scientific practice.In examining these four examples of (...) Indian scientists in encounters with their peers at the centre, exceptional scientists are seen in a social context where the epistemology of science supposedly describes its practice. Imperialism imposes practices and patronage, which moderate the exchange of scientific knowledge. But, at Level Two, the politics of knowledge and the patterns of patronage within it mediate exchanges between the centre and the periphery.The first step in reconfiguring exchanges between centre and periphery —in this case, between Europe and India during the period 1850 to 1930— is to recognise the relation between the acquisition of resources and the maintenance of legitimacy and identity.67 Political life is not confined to the core of political institutions.68 Second, in examining science as practised in the colonies, it is necessary to see stages of scientific institutions, whose development structures the exchange.From the encounter of Ramchandra and De Morgan, it is evident that the centre-periphery framework should be separated from the models of transmission embedded within it. The notion of “translation” helps to suggest that scientists bring personal motives and meanings to each encounter. Ramchandra, for example, sought a novel method of teaching Indians calculus, while De Morgan's interest lay in finding a place for algebra in a liberal education.The hierarchy inherent in the centre-periphery framework compels the conclusion that, at Level Two, the autodidact outside the institutions of science must have his work presented to scientists at the centre by authoritative figures from the centre. This is not mainly a question of imperialism, but rather of patronage. The peripheral scientist could not be granted direct entry into the collegial circle until his efforts at the periphery could be translated into the language and concerns of the central community. Ramanujan's enigmatic formulas were translated into the language of analysis by Hardy, which enabled the creation of a field to which Hardy was committed. Scientists from the periphery who were already part of the circle by virtue of their training, were not necessarily subject to the same degree of attestation as other scientists from the periphery. P.C. Ray, with his DSc from Edinburgh, and his position at Calcutta University, had less difficulty in winning the trust of colleagues at the centre, even when he returned to India. On the contrary, remaining at the periphery, he moved from a context of patronage to a sphere of competition. In addition, Ray's collegiality, even at Level Two, was more comprehensive, and connected him with Level One.Eventually, the professional Indian science graduate found collegiality within the international community of scientists. Saha's self-imposed progressive nationalism constrained his identification with the centre and made him a potential competitor instead. Once having achieved eminence in the world of science, C.V. Raman and Saha shifted their work to journals of physics published in India in order to further the cause of physics research in their own country.69To go beyond the limitations of the centre-periphery model, it is necessary not merely to examine exchanges between scientists functioning in a “shared epistemological universe”,70 but also to recognise the part played by institutions, the experience of colonialism, and the forms of patronage characterising both colonialism and science. Put another way, although there is relative epistemological autonomy within the disciplinary research communities of science, the interplay between knowledge and power structures this exchange.The scientific links between colonial India and Britain at the turn of the century were mediated by structures which prefigured change. Does structure determine all? If it does, we are left with an Orientalist reconstruction of the docile native, and a passive cultural medium into which science percolates. But this neglects the role of scientists in creating new structures within which they worked. A middle position—one more sensitive to the exigencies of colonial scientific life—would be one where the participants are seen not as the dupes of “structure nor the potentates of action”, but as occupying a ground between the two.71. (shrink)

This paper aims to clarify Merleau-Ponty’s contribution to an embodied-enactive account of mathematical cognition. I first identify the main points of interest in the current discussions of embodied higher cognition and explain how they relate to Merleau-Ponty and his sources, in particular Husserl’s late works. Subsequently, I explain these convergences in greater detail by more specifically discussing the domains of geometry and algebra and by clarifying the role of gestalt psychology in Merleau-Ponty’s account. Beyond that, I explain how, for Merleau-Ponty, (...) mathematical cognition requires not only the presence and actual manipulation of some concrete perceptible symbols but, more strongly, how it is fundamentally linked to the structural transformation of the concrete configurations of symbolic systems to which these symbols appertain. Furthemore, I fill a gap in the literature by explaining Merleau-Ponty’s claim that these structural transformations are operated through motor intentionality. This makes it possible, in turn, to contrast Merleau-Ponty’s approach to ontologically idealistic and realistic views on mathematical objects. On Merleau-Ponty’s account, mathematical objects are relational entities, that is, gestalts that necessarily imply situated cognizers to whom they afford a specific type of engagement in the world and on whom they depend in their eventual structural transformations. I argue that, by attributing a strongly constitutive role to phenomenal configurations and their motor transformation in mathematical thinking, Merleau-Ponty contributes to clarifying the worldly, historical, and socio-cultural aspects of mathematical truths without compromising what we perceive as their universality, certainty, and necessity. (shrink)

This article presents and compares various algebraic structures that arise in axiomatic unsharp quantum physics. We begin by stating some basic principles that such an algebraic structure should encompass. Following G. Mackey and G. Ludwig, we first consider a minimal state-effect-probability (minimal SEFP) structure. In order to include partial operations of sum and difference, an additional axiom is postulated and a SEFP structure is obtained. It is then shown that a SEFP structure is equivalent to an effect (...) algebra with an order determining set of states. We also consider σ-SEFP structures and show that these structures distinguish Hilbert space from incomplete inner product spaces. Various types of sharpness are discussed and under what conditions a Brouwer complementation can be defined to obtain a BZ-poset is investigated. In this case it is shown that every effect has a best lower and upper sharp approximation and that the set of all Brouwer sharp effects form an orthoalgebra. (shrink)

Based on the paper [4] we show that true second‐order arithmetic is interpretable over the real‐algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras.

We show that true first-order arithmetic of the positive integers is interpretable over the real-algebraic structure of Scott's topological model for intuitionistic analysis. From this the undecidability of the structure follows.

We investigate the polynomial time isomorphic type structure of (the class of tally, polynomial time computable sets). We partition P T into six parts: D −, D^ − , C, S, F, F^, and study their p-isomorphic properties separately. The structures of , , and are obvious, where F, F^, and C are the class of tally finite sets, the class of tally co-finite sets, and the class of tally bi-dense sets respectively. The following results for the structures (...) of and will be proved, where D^ is the class of tally, co-dense, polynomial time computable sets and S is the class of tally, scatted (i.e., neither dense nor co-dense), polynomial time computable sets. 1. is a countable distributive lattice with the greatest element. 2. Infinitely many intervals in can be distinguished by first order formulas. 3. There exist infinitely many nontrivial automorphisms for . 4. is not distributive, but any interval in is a countable distributive lattice. RID=""ID="" Mathematics Subject Classification (2000): 03D15, 03D25, 03D30, 03D35, 06A06, 06B20 RID=""ID="" Key words or phrases: Computational complexity – Polynomial time – Degree structure – Lattice – Isomorphism RID=""ID="" Part of this work was done when the author was a PhD student at the University of Heidelberg under the direction of Professor Ambos-Spies. (shrink)

Intra-molecular connectivity (that is, chemical structure) does not emerge from computations based on fundamental quantum-mechanical principles. In order to compute molecular electronic energies (of C 3 H 4 hydrocarbons, for instance) quantum chemists must insert intra-molecular connectivity “by hand.” Some take this as an indication that chemistry cannot be reduced to physics: others consider it as evidence that quantum chemistry needs new logical foundations. Such discussions are generally synchronic rather than diachronic —that is, they neglect ‘historical’ aspects. However, systems (...) of interest to chemists generally are metastable . In many cases chemical systems of a given elemental composition may exist in any one of several different metastable states depending on the history of the system. Molecular structure generally depends on contingent historical circumstances of synthesis and separation, rather than solely or mainly on relative energies of alternative stable states, those energies in turn determined by relationships among components. Chemical structure is usually ‘kinetically-determined’ rather than ‘thermodynamically-determined.’ For instance, cyclical hydrocarbon ring-systems (as in cyclopropene) are produced only in special circumstances. Adequate theoretical treatments must take account of the persistent effects of such contingent historical events whenever they are relevant—as they generally are in chemistry. (shrink)

This paper is an abstract of the report which was presented on the Polish-Soviet meeting on logic . It is shown that one can consider a lineary-ordered Heyting’s and Brouwer’s algebras as truth-values for Lukasiewicz’s infinite-valued logic’s Lω.

We present a systematic study of join-extensions and join-completions of partially ordered algebras, which naturally leads to a refined and simplified treatment of fundamental results and constructions in the theory of ordered structures ranging from properties of the Dedekind–MacNeille completion to the proof of the finite embeddability property for a number of varieties of lattice-ordered algebras.

As Classical Propositional Logic finds its algebraic counterpart in Boolean algebras, the logic of Quantum Mechanics, as outlined within G. Birkhoff and J. von Neumann’s approach to Quantum Theory (Birkhoff and von Neumann in Ann Math 37:823–843, 1936) [see also (Husimi in I Proc Phys-Math Soc Japan 19:766–789, 1937)] finds its algebraic alter ego in orthomodular lattices. However, this logic does not incorporate time dimension although it is apparent that the propositions occurring in the logic of Quantum Mechanics (...) are depending on time. The aim of the present paper is to show that tense operators can be introduced in every logic based on a complete lattice, in particular in the logic of quantum mechanics based on a complete orthomodular lattice. If the time set is given together with a preference relation, we introduce tense operators in a purely algebraic way. We derive several important properties of such operators, in particular we show that they form dynamic pairs and, altogether, a dynamic algebra. We investigate connections of these operators with logical connectives conjunction and implication derived from Sasaki projections in an orthomodular lattice. Then we solve the converse problem, namely to find for given time set and given tense operators a time preference relation in order that the resulting time frame induces the given operators. We show that the given operators can be obtained as restrictions of operators induced by a suitable extended time frame. (shrink)

We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the learning type InfEx_\iso, consisting of the structures whose isomorphism types can be learned in the limit. We show that a family of structures is InfEx_\iso-learnable if and only if the structures can be distinguished in terms of their \Sigma^2_inf-theories. We apply this characterization to familiar cases and we show the (...) following: there is an infinite learnable family of distributive lattices; no pair of Boolean algebras is learnable; no infinite family of linear orders is learnable. (shrink)

We show that true first-order arithmetic is interpretable over the real-algebraic structure of models of intuitionistic analysis built upon a certain class of complete Heyting algebras. From this the undecidability of the structures follows. We also show that Scott's model is equivalent to true second-order arithmetic. In the appendix we argue that undecidability on the language of ordered rings follows from intuitionistically plausible properties of the real numbers.

In this paper, we recall and study the new type of algebraic structures called Symbolic Plithogenic Algebraic Structures. Their operations are given under the Absorbance Law and the Prevalence Order.

Whenever a structure with a particularly interesting computability-theoretic property is found, it is natural to ask whether similar examples can be found within well-known classes of algebraic structures, such as groups, rings, lattices, and so forth. One way to give positive answers to this question is to adapt the original proof to the new setting. However, this can be an unnecessary duplication of effort, and lacks generality. Another method is to code the original structure into a structure in (...) the given class in a way that is effective enough to preserve the property in which we are interested. In this paper, we show how to transfer a number of computability-theoretic properties from directed graphs to structures in the following classes: symmetric, irreflexive graphs; partial orderings; lattices; rings ; integral domains of arbitrary characteristic; commutative semigroups; and 2-step nilpotent groups. This allows us to show that several theorems about degree spectra of relations on computable structures, nonpreservation of computable categoricity, and degree spectra of structures remain true when we restrict our attention to structures in any of the classes on this list. The codings we present are general enough to be viewed as establishing that the theories mentioned above are computably complete in the sense that, for a wide range of computability-theoretic nonstructure type properties, if there are any examples of structures with such properties then there are such examples that are models of each of these theories. (shrink)

It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (\(\textit{CABA}\)s) taking a set to its power-set and, conversely, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a correspondence induces an equivalence between the opposite category of \(\textbf{Set}\) and the category of \(\textit{CABA}\)s. We modify this result by taking multialgebras over a signature \(\Sigma\), specifically those whose non-deterministic operations cannot return the empty-set, to \(\textit{CABA}\)s with their zero element (...) removed (which we call a \(\textit{bottomless Boolean algebra}\)) equipped with a structure of \(\Sigma\)-algebra compatible with its order (that we call \(\textit{ord-algebras}\)). Conversely, an ord-algebra over \(\Sigma\) is taken to its set of atomic elements equipped with a structure of multialgebra over \(\Sigma\). This leads to an equivalence between the category of \(\Sigma\)-multialgebras and the category of ord-algebras over \(\Sigma\). The intuition, here, is that if one wishes to do so, non-determinism may be replaced by a sufficiently rich ordering of the underlying structures. (shrink)

We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on proof terms and equality predicate on terms. Moreover, the completeness theorem and certain generalizations of Stone’s representation theorem are obtained for all proposed algebras.

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)

Based on the computation mode introduced in [13], we deal with the time complexity of computations over arbitrary first-order structures.The main emphasis is on parameter-free computations. Some transfer results for solutions of P versus NP problems as well as relationships to quantifier elimination are discussed. By computation tree analysis using first-order formulas, it follows that P versus NP solutions and other results of structural complexity theory are invariant under elementary equivalence of structures.

Pseudo-BCK-algebras are a non-commutative generalization of well-known BCK-algebras. The paper describes a situation when a linearly ordered pseudo-BCK-algebra is an ordinal sum of linearly ordered cone algebras. In addition, we present two identities giving such a possibility of the decomposition and axiomatize the residuation subreducts of representable pseudo-hoops and pseudo-BL-algebras.

It has been proposed that the implicate order can be given mathematical expression in terms of an algebra and that this algebra is similar to that used in quantum theory. In this paper we bring out in a simple way those aspects of the algebraic formulation of quantum theory that are most relevant to the implicate order. By using the properties of the standard ket introduced by Dirac we describe in detail how the Heisenberg algebra can be generalized to (...) produce an algebraic structure in which it is possible to describe space translations in a way that is analogous to the description of rotations in a Clifford algebra. This approach opens up the possibility of going beyond the limits of the present quantum formalism and we discuss briefly some of the new implications. (shrink)

We give a construction assigning classes of Boolean algebras to first-order theories; several classes of Boolean algebras considered previously in the literature can be thus obtained. In particular it turns out that the class of semigroup algebras can be defined in this way, in fact by a Horn theory, and it is the largest class of Boolean algebras defined by a Horn theory.

There is an extensive literature related to the algebraization of first‐order logic. But the algebraization of full second‐order logic, or Henkin‐type second‐order logic, has hardly been researched. The question arises: what kind of set algebra is the algebraic version of a Henkin‐type model of second‐order logic? The question is investigated within the framework of the theory of cylindric algebras. The answer is: a kind of cylindric‐relativized diagonal restricted set algebra. And the class of the subdirect products of these set (...) algebras is the algebraization of Henkin‐type second‐order logic. It is proved that the algebraization of a complete calculus of the Henkin‐type second‐order logic is a class of a kind of diagonal restricted cylindric algebras. Furthermore, the connection with the non‐standard enlargements of standard complete second‐order structures is investigated. (shrink)

Hindman’s theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. A Ramsey algebra is a structure that satisfies an analogue of Hindman’s theorem. In this paper, we present the basic notions of Ramsey algebras by using terminology from mathematical logic. We also present some results regarding classification of Ramsey algebras.

Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At(RRA) of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.

We propose a notion of -minimality for partially ordered structures. Then we study -minimal partially ordered structures such that is a Boolean algebra. We prove that they admit prime models over arbitrary subsets and we characterize -categoricity in their setting. Finally, we classify -minimal Boolean algebras as well as -minimal measure spaces.

In Tsuji 1997 the concept of Jeffrey-Keynes algebras was introduced in order to construct a paraconsistent theory of decision under uncertainty. In the present paper we show that these algebras can be used to develop a theory of decision under uncertainty that measures the degree of belief on the quasi (or partial) truth of the propositions. As applications of this new theory of decision, we use it to analyze Popper's paradox of ideal evidence and to indicate a possible way of (...) formalizing Keynes' theory of economic action. (shrink)

This paper discusses the pluralist theory of reparations for historical injustice offered by Daniel Butt (Ethical Theory and Moral Practice 24(5):1161–75, 2021). Butt attempts to vindicate purely past-regarding corrective duties in response to Alasia Nuti’s historical-structural model of reparations. I agree with Butt that reparative justice requires both past-regarding and future-looking structural duties. And I agree with him that Nuti’s model leaves out purely past-regarding duties. I argue, however, that Butt does not offer a genuinely pluralist account. I (...) present minimal necessary conditions for past-regarding (corrective) justice and demonstrate that the past-regarding duties Butt advocates do not meet these conditions. The past-regarding duties Butt offers collapse into the kinds of distributive (structural) duties from which he attempts to separate them. Yet, I suggest these shortcomings are instructive and sketch a path forward for a genuinely pluralist account of reparations. A genuinely pluralist account must follow this path in order to vindicate the intuitions that motivate both past-regarding duties and the structural injustice model. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:BOOK REVIEWS 151 highly conscientious translator, and a sign of this are the Latin-English and English-Latin glossaries that are appended at the end of the work. The glossaries show how he has tried to remain consistent in his choice of terms and how he decided to render difficult terms like ratio and esse, which cause every translator of Aquinas problems. One could complain, however, that these nine pages of (...) glossary are not quite complete enough. A few missing entries, for example, are ' individual ' (which is used to translate concretum, suppositum, individuatum, and particufuris), ' subiectum ' (translated " substance " and " subject "), and' modus'. The briefest of bibliographical notes and an index complete the work. Here one might want to register a more serious complaint. The bibliographical note is much too brief to he especially helpful. The beginner could use some more suggestions about what to read as a follow-up to Martin's hook. All in all, this is a collection of readings from Thomas Aquinas one would like to see stay in print for a long time to come. Many who teach the thought of Aquinas in the round will want to make use of this work. And, by reading this work, philosophy students to whom Aquinas is an unknown will make a good beginning in becoming di· rectly familiar with one of the greatest of minds. ROBERT D. ANDERSON Saint Anselm College Manchester, New Hampshire Being and Order: The Metaphysics of Thomas Aquinas in Historical Perspective. By ANDREW N. WOZNICKI. Catholic Thought from Lublin. New York: Peter Lang, 1990. Pp. 309 + xiv. This first volume bodes well for the new series Catholic Thought from Lublin, because the author of the hook is also the general editor of the series. Father Woznicki has here produced a welcome addition to those worthwhile hooks exploring the philosophical vision of St. Thomas in depth and comparing and contrasting that vision with other philosophical outlooks. Such studies are important not just for Thomists hut for all who are interested in the thought of the Angelic Doctor. On the first page of his Foreword, Woznicki announces that being and order are so inextricably interrelated that it is absolutely impos· sihle to understand one without the other. With thorough scholarship and impressive depth, Woznicki hacks up his claim. The Foreword also includes Etienne Gilson's marvelous statement: "Metaphysics al- 152 BOOK REVIEWS ways buries its undertakers." Not only does Woznicki probe profoundly into St. Thomas's metaphysics but he shows with an enviable clarity what is metaphysically lacking in philosophies as diverse as those of Duns Scotus, William of Ockham, Descartes, Kant, and Whitehead. Woznicki's goal in this well documented study is to discover the order present in the very structure of being as being. In examining the concept of being itself, he claims that being can reveal itself in its inner disposition of both essential and existential characteristics only as something in which essence and existence are related to each other reciprocally and mutually. The Lublin Thomist distinguishes the predicamental and the transcendental modes of predication. While in the predicamental mode of predication a predicate is added to a being as its determining principle, in the transcendental mode of predication nothing can be added to a being as an extraneous nature, in the way that an accident is added to a substance or that a difference is added to a genus. (These additions cannot take place because every nature is essentially being.) The distinction between the two modes of predication permit the formulation of two kinds of concepts, namely, the predicamental and the transcendental. The former describe various grades of being which match different modes of being and so reveal.the various genera of being; the latter in depicting being in its universality express more clearly what is contained in the nature of being as such. A predicamental order of being is established through the predicamental concepts' description of being by its essential characteristics ; a transcendental order of being is established through the transcendental concepts' description of being as expressed by the existential characteristics of esse. While in the predicamental order the emphasis on the essential aspects reveals being as it is expressed in... (shrink)

We characterize Δ20-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures.

The main purpose of this paper is to introduce a class of algebraic structures related to many-valued ukasiewicz algebras. They are symmetrical Heyting algebras with a set of modal operators indexed by a finite completely symmetric poset. A representation theorem is given for these (not functionally complete) algebras.

This paper suggests an epistemic interpretation of Belnap’s branching space-times theory based on Everett’s relative state formulation of the measurement operation in quantum mechanics. The informational branching models of the universe are evolving structures defined from a partial ordering relation on the set of memory states of the impersonal observer. The totally ordered set of their information contents defines a linear “time” scale to which the decoherent alternative histories of the informational universe can be referred—which is quite necessary (...) for assigning them a probability distribution. The “historical” state of a physical system is represented in an appropriate extended Hilbert space and an algebra of multi-branch operators is developed. An age operator computes the informational depth of historical states and its standard deviation can be used to provide a universal information/energy uncertainty relation. An information operator computes the encoding complexity of historical states, the rate of change of its average value accounting for the process of correlation destruction inherent to the branching dynamics. In the informational branching models of the universe, the asymmetry of phenomena in nature appears as a mere consequence of the subject’s activity of measuring, which defines the flow of time-information. (shrink)

A Dedekind Algebra is an ordered pair (B,h) where B is a non-empty set and h is an injective unary function on B. Each Dedekind algebra can be decomposed into a family of disjoint, countable subalgebras called configurations of the Dedekind algebra. There are N0 isomorphism types of configurations. Each Dedekind algebra is associated with a cardinal-valued function on omega called its configuration signature. The configuration signature of a Dedekind algebra counts the number of configurations in the decomposition of (...) the algebra in each isomorphism type.The configuration signature of a Dedekind algebra encodes the structure of that algebra in the sense that two Dedekind algebras are isomorphic iff their configuration signatures are identical. Configuration signatures are used to establish various results in the first-order model theory of Dedekind algebras. These include categoricity results for the first-order theories of Dedekind algebras and existence and uniqueness results for homogeneous, universal and saturated Dedekind algebras. Fundamental to these results is a condition on configuration signatures that is necessary and sufficient for elementary equivalence. (shrink)

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough (...) description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory. (shrink)

The algebraic structure of the 8-spinor formalism is discussed, and the general form of the 8-component wave equation, equivalent to the second-order 4-component one, is presented. This allows a canonical formulation that will be the first stage of the future Clebsch parametrization, i.e., a relativistic generalization of the Bohm-Schiller-Tiomno pioneering work on the Pauli equation.

We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to (...) structures having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence). (shrink)

In the present paper we study how subsystems of a normative system can be combined, and the role of such combinations for the understanding of hypothetical legal consequences. A combination of two subsystems is often accomplished by a normative correlation or an intermediate concept. To obtain a detailed analysis of such phenomena we use an algebraic framework. Normative systems are represented as algebraic structures over sets of conditions. This representation makes it possible to study normative systems using (...) an extension of the theory of Boolean algebras, called the theory of Boolean quasi‐orderings. (shrink)

The paper presents a formal model of the system of number representations as a multiplicity of mental number axes with a hierarchical structure. The hierarchy is determined by the mind as it acquires successive types of mental number axes generated by virtue of some algebraic mechanisms. Three types of algebraic structures, responsible for functioning these mechanisms, are distinguished: BASAN-structures, CASAN-structures and CAPPAN-structures. A foundational order holds between these structures. CAPPAN-structures are derivative from (...) CASAN-structures which are extensions of BASAN-structures. The constructed formal model unifies two competitive conceptions of cognitive arithmetic: namely, the conception of the mental number line and the conception of parallel individuation. The paper is the continuation of a paper entitled Representational structures of arithmetical thinking, in which rich empirical evidence supporting the model is presented. The main result achieved in the present paper may be philosophically interpreted as an attempt to formalize the Kantian conception of the pure idea of time, understood as the a priori form of human arithmetical thinking. In this way, our theory may be comprehended as a result of applying the hard method of logical reconstruction of fundamental epistemological categories. (shrink)

We prove that the equational theory of a semigroups becomes undecidable if we add a semilattice structure with a ‘touch of symmetric difference’. As a corollary we obtain that the variety of all Boolean algebras with an associative binary operator has a ‘hereditarily’ undecidable equational theory. Our results have implications in logic, e.g. they imply undecidability of modal logics extending the Lambek Calculus and undecidability of Arrow Logics with an associative arrow modality.

Let (M, ≤,...) denote a Boolean ordered o-minimal structure. We prove that a Boolean subalgebra of M determined by an algebraically closed subset contains no dense atoms. We show that Boolean algebras with finitely many atoms do not admit proper expansions with o-minimal theory. The proof involves decomposition of any definable set into finitely many pairwise disjoint cells, i.e., definable sets of an especially simple nature. This leads to the conclusion that Boolean ordered structures with o-minimal theories (...) are essentially bidefinable with Boolean algebras with finitely many atoms, expanded by naming constants. We also discuss the problem of existence of proper o-minimal expansions of Boolean algebras. (shrink)

In this paper we analyze some aspects of the question of using methods from model theory to study structures of functional analysis.By a well known result of P. Lindström, one cannot extend the expressive power of first order logic and yet preserve its most outstanding model theoretic characteristics (e.g., compactness and the Löwenheim-Skolem theorem). However, one may consider extending the scope of first order in a different sense, specifically, by expanding the class of structures that are regarded as (...) models (e.g., including Banach algebras or other structures of functional analysis), and ask whether the resulting extensions of first order model theory preserve some of its desirable characteristics.A formal framework for the study of structures based on Banach spaces from the perspective of model theory was first introduced by C. W. Henson in [8] and [6]. Notions of syntax and semantics for these structures were defined, and it was shown that using them one obtains a model theoretic apparatus that satisfies many of the fundamental properties of first order model theory. For instance, one has compactness, Löwenheim-Skolem, and omitting types theorems. Further aspects of the theory, namely, the fundamentals of stability and forking, were first introduced in [10] and [9].The classes of mathematical structures formally encompassed by this framework are normed linear spaces, possibly expanded with additional structure,e.g., operations, real-valued relations, and constants. This notion subsumes wide classes of structures from functional analysis. However, the restriction that the universe of a structure be a normed space is not necessary. (This restriction has a historical, rather than technical origin; specifically, the development of the theory was originally motivated by questions in Banach space geometry.) Analogous techniques can be applied if the universe is a metric space. Now, when the underlying metric topology is discrete, the resulting model theory coincides with first order model theory, so this logic extends first order in the sense described above. Furthermore, without any cost in the mathematical complexity, one can also work in multi-sorted contexts, so, for instance, one sort could be an operator algebra while another is. say, a metric space. (shrink)

We prove weak elimination of imaginary elements for Boolean orderings with finitely many atoms. As a consequence we obtain equivalence of the two notions of o-minimality for Boolean ordered structures, introduced by C. Toffalori. We investigate atoms in Boolean algebras induced by algebraically closed subsets of Boolean ordered structures. We prove uniqueness of prime models in strongly o-minimal theories of Boolean ordered structures.

Let \({\mathcal {R}}\) be a polynomially bounded o-minimal expansion of the real field. Let _f_(_z_) be a transcendental entire function of finite order \(\rho \) and type \(\sigma \in [0,\infty ]\). The main purpose of this paper is to show that if ( \(\rho ) or ( \(\rho =1\) and \(\sigma =0\) ), the restriction of _f_(_z_) to the real axis is not definable in \({\mathcal {R}}\). Furthermore, we give a generalization of this result for any \(\rho \in [0,\infty )\).

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

A D-algebra is a generalization of a D-poset in which a partial order is not assumed. However, if a D-algebra is equipped with a natural partial order, then it becomes a D-poset. It is shown that D-algebras and effect algebras are equivalent algebraic structures. This places the partial operation ⊝ for a D-algebra on an equal footing with the partial operation ⊕ for an effect algebra. An axiomatic structure called an effect stale-space is introduced. Such spaces provide an (...) operational interpretation for the partial operations ⊕ and ⊝. Finally, a relationship between effect-state spaces and torsion free interval effect algebras is demonstrated. (shrink)