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

This main aim of this paper is to prove that in a direct commutative BCK-algebra an ideal I is nitely generated if and only if I is a principal ideal. This result generalizes the result obtained by E. Y. Deeba in [2]. We also give an answer to the question posed by E. Y. Deeba in [1]: for what class of BCK-algebras is every Noetherian algebra a principal ideal algebra ?

Several investigations in probability theory and the theory of expert systems show that it is important to search for some reasonable generalizations of fuzzy logics (e.g. Łukasiewicz, Gödel or product logic) having a non-associative conjunction. In the present paper, we offer a non-associative fuzzy logic L CBA having as an equivalent algebraic semantics lattices with section antitone involutions satisfying the contraposition law, so-called commutative basic algebras. The class (variety) CBA of commutative basic algebras was intensively studied in several (...) recent papers and includes the class of MV-algebras. We show that the logic L CBA is very close to the Łukasiewicz one, both having the same finite models, and can be understood as its non-associative generalization. (shrink)

In this paper we consider properties, related to model-completeness, of the theory of integrally closed commutative regular rings. We obtain the main theorem claiming that in a Boolean algebra B, the truth of a prenex Σn-formula whose parameters ai partition B, can be determined by finitely many conditions built from the first entry of Tarski invariant T(ai)'s, n-characteristic D(n, ai)'s and the quantities S(ai, l) and S'(ai, l) for $l < n$. Then we derive two important theorems. One (...) claims that for any Boolean algebras A and B, an embedding of A into B preserving D(n, a) for all a ∈ A is a Σn-extension. The other claims that the theory of n-separable Boolean algebras admits elimination of quantifiers in a simple definitional extension of the language of Boolean algebras. Finally we translate these results into the language of commutative regular rings. (shrink)

We introduce and discuss a concept of approximation of a topological algebraic system A by finite algebraic systems from a given class K. If A is discrete, this concept agrees with the familiar notion of a local embedding of A in a class K of algebraic systems. One characterization of this concept states that A is locally embedded in K iff it is a subsystem of an ultraproduct of systems from K. In this paper we obtain a similar characterization (...) of approximability of a locally compact system A by systems from K using the language of nonstandard analysis. In the signature of A we introduce positive bounded formulas and their approximations; these are similar to those introduced by Henson [14] for Banach space structures (see also [15, 16]). We prove that a positive bounded formula φ holds in A if and only if all precise enough approximations of φ hold in all precise enough approximations of A. We also prove that a locally compact field cannot be approximated arbitrarily closely by finite (associative) rings (even if the rings are allowed to be non-commutative). Finite approximations of the field R can be considered as possible computer systems for real arithmetic. Thus, our results show that there do not exist arbitrarily accurate computer arithmetics for the reals that are associative rings. (shrink)

In this paper we investigate the class of MV-algebras equipped with two quantifiers which commute as a natural generalization of diagonal-free two-dimensional cylindric algebras. In the 40s, Tarski first introduced cylindric algebras in order to provide an algebraic apparatus for the study of classical predicate calculus. The diagonal–free two-dimensional cylindric algebras are special cylindric algebras. The treatment here of MV-algebras is done in terms of implication and negation. This allows us to simplify some results due to Di Nola and Grigolia (...) :125–139, 2004) related to the characterization of a quantifier in terms of some special sub-algebra associated to it. On the other hand, we present a topological duality for this class of algebras and we apply it to characterize the congruences of one algebra via certain closed sets. Finally, we study the subvariety of this class generated by a chain of length n + 1. We prove that the subvariety is semisimple and we characterize their simple algebras. Using a special functional algebra, we determine all the simple finite algebras of this subvariety. (shrink)

