IMTL logic was introduced in [12] as a generalization of the infinitely-valued logic of Lukasiewicz, and in [11] it was proved to be the logic of left-continuous t-norms with an involutive negation and their residua. The structure of such t-norms is still not known. Nevertheless, Jenei introduced in [20] a new way to obtain rotation-invariant semigroups and, in particular, IMTL-algebras and left-continuous t-norm with an involutive negation, by means of the disconnected rotation method. In order to give an algebraic (...) interpretation to this construction, we generalize the concepts of perfect, bipartite and local algebra used in the classification of MV-algebras to the wider variety of IMTL-algebras and we prove that perfect algebras are exactly those algebras obtained from a prelinear semihoop by Jenei's disconnected rotation. We also prove that the variety generated by all perfect IMTL-algebras is the variety of the IMTL-algebras that are bipartite by every maximal filter and we give equational axiomatizations for it. (shrink)

In this paper we prove that the category of abelian l-groups is equivalent to the category of perfect MV-algebras. Furthermore, we give a finite equational axiomatization of the variety generated by perfect MV-algebras.

In this paper we prove that the category of abelianl-groups is equivalent to the category of perfect MV-algebras. Furthermore, we give a finite equational axiomatization of the variety generated by perfect MV-algebras.

We study perfect effect algebras, that is, effect algebras with the Riesz decomposition property where every element belongs either to its radical or to its co-radical. We define perfect effect algebras with principal radical and we show that the category of such effect algebras is categorically equivalent to the category of unital po-groups with interpolation. We introduce an observable on a \-monotone \-complete perfect effect algebra with principal radical and we show that observables (...) are in a one-to-one correspondence with spectral resolutions of observables. (shrink)

ABSTRACT In this paper we shall prove that l-rings are categorally equivalent to the MV*-algebras, a subcategory of perfect MV-algebras. We shall use this equivalence in order to characterize l-rings as quotients of certain semirings of matrices over MV*-algebras. We shall establish a relation between l-ideals in l-rings and some ideals in MV*-algebras. This edlows us to study the MV* f-algebras, a subclass of the MV*-algebras corresponding to the f-rings.

In [9] Mundici introduced a categorical equivalence Γ between the category of MV-algebras and the category of abelian [MATHEMATICAL SCRIPT SMALL L]-groups with strong unit. Using Mundici's functor Γ, in [8] the authors established an equivalence between the category of perfect MV-algebras and the category of abelian [MATHEMATICAL SCRIPT SMALL L]-groups. Aim of the present paper is to use the above functors to provide Yosida like representations of a large class of MV-algebras.

We establish, generalizing Di Nola and Lettieri’s categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classifying topos, three levels of bi-interpretability holding for particular classes of formulas: irreducible formulas, geometric sentences, and imaginaries. Lastly, by investigating the classifying topos of the theory of perfect MV-algebras, (...) we obtain various results on its syntax and semantics also in relation to the cartesian theory of the variety generated by Chang’s MV-algebra, including a concrete representation for the finitely presentable models of the latter theory as finite products of finitely presentable perfect MV-algebras. Among the results established on the way, we mention a Morita-equivalence between the theory of lattice-ordered abelian groups and that of cancellative lattice-ordered abelian monoids with bottom element. (shrink)

An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \mathop{\boldsymbol {\bigwedge }}\limits p = q$. For a logic L algebraized by a quasivariety $\mathcal {Q}$ we show that the AE-subclasses of $\mathcal {Q}$ correspond to certain natural expansions of L, which we call algebraic expansions. These turn out to be a special case of the expansions by implicit connectives studied by X. Caicedo. We proceed to characterize all the AE-subclasses of (...) abelian $\ell $ -groups and perfect MV-algebras, thus fully describing the algebraic expansions of their associated logics. (shrink)

