We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ω defines exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with ∑ 1 b -induction over PV ω and use this to re-establish that the provably total functions in this system are polynomial time computable. (...) Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion. (shrink)

The variety MBA of monadic bounded algebras consists of Boolean algebras with a distinguished element E, thought of as an existence predicate, and an operator ∃ reflecting the properties of the existential quantifier in free logic. This variety is generated by a certain class FMBA of algebras isomorphic to ones whose elements are propositional functions. We show that FMBA is characterised by the disjunction of the equations ∃E = 1 and ∃E = 0. We also define a weaker notion of (...) "relatively functional" algebra, and show that every member of MBA is isomorphic to a relatively functional one. (shrink)

We construct an algebra of generalized functions endowed with a canonical embedding of the space of Schwartz distributions.We offer a solution to the problem of multiplication of Schwartz distributions similar to but different from Colombeau’s solution.We show that the set of scalars of our algebra is an algebraically closed field unlike its counterpart in Colombeau theory, which is a ring with zero divisors. We prove a Hahn–Banach extension principle which does not hold in Colombeau theory. We establish a (...) connection between our theory with non-standard analysis and thus answer, although indirectly, a question raised by Colombeau. This article provides a bridge between Colombeau theory of generalized functions and non-standard analysis. (shrink)

Let A be an algebra. We say that the functions f 1,..., f m : A n → A are algebraic on A provided there is a finite system of term-equalities $${{\bigwedge t_{k}(\overline{x}, \overline{z}) = s_{k}(\overline{x}, \overline{z})}}$$ satisfying that for each $${{\overline{a} \in A^{n}}}$$, the m -tuple $${{(f_{1}(\overline{a}), \ldots, f_{m}(\overline{a}))}}$$ is the unique solution in A m to the system $${{\bigwedge t_{k}(\overline{a}, \overline{z}) = s_{k}(\overline{a}, \overline{z})}}$$. In this work we present a collection of general tools for the study of (...) algebraic functions, and apply them to obtain characterizations for algebraic functions on distributive lattices, Stone algebras, finite abelian groups and vector spaces, among other well known algebraic structures. (shrink)

A function is algebraic on an algebra if it can be implicitly defined by a system of equations on. In this note we give a semantic characterization for algebraic functions on quasiprimal algebras. This characterization is applied to obtain necessary and sufficient conditions for a quasiprimal algebra to have every one of its algebraic functions be a term function. We also apply our results to particular algebras such as finite fields and monadic algebras.

This paper presents a generalization of a proposal of van Benthem’s who has shown how to provide a canonical name for any object in propositional type theory. Van Benthem’s idea is to characterize any function in the hierarchy by the Boolean values the function takes for any sequence of arguments. The recursive definition of canonical names uses only the abstraction, functional application, the identity operator and the fact that we have a name for the true and the false. (...) We show that this result can be extended to the finite theory of types by the introduction of an algebra on individuals. (shrink)