In the paper it will be shown that Reichenbach’s Weak Common Cause Principle is not valid in algebraic quantum field theory with locally finite degrees of freedom in general. Namely, for any pair of projections A, B supported in spacelike separated double cones ${\mathcal{O}}_{a}$ and ${\mathcal{O}}_{b}$ , respectively, a correlating state can be given for which there is no nontrivial common cause (system) located in the union of the backward light cones of ${\mathcal{O}}_{a}$ and ${\mathcal{O}}_{b}$ and commuting with the (...) both A and B. Since noncommuting common cause solutions are presented in these states the abandonment of commutativity can modulate this result: noncommutative Common Cause Principles might survive in these models. (shrink)

In the present contribution we look at the legacy of Hilbert's programme in some recent developments in mathematics. Hilbert's ideas have seen new life in generalised and relativised forms by the hands of proof theorists and have been a source of motivation for the so--called reverse mathematics programme initiated by H. Friedman and S. Simpson. More recently Hilbert's programme has inspired T. Coquand and H. Lombardi to undertake a new approach to constructive algebra in which strong emphasis is laid (...) on the use of finite methods. The main aim is to eliminate the ideal objects and in so doing obtain more elementary and informative proofs. We survey some work in commutative algebra---mainly about and around the Zariski spectrum and the Krull dimension of a commutative ring---which witnesses the feasibility of such a revised Hilbert's programme. (shrink)

We investigate algebraically the fragment of the intuitionistic propositional calculus consisting of equivalence together with conjunction on the intuitionistic regularizations. We find that this fragment is strongly algebraizable with the equivalent algebraic semantics being the variety of equivalential algebras with an additional binary operation that can be interpreted as the meet on regular elements. We give a finite equational base for this variety, and investigate its properties, in particular the commutator. As applications, we prove that the fragment is hereditarily (...) structurally complete and we describe the top of the lattice of its axiomatic extensions. (shrink)

For an arbitrary finite algebra $\g A = (A, f, 0, 1)$ one defines a double sequence $a(i,j)$ by $a(i,0)\!=\!a(0,j)\! =\! 1$ and $a(i,j) \!= \!f( a(i, j-1) , a(i-1,j) )$.The problem if such recurrent double sequences are ultimately zero is undecidable, even if we restrict it to the class of commutative finite algebras.

In this paper we prove that the equational class generated by bounded BCK-algebras is the variety generated by the class of finite simple bounded BCK-algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK-algebras is also a relatively simple bounded BCK-algebra. Moreover, we show that every simple bounded BCK-algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some (...) richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (shrink)

A systematic approach to the algebraic and Kripke semantics for logics with restricted structural rules, notably for logics on an underlying non-distributive lattice, is developed. We provide a new topological representation theorem for general lattices, using the filter space X. Our representation involves a galois connection on subsets of X, hence a closure operator $\Gamma$, and the image of the representation map is characterized as the collection of $\Gamma$-stable, compact-open subsets of the filter space . The original lattice ${\cal L}$ (...) is thus imbedded in the complete lattice of stable sets. The representation is shown to be functorial and is extended to a Stone-type duality. ;In the presence of additional operators, the extension problem is addressed in terms of what we call adjoint completions of normal operators. An operator f on a lattice L is normal if f: $L\sp{} \times \cdots \times L\sp{} \to L\sp{}$ is a monotone map, where each $L\sp{}$, $i \in n$ + 1, is either L or $L\sp{op}$ and f sends finite joins of $L\sp{}$ to joins in $L\sp{}$. Every familiar operator, such as $\circ$ , + , $\gets, \to, \neg, \square$ O is normal. By a uniform argument we show that normal operators $f\sb{i}$ on L extend to operators $F\sb{i}$ on $\Gamma X$ that distribute over arbitrary joins or meets and that \sb{i\in I})$ is a universal such extension. ;We also raise and resolve the question of representability of operators on stable sets by relations. We give an extensive number of examples of representation of specific operators and provide explicit constructions of canonical Kripke frames, based on our extension arguments, for a number of logical systems, notably for Intuitionistic and Classical Linear Logics, or Non-commutative Linear Logic and of fragments thereof. (shrink)