We prove that the property characterizes Σ‐algebraically compact modules if is not ω‐measurable. Moreover, under a large cardinal assumption, we show that over any ring R where is not ω‐measurable, any free module M of ω‐measurable rank satisfies, hence the assumption on cannot be dropped in general (e.g., over small non‐right perfect rings). In this way, we extend results from a recent paper by Simion Breaz.

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected with partially ordered groups not necessarily with strong unit. In such a case, starting even with an Abelian po-group, we can obtain a noncommutative pseudo effect algebra. We show how such kite pseudo effect algebras are tied with different types of the Riesz Decomposition Properties. Kites are so-called perfect pseudo effect algebras, and we define conditions when kite pseudo (...) effect algebras have the least non-trivial normal ideal. (shrink)

Denef and Loeser defined a map from the Grothendieck ring of sets definable in pseudo-finite fields to the Grothendieck ring of Chow motives, thus enabling to apply any cohomological invariant to these sets. We generalize this to perfect, pseudo algebraically closed fields with pro-cyclic Galois group. In addition, we define some maps between different Grothendieck rings of definable sets which provide additional information, not contained in the associated motive. In particular we infer that the map of Denef-Loeser is not (...) injective. (shrink)

No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic framework. We define a universal \ -imperfect cloning operation which tolerates a finite loss \ of fidelity in the cloned state, and show that an individual system’s algebra of observables is abelian if and only if there is a universal \ -imperfect cloning (...) operation in the case where the loss of fidelity is less than \ . Therefore in this case no universal \ -imperfect cloning operation is possible in algebraic quantum theory. (shrink)

We initiate a study of two general concepts of semisimplicity for MV-algebras by replacing the standard MV-algebra with an arbitrary MV-chain. These generalised notions are called -semisimple MV-algebras and -semisimple MV-algebras. We obtain several of their characterisations and explore in more-depth the case of perfect MV-chains.

We present the logic BLChang, an axiomatic extension of BL (see [23]) whose corresponding algebras form the smallest variety containing all the ordinal sums of perfect MV-chains. We will analyze this logic and the corresponding algebraic semantics in the propositional and in the first-order case. As we will see, moreover, the variety of BLChang-algebras will be strictly connected to the one generated by Chang’s MV-algebra (that is, the variety generated by all the perfect MV-algebras): we (...) will also give some new results concerning these last structures and their logic. (shrink)

In this paper the following theorem is proved regarding groups of finite Morley rank which are perfect central extensions of quasisimple algebraic groups.Theorem1.Let G be a perfect group of finite Morley rank and let C0be a definable central subgroup of G such that G/C0is a universal linear algebraic group over an algebraically closed field; that is G is a perfect central extension of finite Morley rank of a universal linear algebraic group. Then C0= 1.Contrary to an impression (...) which exists in some circles, the center of the universal extension of a simple algebraic group, as an abstract group, is not finite in general. Thus the finite Morley rank assumption cannot be omitted.Corollary1.Let G be a perfect group of finite Morley rank such that G/Z(G) is a quasisimple algebraic group. Then G is an algebraic group. In particular, Z(G) is finite([4],Section27.5).An understanding of central extensions of quasisimple linear algebraic groups which are groups of finite Morley rank is necessary for the classification oftamesimpleK*-groupsof finite Morley rank, which constitutes an approach to the Cherlin-Zil’ber conjecture. For this reason the theorem above and its corollary were proven in [1] (Theorems 4.1 and 4.2) under the assumption oftameness, which simplifies the argument considerably. The result of the present paper shows that this assumption can be dropped. The main line of argument is parallel to that in [1]; the absence of the tameness assumption will be countered by a model-theoretic result and results fromK-theory. The model-theoretic result places limitations on definability in stable fields, and may possibly be relevant to eliminating certain other uses of tameness. (shrink)

The study of perfect, local and bipartite IMTL-algebras presented in [29] is generalized in this paper to the general non-involutive case, i.e. to MTL-algebras. To this end we describe the radical of MTL-algebras and characterize perfect MTL-algebras as those for which the quotient by the radical is isomorphic to the two-element Boolean algebra, and a special class of bipartite MTL-algebras,.