We employ the notions of "sequential function" and "interrogation" (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using Longley's preorder-enriched category of partial combinatory algebras and decidable applicative structures. We also investigate total combinatory algebras of partial functions. One of the results is that every realizability topos is a geometric quotient of a realizability topos on a total combinatory algebra.

Consider any subvariety of BL-algebras generated by a single BL-chain which is the ordinal sum of the standard MV-algebra on [0, 1] and a basic hoop H. We present a geometrical characterization of elements in the finitely generated free algebra of each of these subvarieties. In this characterization there is a clear insight of the role of the regular and dense elements of the generating chain. As an application, we analyze maximal and prime filters in the free (...) class='Hi'>algebra. (shrink)

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that κ, λ are infinite cardinals such that κ++ + ≤ λ, κ<κ = κ and 2κ = κ+, and η is an ordinal with κ+ ≤ η < κ++ and cf = κ+. Then, in some cardinal-preserving generic extension there is a superatomic Boolean algebra equation image such that equation image, equation image for every α < η and equation image. Especially, equation image and equation image (...) can be cardinal sequences of superatomic Boolean algebras. (shrink)

In this paper we introduce the concept of d-fuzzy function which generalizes the concept of fuzzy subalgebra to a much larger class of functions in a natural way. In addition we discuss a method of fuzzification of a wide class of algebraic systems onto [0, 1] along with some consequences.

We present a model of computation for string functions over single-sorted, total algebraic structures and study some basic features of a general theory of computability within this framework. Our concept generalizes the Blum-Shub-Smale setting of computability over the reals and other rings. By dealing with strings of arbitrary length instead of tuples of fixed length, some suppositions of deeper results within former approaches to generalized recursion theory become superfluous. Moreover, this gives the basis for introducing computational complexity in a BSS-like (...) manner. Relationships both to classical computability and to Friedman's concept of eds computability are established. Two kinds of nondeterminism as well as several variants of recognizability are investigated with respect to interdependencies on each other and on properties of the underlying structures. For structures of finite signatures, there are universal programs with the usual characteristics. For the general case of not necessarily finite signature, this subject will be studied in a separate, forthcoming paper. (shrink)

We study ranges of algebraic functions in lattices and in algebras, such as Łukasiewicz-Moisil algebras which are obtained by extending standard lattice signatures with unary operations.We characterize algebraic functions in such lattices having intervals as their ranges and we show that in Artinian or Noetherian lattices the requirement that every algebraic function has an interval as its range implies the distributivity of the lattice.

We introduce the equational notion of a monadic bounded algebra (MBA), intended to capture algebraic properties of bounded quantification. The variety of all MBA's is shown to be generated by certain algebras of two-valued propositional functions that correspond to models of monadic free logic with an existence predicate. Every MBA is a subdirect product of such functional algebras, a fact that can be seen as an algebraic counterpart to semantic completeness for monadic free logic. The analysis involves the representation (...) of MBA's as powerset algebras of certain directed graphs with a set of "marked" points. It is shown that there are only countably many varieties of MBA's, all are generated by their finite members, and all have finite equational axiomatisations classifying them into fourteen kinds of variety. The universal theory of each variety is decidable. Finitely generated MBA's are shown to be finite, with the free algebra on r generators having exactly $2^{3.2^{r.} } ^{2^{{\rm{2}}^{{\rm{r - 1}}} } } $ elements. An explicit procedure is given for constructing this freely generated algebra as the powerset algebra of a certain marked graph determined by the number r. (shrink)

The Uniformly Reflexive Structure was introduced by E. G. Wagner who showed that the theory of such structures generalized much of recursive function theory. In this paper Uniformly Reflexive Structures are constructed as factor algebras of Free nonassociative algebras. Wagner's question about the existence of a model with no computable splinter ("successor set") is answered in the affirmative by the construction of a model whose only computable sets are the finite sets and their complements. Finally, for each countable Boolean (...) algebra R of subsets of a countable set which contains the finite subsets, a model is constructed with R as its family of computable sets. (shrink)

Let ℛ be an o-minimal expansion of a real closed field R. We continue here the investigation we began in [11] of differentiability with respect to the algebraically closed field [Formula: see text]. We develop the basic theory of such K-differentiability for definable functions of several variables, proving theorems on removable singularities as well as analogues of the Weierstrass preparation and division theorems for definable functions. We consider also definably meromorphic functions and prove that every definable function which is (...) meromorphic on Kn is necessarily a rational function. We finally discuss definable analogues of complex analytic manifolds, with possible connections to the model theoretic work on compact complex manifolds, and present two examples of "nonstandard manifolds" in our setting. (shrink)

Monoidal t-norm based logic $\mathbf {MTL}$ is the weakest t-norm based residuated fuzzy logic, which is a $[0,1]$ -valued propositional logical system having a t-norm and its residuum as truth function for conjunction and implication. Monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ that consists of the formulas with unary predicates and just one object variable, is the monadic fragment of fuzzy predicate logic $\mathbf {MTL\forall }$, which is indeed the predicate version of monoidal t-norm based logic $\mathbf {MTL}$. The (...) main aim of this paper is to give an algebraic proof of the completeness theorem for monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ and some of its axiomatic extensions. Firstly, we survey the axiomatic system of monadic algebras for t-norm based residuated fuzzy logic and amend some of them, thus showing that the relationships for these monadic algebras completely inherit those for corresponding algebras. Subsequently, using the equivalence between monadic fuzzy predicate logic $\mathbf {mMTL\forall }$ and S5-like fuzzy modal logic $\mathbf {S5(MTL)}$, we prove that the variety of monadic MTL-algebras is actually the equivalent algebraic semantics of the logic $\mathbf {mMTL\forall }$, giving an algebraic proof of the completeness theorem for this logic via functional monadic MTL-algebras. Finally, we further obtain the completeness theorem of some axiomatic extensions for the logic $\mathbf {mMTL\forall }$, and thus give a major application, namely, proving the strong completeness theorem for monadic fuzzy predicate logic based on involutive monoidal t-norm logic $\mathbf {mIMTL\forall }$ via functional representation of finitely subdirectly irreducible monadic IMTL-algebras. (shrink)

Let R be a real closed field, and X⊆Rm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\subseteq R^m}$$\end{document} semi-algebraic and 1-dimensional. We consider complete first-order theories of modules over the ring of continuous semi-algebraic functions X→R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\to R}$$\end{document} definable with parameters in R. As a tool we introduce -piecewise vector bundles on X and show that the category of piecewise vector bundles on X is equivalent to the category of syzygies of (...) finitely generated submodules of free modules. We give an explicit method to determine the Baur–Monk invariants of free modules in terms of pre-piecewise vector bundles. When R is a recursive real closed field this yields the decidability of the theory of free modules. Where it makes sense, we address the same questions for continuous definable functions in o-minimal expansions of a real closed field. From the free module case we are able to deduce generalisations of some results to arbitrary modules over the ring. We present a geometrically motivated quantifier elimination result down to the level of positive primitive formulae with a certain block decomposition of the matrix of coefficients. (shrink)