We solve several open problems on the cardinality of atoms in the subvariety lattice of residuated lattices and FL-algebras [4, Problems 17—19, pp. 437]. Namely, we prove that the subvariety lattice of residuated lattices contains continuum many 4-potent commutative representable atoms. Analogous results apply also to atoms in the subvariety lattice of FL i -algebras and FL o -algebras. On the other hand, we show that the subvariety lattice of residuated lattices contains only five 3-potent commutative representable atoms (...) and two integral commutative representable atoms. Inspired by the construction of atoms, we are also able to prove that the variety of integral commutative representable residuated lattices is generated by its 1-generated finite members. (shrink)

A pO -algebra $${(L; f, \, ^{\star})}$$ is an algebra in which ( L ; f ) is an Ockham algebra, $${(L; \, ^{\star})}$$ is a p -algebra, and the unary operations f and $${^{\star}}$$ commute. Here we consider the endomorphism monoid of such an algebra. If $${(L; f, \, ^{\star})}$$ is a subdirectly irreducible pK 1,1 - algebra then every endomorphism $${\vartheta}$$ is a monomorphism or $${\vartheta^3 = \vartheta}$$ . When L is (...) class='Hi'>finite the endomorphism monoid of L is regular, and we determine precisely when it is a Clifford monoid. (shrink)

Pseudo MV-algebras are a non-commutative extension of MV-algebras introduced recently by Georgescu and Iorgulescu. We introduce states (finitely additive probability measures) on pseudo MV-algebras. We show that extremal states correspond to normal maximal ideals. We give an example in that, in contrast to classical MV-algebras introduced by Chang, states can fail on pseudo MV-algebras. We prove that representable and normal-valued pseudo MV-algebras admit at least one state.

A continuoxis t- norm is a continuous map * from [0, 1]² into [0,1] such that is a commutative totally ordered monoid. Since the natural ordering on [0,1] is a complete lattice ordering, each continuous t-norm induces naturally a residuation → and becomes a commutative naturally ordered residuated monoid, also called a hoop. The variety of basic hoops is precisely the variety generated by all algebras, where * is a continuous t-norm. In this paper we investigate the structure (...) of the variety of basic hoops and some of its subvarieties. In particular we provide a complete description of the finite subdirectly irreducible basic hoops, and we show that the variety of basic hoops is generated as a quasivariety by its finite algebras. We extend these results to Hájek's BL-algebras, and we give an alternative proof of the fact that the variety of BL-algebras is generated by all algebras arising from continuous t-norms on [ 0,1] and their residua. The last part of the paper is devoted to the investigation of the subreducts of BL- algebras, of Gödel algebras and of product algebras. (shrink)

In this paper we characterize the MV-algebras containing as subalgebras Post algebras of finitely many orders. For this we study cyclic elements in MV-algebras which are the generators of the fundamental chain of the Post algebras.

The IKt-algebras were introduced in the paper An algebraic axiomatization of the Ewald’s intuitionistic tense logic by the first and third author. In this paper, our main interest is to investigate the principal and Boolean congruences on IKt-algebras. In order to do this we take into account a topological duality for these algebras obtained in Figallo et al. :673–701, 2017). Furthermore, we characterize Boolean and principal IKt-congruences and we show that Boolean IKt-congruence are principal IKt-congruences. Also, bearing in mind the (...) above results, we obtain that Boolean IKt-congruences are commutative, regular and uniform. Finally, we characterize the principal IKt-congruences in the case that the IKt-algebra is linear and complete whose prime filters are complete and also the case that it is linear and finite. This allowed us to establish that the intersection of two principal IKt-congruences on these algebras is a principal one and also to determine necessary and sufficient conditions so that a principal IKt-congruence is a Boolean one on theses algebras. (shrink)