For given Boolean algebras$\mathbb {A}$and$\mathbb {B}$we endow the space$\mathcal {H}(\mathbb {A},\mathbb {B})$of all Boolean homomorphisms from$\mathbb {A}$to$\mathbb {B}$with various topologies and study convergence properties of sequences in$\mathcal {H}(\mathbb {A},\mathbb {B})$. We are in particular interested in the situation when$\mathbb {B}$is a measure algebra as in this case we obtain a natural tool for studying topological convergence properties of sequences of ultrafilters on$\mathbb {A}$in random extensions of the set-theoretical universe. This appears to have strong connections with Dow and Fremlin’s result (...) stating that there are Efimov spaces in the random model. We also investigate relations between topologies on$\mathcal {H}(\mathbb {A},\mathbb {B})$for a Boolean algebra$\mathbb {B}$carrying a strictly positive measure and convergence properties of sequences of measures on$\mathbb {A}$. (shrink)

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

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

The study of the temporal structure of events in natural language is of prime importance in linguistics. Though there has been recent progress on formal theories of events, these theories do not address certain syntactic and semantic properties peculiar to languages such as Hindi. This paper concentrates on properties related to perfectivity. It motivates a small number of semantic features for events and their objects, such as whether an object exists independently of an event, whether it is totally affected by (...) the event, and so on. It then formalizes these features. It also shows how they can be formalized in an algebraic framework and applied in a categorial grammar to derive the properties of verbal and nominal predicates. The result is an integration of descriptive semantics with algebraic theories of objects and events. (shrink)

We look at a hierarchical arrangement of ideals in an MV -algebra. The principal classes of ideals studied are the maximals, the primes, the local and perfect ideals and the semi-locals. Beyond these special classes of ideals are the general ideals. Herein we study some relationships among these classes and, more specifically, the products of ideals of these classes. Among the results obtained are the square of a prime ideal is a local ideal, the finite product of prime ideals (...) is a semilocal ideal. We also show that the set of local ideals shares many of the properties of the class of prime ideals, as the Lying Over Theorem and the Going Up Theorem. (shrink)

The majority of studies on natural resources management in both developed and developing countries are silent on the issue of analysis of corruption – or they treat it tangentially, as an annoying anomaly, or simply deviance from the rules. As a result, the issue has hardly been subjected to in-depth characterisation or reforms. This study employed and integrated mainstream principal-agent theory and more recently developed collective action theory to enhance our understanding – in different but complementary ways − of the (...) socio-political underpinnings of corruption. A supposed ‘best case’ participatory forest management scheme in Tanzania reveals significant forest-related corrupt undertakings, which led to forest encroachment in the form of charcoal and timber exploitation. The findings point to contextual grounds for corruption, namely: undermined assumptions of the mainstream principal-agent institutions; the presence of alternative informal principal-agent institutions; the presence of immediate and substantial benefits that flow to such alternative institutions; and the huge market demands for their forest products and services. Through such a nuanced approach that blends the two above-mentioned theories in meaningful ways, more appropriate options for policy formulation and implementation are proposed. (shrink)

We live in an ageing society, where people are living longer, and where decreases in the birth rate mean that the proportion of the population above retirement age is steadily increasing. An ageing population has considerable implications for health services and care provision. Consequently there is a growing interest among researchers, medical practitioners, and policy makers in older adults, their capabilities, and the changes in their cognitive functioning. This book offers an up-to-the-minute account of the latest methodological and theoretical issues (...) in cognitive ageing. Part of the Debates in Psychology series, it sets out the arguments surrounding the currently controversial questions in cognitive ageing. What is the appropriate methodology for understanding cognitive change? How many factors are necessary to understand the patterns of age-related change? What might these factors be? The topics and arguments are explored in a series of chapters by the leading researchers in the field. Each contributor offers their view of how cognitive ageing can be best understood, and together they cover a broad range of cognitive functions including language use, cognitive slowing, and memory loss. Each of the chapters stands alone as the latest review of work in the area. Taken together, the chapters form a coherent theoretical debate through which the reader will learn about the dynamic nature of cognitive ageing research, and about the direction this research will be taking in the future. Models of Cognitive Aging will be an invaluable resource for anyone with an interest in the elderly, and in their cognitive abilities. (shrink)