Mythic algebra was developed in a trio of papers in the Journal of Literary Semantics. It models mythology and storytelling with algebraic sets. Expanded into a proto-mathematical system, it provides a hierarchical range of functions which can also apply to language and symbolic processes. Its relation to the three basic ‘laws of thought’ of classical logic is analyzed. Correspondences are also found with the Peircean division of a sign into icon, index, and symbol. Further applications are made to metaphor (...) and irony. (shrink)

Explicit description of maps definable by formulæ of the second order intuitionistic propositional calculus is given on two classes of linear Heyting algebras—the dense ones and the ones which possess successors. As a consequence, it is shown that over these classes every formula is equivalent to a quantifier free formula in the dense case, and to a formula with quantifiers confined to the applications of the successor in the second case.

Central to certain versions of logical atomism are claims to the effect that every proposition is a truth-functional combination of elementary propositions. Assuming that propositions form a Boolean algebra, we consider a number of natural formal regimentations of informal claims in this vicinity, and show that they are equivalent. For a number of reasons, such as the need to accommodate quantifiers, logical atomists might consider only complete Boolean algebras, and take into account infinite truth-functional combinations. We show that in (...) such a variant setting, some of the regimentations come apart, and explore how they relate to each other. We also discuss how they relate to the claim that propositions form a double powerset algebra, which has been proposed by a number of authors as a way of capturing the central logical atomist idea. (shrink)

In this paper we show how the dynamics of the Schrödinger, Pauli and Dirac particles can be described in a hierarchy of Clifford algebras, \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal{C}}_{1,3}, {\mathcal{C}}_{3,0}$\end{document}, and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}${\mathcal{C}}_{0,1}$\end{document}. Information normally carried by the wave function is encoded in elements of a minimal left ideal, so that all the physical information appears within the algebra itself. The state of the quantum process (...) can be completely characterised by algebraic invariants of the first and second kind. The latter enables us to show that the Bohm energy and momentum emerge from the energy-momentum tensor of standard quantum field theory. Our approach provides a new mathematical setting for quantum mechanics that enables us to obtain a complete relativistic version of the Bohm model for the Dirac particle, deriving expressions for the Bohm energy-momentum, the quantum potential and the relativistic time evolution of its spin for the first time. (shrink)