Journal of Mathematical Logic, Ahead of Print. We present numerous natural algebraic examples without the so-called Canonical Base Property (CBP). We prove that every commutative unitary ring of finite Morley rank without finite-index proper ideals satisfies the CBP if and only if it is a field, a ring of positive characteristic or a finite direct product of these. In addition, we construct a CM-trivial commutative local ring with a finite residue field without the CBP. (...) Furthermore, we also show that finite-dimensional non-associative algebras over an algebraically closed field of characteristic [math] give rise to triangular rings without the CBP. This also applies to Baudisch’s [math]-step nilpotent Lie algebras, which yields the existence of a [math]-step nilpotent group of finite Morley rank whose theory, in the pure language of groups, is CM-trivial and does not satisfy the CBP. (shrink)

We present numerous natural algebraic examples without the so-called Canonical Base Property (CBP). We prove that every commutative unitary ring of finite Morley rank without finite-index proper ideals satisfies the CBP if and only if it is a field, a ring of positive characteristic or a finite direct product of these. In addition, we construct a CM-trivial commutative local ring with a finite residue field without the CBP. Furthermore, we also show that finite-dimensional (...) non-associative algebras over an algebraically closed field of characteristic [Formula: see text] give rise to triangular rings without the CBP. This also applies to Baudisch’s [Formula: see text]-step nilpotent Lie algebras, which yields the existence of a [Formula: see text]-step nilpotent group of finite Morley rank whose theory, in the pure language of groups, is CM-trivial and does not satisfy the CBP. (shrink)

Fix a finite ordinal \ and let \ be an arbitrary ordinal. Let \ denote the class of cylindric algebras of dimension \ and \ denote the class of relation algebras. Let \\) stand for the class of polyadic algebras of dimension \. We reprove that the class \ of completely representable \s, and the class \ of completely representable \s are not elementary, a result of Hirsch and Hodkinson. We extend this result to any variety \ between polyadic (...) algebras of dimension \ and diagonal free \s. We show that that the class of completely and strongly representable algebras in \ is not elementary either, reproving a result of Bulian and Hodkinson. For relation algebras, we can and will, go further. We show the class \ is not closed under \. In contrast, we show that given \, and an atomic \, then for any \, \ is a completely representable \. We show that for any \, the class of completely representable algebras in certain reducts of \s, that happen to be varieties, is elementary. We show that for \, the the class of polyadic-cylindric algebras dimension \, introduced by Ferenczi, the completely representable algebras coincide with the atomic ones. In the last algebras cylindrifications commute only one way, in a sense weaker than full fledged commutativity of cylindrifications enjoyed by classical cylindric and polyadic algebras. Finally, we address closure under Dedekind-MacNeille completions for cylindric-like algebras of dimension \ and \s for \ an infinite ordinal, proving negative results for the first and positive ones for the second. (shrink)

In this paper we study a certain class of Lie algebras over commutative von Neumann algebras satisfying a certain finiteness condition. By using Boolean valued methods developed by Takeuti [8]-[11], we will establish the basic structure and representation theorems.

Ekstein has shown that causal independence neither implies nor is implied by commutativity in an infinite-dimensional, reducible construction. DeFacio and Taylor have presented a finite-dimensional irreducible example of Ekstein's proposition. Avishai and Ekstein have shown that the original question regarding locality for algebraic quantum field theories remainsopen. We concur with that claim and offer additional arguments. A new denumerably infinite-dimensional, irreducible example is presented here which shows that a sort of “orthogonality” among operators is involved. Some observations on localC*-andW*-algebras (...) are given. (shrink)