"De interpretatione" from Aristoteles. Aristotle (384-322 BCE) was a Greek philosopher born in Greece.

As the first full-length book dedicated to the philosophical legacy of Hans Jonas, The Integrity of Thinking is largely dedicated to summarizing and integrating the diverse phases in Jonas’ lifework. But the book has another, more ambitious goal. David Levy attempts to demonstrate that Hans Jonas is, for matters of public policy, nothing less than the most important philosopher of the twentieth century. This alleged importance stems from his unique philosophical achievements and their manifold practical applications. According to Levy, Jonas’ (...) massive future importance will not be constrained to philosophy. Levy makes a series of admittedly “bold claims” regarding Jonas’ significance, culminating in the claim that he is “perhaps the pre-eminent practical thinker of our time”. This is excessive praise for a thinker who is still a relatively minor figure in twentieth-century philosophy, and who is still somewhat unknown by non-specialists outside his native Germany. Yet Levy hopes that the heightened public awareness of tensions between technology and ethics will create an audience for the thinker who has most successfully probed the origins of those tensions. Levy wishes to disseminate Jonas’ practical importance to a wider audience. But does Jonas merit these excessive claims, and therefore a wider audience? (shrink)

As the first full-length book dedicated to the philosophical legacy of Hans Jonas, The Integrity of Thinking is largely dedicated to summarizing and integrating the diverse phases in Jonas’ lifework. But the book has another, more ambitious goal. David Levy attempts to demonstrate that Hans Jonas is, for matters of public policy, nothing less than the most important philosopher of the twentieth century. This alleged importance stems from his unique philosophical achievements and their manifold practical applications. According to Levy, Jonas’ (...) massive future importance will not be constrained to philosophy. Levy makes a series of admittedly “bold claims” regarding Jonas’ significance, culminating in the claim that he is “perhaps the pre-eminent practical thinker of our time”. This is excessive praise for a thinker who is still a relatively minor figure in twentieth-century philosophy, and who is still somewhat unknown by non-specialists outside his native Germany. Yet Levy hopes that the heightened public awareness of tensions between technology and ethics will create an audience for the thinker who has most successfully probed the origins of those tensions. Levy wishes to disseminate Jonas’ practical importance to a wider audience. But does Jonas merit these excessive claims, and therefore a wider audience? (shrink)

"De unitate intellectus contra Averroistas" from Thomas Aquinas. Thomas Aquinas (1225-1274), sanctus, doctor Ecclesiae catholicae, theologus italianus et philosophus mediaevalis.

This article examines two cases that present ethical challenges encountered by social workers in making decisions either to maintain professional boundaries or fulfil moral obligations while working with service users in vulnerable situations. In the first case, a Lebanese social worker narrates how she was motivated to step out of her official responsibilities to assist a refugee mother of three who showed suicidal ideation. In the second case, a Ugandan social worker recounts her experience while working with a family whose (...) 12-year-old daughter was raped and became pregnant, but whose parents refused to accept abortion when medical diagnosis showed that the girl’s life was in danger. A commentary from the authors is provided after each case. Both social workers were arguably motivated to act based on their concern to care for people, protect human rights, and save lives in the two case scenarios. This underscores the relevance of the ethics of care and virtue ethics in describing the associated ethical challenges in both cases. Furthermore, the dynamic nature of the ethical challenges encountered by the social workers demands open minds and flexibility in decision-making. (shrink)