In this review, we present a rigorous construction of an algebraic method for quantum unstable states, also called Gamow states. A traditional picture associates these states to vectors states called Gamow vectors. However, this has some difficulties. In particular, there is no consistent definition of mean values of observables on Gamow vectors. In this work, we present Gamow states as functionals on algebras in a consistent way. We show that Gamow states are not pure states, in spite of their representation (...) as Gamow vectors. We propose a possible way out to the construction of averages of observables on Gamow states. The formalism is intended to be presented with sufficient mathematical rigor. (shrink)

According to the algebraic approach to spacetime, a thoroughgoing dynamicism, physical fields exist without an underlying manifold. This view is usually implemented by postulating an algebraic structure (e.g., commutative ring) of scalar-valued functions, which can be interpreted as representing a scalar field, and deriving other structures from it. In this work, we point out that this leads to the unjustified primacy of an undetermined scalar field. Instead, we propose to consider algebraic structures in which all (and only) physical fields are (...) primitive. We explain how the theory of natural operations in differential geometry—the modern formalism behind classifying diffeomorphism-invariant constructions—can be used to obtain concrete implementations of this idea for any given collection of fields. For concrete examples, we illustrate how our approach applies to a number of particular physical fields, including electrodynamics coupled to a Weyl spinor. (shrink)

Dynamic algebras combine the classes of Boolean (B 0) and regular (R ; *) algebras into a single finitely axiomatized variety (B R ) resembling an R-module with scalar multiplication . The basic result is that * is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result (...) is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of prepositional dynamic logic, and yet another notion of regular algebra. (shrink)

We establish a correspondence between the holographic chain R⁺ → S² → M⁴ → Gr(2,4)_C and the Cayley–Dickson construction R → C → H → O of the four normed division algebras. Each holographic projection introduces a shadow symmetry—an anti-linear involution doubling the ambient dimension—identified with the conjugation in the corresponding Cayley–Dickson step. The Mellin transform implements R → C via s ↔ 1−s; celestial holography implements C → H via Δ ↔ 2−Δ; time reversal implements H → O via (...) the conjugate Hodge star on Gr(2,4). We prove that the Plücker relation is equivalent to algebraic balance between self-dual and anti-self-dual components, and that the orthogonal complement acts on Plücker coordinates as the conjugate Hodge star with a pure phase. The chain terminates at dim = 8 because Gr(2,4)_C is compact (χ = 6), providing a geometric interpretation of Hurwitz's theorem. The dictionary Δ = 2s cascades with critical parameter d/2: 1/2 → 1 → 2 → 4. Via SL(4,C) ≅ Spin(6,C) ⊂ Spin(8,C), the framework connects to triality and three fermion generations. All instances of the ratio 3/8 in physics trace to dim(Im(H))/dim(O). Numerical verification of all proven claims is provided to machine precision. A new cohomological derivation is given: the Hasse–Weil zeta function of Gr(2,4) over Q decomposes as ζ_Gr(s) = ζ(s)·ζ(s−1)·ζ(s−2)²·ζ(s−3)·ζ(s−4), identifying the Riemann zeta function as the H⁰ factor; under Δ = 2s (forced by the Plücker weight k = 2), the Riemann functional equation s ↔ 1−s becomes the shadow transform Δ ↔ 2−Δ. (shrink)