In this paper we prove that the equational class generated by bounded BCK-algebras is the variety generated by the class of finite simple bounded BCK-algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK-algebras is also a relatively simple bounded BCK-algebra. Moreover, we show that every simple bounded BCK-algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some (...) richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEAT that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic (...) equality set algebras, but such operations are relativized to a union of cartesian spaces that are not necessarily disjoint. This is a form of guarding semantics. We show that CPEAT is canonical and atom‐canonical. Imposing an extra condition on T, we prove that atomic algebras in CPEAT are completely representable and that CPEAT has the super amalgamation property. If T is rich and finitely represented, it is shown that CPEAT is term definitionally equivalent to a finitely axiomatizable Sahlqvist variety. Such semigroups exist. This can be regarded as a solution to the central finitizability problem in algebraic logic for first order logic with equality if we do not insist on full fledged commutativity of quantifiers. The finite dimensional case is approached from the view point of guarded and clique guarded (relativized) semantics of fragments of first order logic using finitely many variables. Both positive and negative results are presented. (shrink)

In this paper, we define the notion of PC-lattice, as a generalization of finite positive implicative BCK-algebras with condition and bounded commutative BCK-algebras. We investiate some results for Pc-lattices being a new class of BCK-lattices. Specially, we prove that any Boolean lattice is a PC-lattice and we show that if X is a PC-lattice with condition S, then X is an involutory BCK-algebra if and only if X is a commutative BCK-algebra. Finally, we prove that (...) any PC-lattice with condition is a distributive BCK-algebra. (shrink)

The notion of monadic three-valued ukasiewicz algebras was introduced by L. Monteiro ([12], [14]) as a generalization of monadic Boolean algebras. A. Monteiro ([9], [10]) and later L. Monteiro and L. Gonzalez Coppola [17] obtained a method for the construction of a three-valued ukasiewicz algebra from a monadic Boolea algebra. In this note we give the construction of a monadic three-valued ukasiewicz algebra from a Boolean algebra B where we have defined two quantification operations and * (...) such that *x=*x (where *x=-*-x). In this case we shall say that and * commutes. If B is finite and is an existential quantifier over B, we shall show how to obtain all the existential quantifiers * which commute with .Taking into account R. Mayet [3] we also construct a monadic three-valued ukasiewicz algebra from a monadic Boolean algebra B and a monadic ideal I of B. (shrink)

A group is small if it has only countably many complete n-types over the empty set for each natural number n. More generally, a group G is weakly small if it has only countably many complete 1-types over every finite subset of G. We show here that in a weakly small group, subgroups which are definable with parameters lying in a finitely generated algebraic closure satisfy the descending chain conditions for their traces in any finitely generated algebraic closure. An (...) infinite weakly small group has an infinite abelian subgroup, which may not be definable. A small nilpotent group is the central product of a definable divisible group with a definable one of bounded exponent. In a group with simple theory, any set of pairwise commuting elements is contained in a definable finite-by-abelian subgroup. First corollary: a weakly small group with simple theory has an infinite definable finite-by-abelian subgroup. Secondly, in a group with simple theory, a solvable group A of derived length n is contained in an A-definable almost solvable group of class at most 2n — 1. (shrink)

This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven (...) to be extremely useful in computer science. The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students. (shrink)

We say that a ring admits elimination of quantifiers, if in the language of rings, {0, 1, +, ·}, the complete theory of R admits elimination of quantifiers. Theorem 1. Let D be a division ring. Then D admits elimination of quantifiers if and only if D is an algebraically closed or finite field. A ring is prime if it satisfies the sentence: ∀ x ∀ y ∃ z (x = 0 ∨ y = 0 ∨ xzy ≠ 0). (...) Theorem 2. If R is a prime ring with an infinite center and R admits elimination of quantifiers, then R is an algebraically closed field. Let A be the class of finite fields. Let B be the class of 2 × 2 matrix rings over a field with a prime number of elements. Let C be the class of rings of the form $GF(p^n) \bigoplus GF(p^k)$ such that either n = k or g.c.d. (n, k) = 1. Let D be the set of ordered pairs (f, Q) where Q is a finite set of primes and f: Q → A ∪ B ∪ C such that the characteristic of the ring f(q) is q. Finally, let E be the class of rings of the form $\bigoplus_{q \in Q}f(q)$ for some (f, Q) in D. Theorem 3. Let R be a finite ring without nonzero trivial ideals. Then R admits elimination of quantifiers if and only if R belongs to E. Theorem 4. Let R be a ring with the descending chain condition of left ideals and without nonzero trivial ideals. Then R admits elimination of quantifiers if and only if R is an algebraically closed field or R belongs to E. In contrast to Theorems 2 and 4, we have Theorem 5. If R is an atomless p-ring, then R is finite, commutative, has no nonzero trivial ideals and admits elimination of quantifiers, but is not prime and does not have the descending chain condition. We also generalize Theorems 1, 2 and 4 to alternative rings. (shrink)