These lectures on logic, more specifically proof theory, are basically intended for postgraduate students and researchers in logic. The question at stake is the nature of mathematical knowledge and the difference between a question and an answer, i.e., the implicit and the explicit. The problem is delicate mathematically and philosophically as well: the relation between a question and its answer is a sort of equality where one side is ``more equal than the other'': one thus discovers essentialist blind spots. Starting (...) with Godel's paradox --so to speak, the incompleteness of answers with respect to questions--the book proceeds with paradigms inherited from Gentzen's cut-elimination. Various settings are studied: sequent calculus, natural deduction, lambda calculi, category-theoretic composition, up to geometry of interaction, all devoted to explicitation, which eventually amounts to inverting an operator in a von Neumann algebra. Mathematical language is usually described as referring to a preexisting reality. Logical operations can be given an alternative procedural meaning: typically, the operators involved in GoI are invertible, not because they are constructed according to the book, but because logical rules are those ensuring invertibility. Similarly, the durability of truth should not be taken for granted: one should distinguish between imperfect and perfect modes. The procedural explanation of the infinite thus identifies it with the unfinished, i.e., the perennial. But is perenniality perennial? This questioning yields a possible logical explanation for algorithmic complexity. This highly original course on logic by one of the world's leading proof theorists challenges mathematicians, computer scientists, physicists, and philosophers to rethink their views and concepts on the nature of mathematical knowledge in an exceptionally profound way. (shrink)

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Ploščica. The standard representations of complete ortholattices and complete perfect Heyting algebras drop out as special cases of the first representation, while the second covers arbitrary complete lattices, as well as complete lattices equipped with a negation we call a protocomplementation. The third topological representation is a variant of that of Craig, Haviar, and Priestley. (...) We then extend each of the three representations to lattices with a multiplicative unary modality; the representing structures, like so-called graph-based frames, add a second relation of accessibility interacting with compatibility. The three representations generalize possibility semantics for classical modal logics to non-classical modal logics, motivated by a recent application of modal orthologic to natural language semantics. (shrink)

We study the role the axiom of choice plays in the existence of some special subsets of ℝ and its power set ℘.

We study perfectly trivial theories, 1-based theories, stable varieties, and their mutual interaction. We give a structure theorem for the models of a complete perfectly trivial stable theory without DOP: any model is the algebraic closure of a nonforking regular tree of elements. We also give a structure theorem for stable varieties, all of whose completions have NDOP. Such a variety is a varietal product of an affine variety and a combinatorial variety of an especially simple form.

Modal logics, originally conceived in philosophy, have recently found many applications in computer science, artificial intelligence, the foundations of mathematics, linguistics and other disciplines. Celebrated for their good computational behaviour, modal logics are used as effective formalisms for talking about time, space, knowledge, beliefs, actions, obligations, provability, etc. However, the nice computational properties can drastically change if we combine some of these formalisms into a many-dimensional system, say, to reason about knowledge bases developing in time or moving objects. To study (...) the computational behaviour of many-dimensional modal logics is the main aim of this book. On the one hand, it is concerned with providing a solid mathematical foundation for this discipline, while on the other hand, it shows that many seemingly different applied many-dimensional systems (e.g., multi-agent systems, description logics with epistemic, temporal and dynamic operators, spatio-temporal logics, etc.) fit in perfectly with this theoretical framework, and so their computational behaviour can be analyzed using the developed machinery. We start with concrete examples of applied one- and many-dimensional modal logics such as temporal, epistemic, dynamic, description, spatial logics, and various combinations of these. Then we develop a mathematical theory for handling a spectrum of 'abstract' combinations of modal logics - fusions and products of modal logics, fragments of first-order modal and temporal logics - focusing on three major problems: decidability, axiomatizability, and computational complexity. Besides the standard methods of modal logic, the technical toolkit includes the method of quasimodels, mosaics, tilings, reductions to monadic second-order logic, algebraic logic techniques. Finally, we apply the developed machinery and obtained results to three case studies from the field of knowledge representation and reasoning: temporal epistemic logics for reasoning about multi-agent systems, modalized description logics for dynamic ontologies, and spatio-temporal logics. The genre of the book can be defined as a research monograph. It brings the reader to the front line of current research in the field by showing both recent achievements and directions of future investigations (in particular, multiple open problems). On the other hand, well-known results from modal and first-order logic are formulated without proofs and supplied with references to accessible sources. The intended audience of this book is logicians as well as those researchers who use logic in computer science and artificial intelligence. More specific application areas are, e.g., knowledge representation and reasoning, in particular, terminological, temporal and spatial reasoning, or reasoning about agents. And we also believe that researchers from certain other disciplines, say, temporal and spatial databases or geographical information systems, will benefit from this book as well. Key Features: Integrated approach to modern modal and temporal logics and their applications in artificial intelligence and computer science Written by internationally leading researchers in the field of pure and applied logic Combines mathematical theory of modal logic and applications in artificial intelligence and computer science Numerous open problems for further research Well illustrated with pictures and tables. (shrink)