This paper explores the mathematical connections between the algebraic and relational semantics of Lewis’s logics for counterfactual conditionals. Specifically, we introduce topological variants of Lewis’s well-known possible-worlds semantics—based on spheres, selection functions, and orders—and establish duality results with respect to varieties of Boolean algebras equipped with a counterfactual operator, which serve as the equivalent algebraic semantics of Lewis’s main systems. These results aim to provide a solid mathematical foundation for the study of Lewis’s logics, and offer a new perspective on (...) the most well-known possible worlds-based models. In particular, we write explicit proofs for several results that are often assumed without proof in the literature. Leveraging these duality results, we also derive alternative proofs of strong completeness for Lewis’s variably strict conditional logics with respect to their intended models, and clarify the role of the limit assumption in sphere semantics. (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 can equivalently present this by the recursion equations f1(n) = 2n, fk+1(1) = fk(1), fk+1(n+1) = fk(fk+1(n)), where k,n ≥ 1. We define A(k,n) = fk(n).

ABSTRACT We propose a combination of a fragment of four-valued logic and process algebra. This fragment is geared to a simple relation with process algebra via the conditional guard construct, and can easily be extended to a truth-functionally complete logic. We present an operational semantics in SOS-style, and a completeness result for ACP with conditionals and four- valued logic. Completeness is preserved under the restriction to some other non-classical logics.

Computational implementations are special relations between what is computed and what computes it. Though the word “isomorphism” appears in philosophical discussions about the nature of implementations, it is used only metaphorically. Here we discuss computation in the precise language of abstract algebra. The capability of emulating computers is the defining property of computers. Such a chain of emulation is ultimately grounded in an algebraic object, a full transformation semigroup. Mathematically, emulation is defined by structure preserving maps (morphisms) between semigroups. (...) These are systematic, very special relationships, crucial for defining implementation. In contrast, interpretations are general functions with no morphic properties. They can be used to derive semantic content from computations. Hierarchical structure imposed on a computational structure plays a similar semantic role. Beyond bringing precision into the investigation, the algebraic approach also sheds light on the interplay between time and computation. (shrink)

It is shown that the Schrödinger equation can be solved by means of spectrum-generating algebra techniques for the most general class of Natanzon potentials based on the SO(2, 1) algebra. This paper describes in detail thelinear spectrum generating algebra method which is then applied to solve the Natanzon confluent potentials, and it is extended to one example with spin-orbit coupling. Further, the method is used to explain in detail how to find the energy spectrum for the Dirac (...) equation with a Coulomb potential. Afterwards thequadratic spectrum generation algebra method is presented, and it is used to solve the most general hypergeometric Natanzon potential: The bound state problem and the corresponding wave functions are given. A simple example further illustrates the use of the quadratic method. (shrink)

The present paper generalizes the notion of general overlap and grouping functions from the bounded lattices to the algebras of infinite-valued Łukasiewicz logic, providing some constructive methods of these functions by means of multiplicative and additive generators. Here we first introduce the notion of general overlap and grouping functions on MV-algebras, and provide some conditions under which an MV-algebra is a multiplicative and an additive integral by using two constructions of general overlap and grouping functions, respectively. Subsequently, we introduce (...) the concept of generators, including multiplicative and additive generators, of general overlap and grouping functions on MV-algebras, and provide the necessary and sufficient conditions of two one-place functions to be multiplicative and additive generators, respectively, discussing the relationship between multiplicative and additive generators of general overlap and grouping functions on MV-algebras. (shrink)

Results of R. Miller in 2009 proved several theorems about algebraic fields and computable categoricity. Also in 2009, A. Frolov, I. Kalimullin, and R. Miller proved some results about the degree spectrum of an algebraic field when viewed as a subfield of its algebraic closure. Here, we show that the same computable categoricity results also hold for finite-branching trees under the predecessor function and for connected, finite-valence, pointed graphs, and we show that the degree spectrum results do not hold (...) for these trees and graphs. We also offer an explanation for why the degree spectrum results distinguish these classes of structures: although all three structures are algebraic structures, the fields are what we call effectively algebraic. (shrink)

The Wigner–Weyl mapping of quantum operators to classical phase space functions preserves the algebra, when operator multiplication is mapped to the binary “*” operation. However, this isomorphism is destroyed under the quasiclassical substitution of * with conventional multiplication; consequently, an approximate mapping is required if algebraic relations are to be preserved. Such a mapping is uniquely determined by the fundamental relations of quantum mechanics, as is shown in this paper. The resultant quasiclassical approximation leads to an algebraic derivation of (...) Thomas–Fermi theory, and a new quantization rule which—unlike semiclassical quantization—is non-invariant under action transformations of the Hamiltonian, in the same qualitative manner as the true eigenvalues. The quasiclassical eigenvalues are shown to be significantly more accurate than the corresponding semiclassical values, for a variety of 1D and 2D systems. In addition, certain standard refinements of semiclassical theory are shown to be easily incorporated into the quasiclassical formalism. (shrink)