We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to $1$ ), and using a Fraïssé limit, we will establish that the classes of all atom structures of nonassociative relation algebras and relation algebras both have $0$ – $1$ laws. As a consequence, we obtain improved asymptotic formulas for the numbers of these structures and broaden some known probabilistic (...) results on relation algebras. (shrink)

We construct a sheaf-theoretic representation of quantum observables algebras over a base category equipped with a Grothendieck topology, consisting of epimorphic families of commutative observables algebras, playing the role of local arithmetics in measurement situations. This construction makes possible the adaptation of the methodology of Abstract Differential Geometry (ADG), à la Mallios, in a topos-theoretic environment, and hence, the extension of the “mechanism of differentials” in the quantum regime. The process of gluing information, within diagrams of commutative algebraic (...) localizations, generates dynamics, involving the transition from the classical to the quantum regime, formulated cohomologically in terms of a functorial quantum connection, and subsequently, detected via the associated curvature of that connection. (shrink)

Fix 2 < n < ω. Let CA n denote the class of cylindric algebras of dimension n, and let RCA n denote the variety of representable CA n ’s. Let L n denote first-order logic restricted to the first n variables. Roughly, CA n, an instance of Boolean algebras with operators, is the algebraic counterpart of the syntax of L n, namely, its proof theory, while RCA n algebraically and geometrically represents the Tarskian semantics of L n. Unlike Boolean (...) algebras having a Stone representation theorem, RCA n ⊊ CA n. Using combinatorial game theory, we show that the existence of certain finite relation algebras RA, which are algebras whose domain consists of binary relations, implies that the celebrated Henkin omitting types theorem fails in a very strong sense for L n. Using special cases of such finite RA ’s, we recover the classical nonfinite axiomatizability results of Monk, Maddux, and Biro on RCA n and we re-prove Hirsch and Hodkinson’s result that the class of completely representable CA n ’s is not first-order definable. We show that if T is an L n countable theory that admits elimination of quantifiers, λ is a cardinal < 2 ℵ 0, and F = 〈 Γ i : i < λ 〉 is a family of complete nonprincipal types, then F can be omitted in an ordinary countable model of T. (shrink)

We define a finite relation algebra and show that the network satisfaction problem is undecidable for this algebra.

Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

Roelcke non-precompactness, simplicity, and non-amenability of the automorphism group of the Fraïssé limit of finite Heyting algebras are proved among others.

Simple observations on diophantine definability over finite commutative rings lead to a characterization of those rings in terms of their diophantine behavior.

One kind of generalized measures called quantum measures on finite effect algebras, which fulfil the grade-2 additive sum rule, is considered. One basis of vector space of quantum measures on a finite effect algebra with the Riesz decomposition property (RDP for short) is given. It is proved that any diagonally positive symmetric signed measure \(\lambda \) on the tensor product \(E\otimes E\) can determine a quantum measure \(\mu \) on a finite effect algebra \(E\) with (...) the RDP such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . Furthermore, some conditions for a grade-2 additive measure \(\mu \) on a finite effect algebra \(E\) are provided to guarantee that there exists a unique diagonally positive symmetric signed measure \(\lambda \) on \(E\otimes E\) such that \(\mu (x)=\lambda (x\otimes x)\) for any \(x\in E\) . At last, it is showed that any grade- \(t\) quantum measure on a finite effect algebra \(E\) with the RDP is essentially established by the values on a subset of \(E\). (shrink)