We introduce Boolean-like algebras of dimension n ($$n{\mathrm {BA}}$$ n BA s) having n constants $${{{\mathsf {e}}}}_1,\ldots,{{{\mathsf {e}}}}_n$$ e 1, …, e n, and an $$(n+1)$$ ( n + 1 ) -ary operation q (a “generalised if-then-else”) that induces a decomposition of the algebra into n factors through the so-called n-central elements. Varieties of $$n{\mathrm {BA}}$$ n BA s share many remarkable properties with the variety of Boolean algebras and with primal varieties. The $$n{\mathrm {BA}}$$ n BA s (...) provide the algebraic framework for generalising the classical propositional calculus to the case of n–perfectly symmetric–truth-values. Every finite-valued tabular logic can be embedded into such a n-valued propositional logic, $$n{\mathrm {CL}}$$ n CL, and this embedding preserves validity. We define a confluent and terminating first-order rewriting system for deciding validity in $$n{\mathrm {CL}}$$ n CL, and, via the embeddings, in all the finite tabular logics. (shrink)

Nature seems to be such that we can describe it accurately with quantum theories of bosons and fermions alone, without resort to parastatistics. This has been seen as a deep mystery: paraparticles make perfect physical sense, so why don’t we see them in nature? We consider one potential answer: every paraparticle theory is physically equivalent to some theory of bosons or fermions, making the absence of paraparticles in our theories a matter of convention rather than a mysterious empirical discovery. (...) We argue that this equivalence thesis holds in all physically admissible quantum field theories falling under the domain of the rigorous Doplicher–Haag–Roberts approach to superselection rules. Inadmissible parastatistical theories are ruled out by a locality-inspired principle we call charge recombination. 1 Introduction2 Paraparticles in Quantum Theory3 Theoretical Equivalence3.1 Field systems in algebraic quantum field theory3.2 Equivalence of field systems4 A Brief History of the Equivalence Thesis4.1 The Green decomposition4.2 Klein transformations4.3 The argument of Drühl, Haag, and Roberts4.4 The Doplicher–Roberts reconstruction theorem5 Sharpening the Thesis6 Discussion6.1 Interpretations of Quantum Mechanics6.2 Structuralism and haecceities6.3 Paraquark theories. (shrink)

In 1981, Takeuti introduced quantum set theory as the quantum counterpart of Boolean valued models of set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed subspaces in a Hilbert space and showed that appropriate quantum counterparts of ZFC axioms hold in the model. Here, Takeuti's formulation is extended to construct a model of set theory based on the logic represented by the lattice of projections in an arbitrary von Neumann algebra. (...) A transfer principle is established that enables us to transfer theorems of ZFC to their quantum counterparts holding in the model. The set of real numbers in the model is shown to be in one-to-one correspondence with the set of self-adjoint operators affiliated with the von Neumann algebra generated by the logic. Despite the difficulty pointed out by Takeuti that equality axioms do not generally hold in quantum set theory, it is shown that equality axioms hold for any real numbers in the model. It is also shown that any observational proposition in quantum mechanics can be represented by a corresponding statement for real numbers in the model with the truth value consistent with the standard formulation of quantum mechanics, and that the equality relation between two real numbers in the model is equivalent with the notion of perfect correlation between corresponding observables (self-adjoint operators) in quantum mechanics. The paper is concluded with some remarks on the relevance to quantum set theory of the choice of the implication connective in quantum logic. (shrink)