Chang's MV algebras are the algebras of the infinite-valued sentential calculus of ukasiewicz. We introduce finitely additive measures (called states) on MV algebras with the intent of capturing the notion of average degree of truth of a proposition. Since Boolean algebras coincide with idempotent MV algebras, states yield a generalization of finitely additive measures. Since MV algebras stand to Boolean algebras as AFC*-algebras stand to commutative AFC*-algebras, states are naturally related to noncommutativeC*-algebraic measures.

The aim of this paper is to characterize varieties of Heyting algebras with decidable theory of their finite members. Actually we prove that such varieties are exactly the varieties generated by linearly ordered algebras. It contrasts to the result of Burris [2] saying that in the case of whole varieties, only trivial variety and the variety of Boolean algebras have decidable first order theories.

On the basis of the Klingler–Levy classification of finitely generated modules over commutative noetherian rings we approach the old problem of classifying finite commutative rings R with a decidable theory of modules. We prove that if R is wild, then the theory of all R-modules is undecidable, and verify decidability of this theory for some classes of tame finite commutative rings.

The recently developed technique of Bohrification associates to a (unital) C*-algebra Athe Kripke model, a presheaf topos, of its classical contexts;in this Kripke model a commutative C*-algebra, called the Bohrification of A;the spectrum of the Bohrification as a locale internal in the Kripke model. We propose this locale, the ‘state space’, as a (n intuitionistic) logic of the physical system whose observable algebra is A.We compute a site which externally captures this locale and find that externally (...) its points may be identified with partial measurement outcomes. This prompts us to compare Scott-continuity on the poset of contexts and continuity with respect to the C*-algebra as two ways to mathematically identify measurement outcomes with the same physical interpretation. Finally, we consider the not-not-sheafification of the Kripke model on classical contexts and obtain a space of measurement outcomes which for commutative C*-algebras coincides with the spectrum. The construction is functorial on the category of C*-algebras with commutativity reflecting maps. (shrink)

The paper deals with involutive FLe-monoids, that is, commutative residuated, partially-ordered monoids with an involutive negation. Involutive FLe-monoids over lattices are exactly involutive FLe-algebras, the algebraic counterparts of the substructural logic IUL. A cone representation is given for conic involutive FLe-monoids, along with a new construction method, called twin-rotation. Some classes of finite involutive FLe-chains are classified by using the notion of rank of involutive FLe-chains, and a kind of duality is developed between positive and non-positive rank algebras. (...) As a side effect, it is shown that the substructural logic IUL plus t ↔ f does not have the finite model property. (shrink)

Using the description of the Ziegler spectrum we characterise modules with various stability-theoretic properties (ω-stability, superstability, categoricity) over certain classes of finite-dimensional algebras. We also show that, for modules over the algebras we consider, having few types is equivalent to being ω-stable.

By a well-known result of Kotlarski et al., first-order Peano arithmetic \ can be conservatively extended to the theory \ of a truth predicate satisfying compositional axioms, i.e., axioms stating that the truth predicate is correct on atomic formulae and commutes with all the propositional connectives and quantifiers. This result motivates the general question of determining natural axioms concerning the truth predicate that can be added to \ while maintaining conservativity over \. Our main result shows that conservativity fails even (...) for the extension of \ obtained by the seemingly weak axiom of disjunctive correctness \ that asserts that the truth predicate commutes with disjunctions of arbitrary finite size. In particular, \ implies \\). Our main result states that the theory \ coincides with the theory \ obtained by adding \-induction in the language with the truth predicate. This result strengthens earlier work by Kotlarski and Cieśliński. For our proof we develop a new general form of Visser’s theorem on non-existence of infinite descending chains of truth definitions and prove it by reduction to Gödel’s second incompleteness theorem, rather than by using the Visser–Yablo paradox, as in Visser’s original proof. (shrink)