I analyse the conceptual and mathematical foundations of Lagrangian quantum field theory (QFT) (that is, the ‘naive’ (QFT) used in mainstream physics, as opposed to algebraic quantum field theory). The objective is to see whether Lagrangian (QFT) has a sufficiently firm conceptual and mathematical basis to be a legitimate object of foundational study, or whether it is too ill-defined. The analysis covers renormalisation and infinities, inequivalent representations, and the concept of localised states; the conclusion is that Lagrangian QFT (at least (...) as described here) is a perfectly respectable physical theory, albeit somewhat different in certain respects from most of those studied in foundational work. (shrink)

Three problems in book I of Diophantus’ Arithmetica contain the adjective plasmatikon, that appears to qualify an implicit reference to some theorems in Elements, book II. The translation and meaning of the adjective sparked a long-lasting controversy that has become a nonnegligible aspect of the debate about the possibility of interpreting Diophantus’ approach and, more generally, Greek mathematics in algebraic terms. The correct interpretation of the word, a technical term in the Greek rhetorical tradition that perfectly fits the context in (...) which it is inserted in the Arithmetica, entails that Diophantus’ text contained no (implicit) reference to Euclid’s Elements. The clause containing the adjective turns out to be a later interpolation, that cannot be used to support any algebraic interpretation of the Arithmetica. (shrink)

A metaphor that has dominated linguistics for the entire duration of its existence as a discipline views sentences as edifices consisting of Lego-like building blocks. It is assumed that each sentence is constructed (and, on the receiving end, parsed) ab novo, starting (ending) with atomic constituents, to logical semantic specifications, in a recursive process governed by a few precise algebraic rules. The assumptions underlying the Lego metaphor, as it is expressed in generative grammar theories, are: (1) perfect regularity of (...) what Saussure called langue, (2) infinite potential recursivity of syntactic structures, (3) unlimited human capacity for linguistic creativity, (4) the impossibility of acquiring structural knowledge from examples, and (5) the impossibility of such knowledge being stored in a memory-intensive form (ensembles of exemplars). (shrink)

Hume’s discussion of space, time, and mathematics at T 1.2 appeared to many earlier commentators as one of the weakest parts of his philosophy. From the point of view of pure mathematics, for example, Hume’s assumptions about the infinite may appear as crude misunderstandings of the continuum and infinite divisibility. I shall argue, on the contrary, that Hume’s views on this topic are deeply connected with his radically empiricist reliance on phenomenologically given sensory images. He insightfully shows that, working within (...) this epistemological model, we cannot attain complete certainty about the continuum but only at most about discrete quantity. Geometry, in contrast to arithmetic, cannot be a fully exact science. A number of more recent commentators have offered sympathetic interpretations of Hume’s discussion aiming to correct the older tendency to dismiss this part of the Treatise as weak and confused. Most of these commentators interpret Hume as anticipating the contemporary idea of a finite or discrete geometry. They view Hume’s conception that space is composed of simple indivisible minima as a forerunner of the conception that space is a discretely (rather than continuously) ordered set. This approach, in my view, is helpful as far as it goes, but there are several important features of Hume’s discussion that are not sufficiently appreciated. I go beyond these recent commentators by emphasizing three of Hume’s most original contributions. First, Hume’s epistemological model invokes the “confounding” of indivisible minima to explain the appearance of spatial continuity. Second, Hume’s sharp contrast between the perfect exactitude of arithmetic and the irremediable inexactitude of geometry reverses the more familiar conception of the early modern tradition in pure mathematics, according to which geometry (the science of continuous quantity) has its own standard of equality that is independent from and more exact than any corresponding standard supplied by algebra and arithmetic (the sciences of discrete quantity). Third, Hume has a developed explanation of how geometry (traditional Euclidean geometry) is nonetheless possible as an axiomatic demonstrative science possessing considerably more exactitude and certainty that the “loose judgements” of the vulgar. (shrink)