We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.

The variety \ of semi-Heyting algebras was introduced by H. P. Sankappanavar [13] as an abstraction of the variety of Heyting algebras. Semi-Heyting algebras are the algebraic models for a logic HsH, known as semi-intuitionistic logic, which is equivalent to the one defined by a Hilbert style calculus in Cornejo :9–25, 2011) [6]. In this article we introduce a Gentzen style sequent calculus GsH for the semi-intuitionistic logic whose associated logic GsH is the same as HsH. (...) The advantage of this presentation of the logic is that we can prove a cut-elimination theorem for GsH that allows us to prove the decidability of the logic. As a direct consequence, we also obtain the decidability of the equational theory of semi-Heyting algebras. (shrink)

This paper is a contribution toward developing a theory of expansions of semi-Heyting algebras. It grew out of an attempt to settle a conjecture we had made in 1987. Firstly, we unify and extend strikingly similar results of [ 48 ] and [ 50 ] to the (new) equational class DHMSH of dually hemimorphic semi-Heyting algebras, or to its subvariety BDQDSH of blended dual quasi-De Morgan semi-Heyting algebras, thus settling the conjecture. Secondly, we give a criterion (...) for a unary expansion of semi-Heyting algebras to be a discriminator variety and give an algorithm to produce discriminator varieties. We then apply the criterion to exhibit an increasing sequence of discriminator subvarieties of BDQDSH . We also use it to prove that the variety DQSSH of dually quasi-Stone semi- Heyting algebras is a discriminator variety. Thirdly, we investigate a binary expansion of semi-Heyting algebras, namely the variety DblSH of double semi-Heyting algebras by characterizing its simples, and use the characterization to present an increasing sequence of discriminator subvarieties of DblSH . Finally, we apply these results to give bases for “small” subvarieties of BDQDSH , DQSSH , and DblSH. (shrink)

In an accompanying paper Gomes, we have put forward an interpretation of quantum mechanics based on a non-relativistic, Lagrangian 3+1 formalism of a closed Universe M, existing on timeless configuration space \ of some field over M. However, not much was said there about the role of locality, which was not assumed. This paper is an attempt to fill that gap. Locality in full can only emerge dynamically, and is not postulated. This new understanding of locality is based solely on (...) the properties of extremal paths in configuration space. I do not demand locality from the start, as it is usually done, but showed conditions under which certain systems exhibit it spontaneously. In this way we recover semi-classical local behavior when regions dynamically decouple from each other, a notion more appropriate for extension into quantum mechanics. The dynamics of a sub-region O within the closed manifold M is independent of its complement, \, if the projection of extremal curves on \ onto the space of extremal curves intrinsic to O is a surjective map. This roughly corresponds to \, where \ is a linear projection. This criterion for locality can be made approximate—an impossible feat had it been already postulated—and it can be applied for theories which do not have hyperbolic equations of motion, and/or no fixed causal structure. When two regions are mutually independent according to the criterion proposed here, the semi-classical path integral kernel factorizes, showing cluster decomposition which is the ultimate aim of a definition of locality. (shrink)

Structural equation modelling (SEM) is outlined and compared with two non-linear alternatives, artificial neural networks and ''fast and frugal'' models. One particular non-linear decision-making situation is discussed, that exemplified by a lexicographic semi-order. We illustrate the use of SEM on a dataset derived from 539 volunteers' responses to questions about food-related risks. Our conclusion is that SEM is a useful member of the armoury of techniques available to the student of human judgement: it subsumes several multivariate statistical techniques and (...) permits their flexible combination, and it provides robust goodness-of-fit statistics and is available in (generally) easy-to-use computer packages. Although the number of tasks for which SEM provides a persuasive psychological model is small, it is very useful in identifying the important variables and their inter-relations that contribute to task performance, and thus can constitute a valuable intermediate staging point between raw data and a fully fledged psychological theory. (shrink)

A quantum measurement-like event can produce any of a number of macroscopically distinct results, with corresponding macroscopically distinct gravitational fields, from the same initial state. Hence the probabilistically evolving large-scale structure of space-time is not precisely or even always approximately described by the deterministic Einstein equations.Since the standard treatment of gravitational wave propagation assumes the validity of the Einstein equations, it is questionable whether we should expect all its predictions to be empirically verified. In particular, one might expect the stochasticity (...) of amplified quantum indeterminacy to cause coherent gravitational wave signals to decay faster than standard predictions suggest. This need not imply that the radiated energy flux from gravitational wave sources differs from standard theoretical predictions. An underappreciated bonus of gravitational wave astronomy is that either detecting or failing to detect predicted gravitational wave signals would constrain the form of the semi-classical theory of gravity that we presently lack. (shrink)

The Schrödinger equation for a particle of rest mass $m$ and electrical charge $ne$ interacting with a four-vector potential $A_i$ can be derived as the non-relativistic limit of the Klein–Gordon equation $\left( \Box '+m^2\right) \varPsi =0$ for the wave function $\varPsi $ , where $\Box '=\eta ^{jk}\partial '_j\partial '_k$ and $\partial '_j=\partial _j -\mathrm {i}n e A_j$ , or equivalently from the one-dimensional action $S_1=-\int m ds +\int neA_i dx^i$ for the corresponding point particle in the semi-classical approximation $\varPsi (...) \sim \exp {(\mathrm {i}S_1)}$ , both methods yielding the equation $\mathrm {i}\partial _0\varPsi \approx \left( \frac{1}{2m}\eta ^{\alpha \beta }\partial '_{\alpha }\partial '_{\beta } + m + n e\phi \right) \varPsi $ in Minkowski space–time , where $\alpha ,\beta =1,2,3$ and $\phi =-A_0$ . We show that these two methods generally yield equations that differ in a curved background space–time $g_{ij}$ , although they coincide when $g_{0\alpha }=0$ if $m$ is replaced by the effective mass $\mathcal{M}\equiv \sqrt{m^2-\xi R}$ in both the Klein–Gordon action $S$ and $S_1$ , allowing for non-minimal coupling to the gravitational field, where $R$ is the Ricci scalar and $\xi $ is a constant. In this case $\mathrm {i}\partial _0\varPsi \approx \left( \frac{1}{2\mathcal{M}'} g^{\alpha \beta }\partial '_{\alpha }\partial '_{\beta } + \mathcal{M}\phi ^{(\mathrm g)} + n e\phi \right) \varPsi $ , where $\phi ^{(\mathrm g)} =\sqrt{g_{00}}$ and $\mathcal{M}'=\mathcal{M}/\phi ^{(\mathrm g)} $ , the correctness of the gravitational contribution to the potential having been verified to linear order $m\phi ^{(\mathrm g)} $ in the thermal-neutron beam interferometry experiment due to Colella et al. Setting $n=2$ and regarding $\varPsi $ as the quasi-particle wave function, or order parameter, we obtain the generalization of the fundamental macroscopic Ginzburg-Landau equation of superconductivity to curved space–time. Conservation of probability and electrical current requires both electromagnetic gauge and space–time coordinate conditions to be imposed, which exemplifies the gravito-electromagnetic analogy, particularly in the stationary case, when div ${{\varvec{A}}}=\hbox {div}{{\varvec{A}}}^{(\mathrm g)}=0$ , where ${{\varvec{A}}}^{\alpha }=-A^{\alpha }$ and ${{\varvec{A}}}^{(\mathrm g)\alpha }=-\phi ^{(\mathrm g)}g^{0\alpha }$ . The quantum-cosmological Schrödinger (Wheeler–DeWitt) equation is also discussed in the $\mathcal{D}$ -dimensional mini-superspace idealization, with particular regard to the vacuum potential $\mathcal V$ and the characteristics of the ground state, assuming a gravitational Lagrangian $L_\mathcal{D}$ which contains higher-derivative terms up to order $\mathcal{R}^4$ . For the heterotic superstring theory , $L_\mathcal{D}$ consists of an infinite series in $\alpha '\mathcal{R}$ , where $\alpha '$ is the Regge slope parameter, and in the perturbative approximation $\alpha '|\mathcal{R}| \ll 1$ , $\mathcal V$ is positive semi-definite for $\mathcal{D} \ge 4$ . The maximally symmetric ground state satisfying the field equations is Minkowski space for $3\le {\mathcal {D}}\le 7$ and anti-de Sitter space for $8 \le \mathcal {D} \le 10$. (shrink)

The author establishes an elementary system AS which contains functions +, ≐ and a constant 0 and then proves the semi-completeness and the decidability of AS, using the theory of systems of inequalities.

The content of existence theorems in the calculus of variations has been explored and an effective treatment of semi-continuity has been achieved. An algorithm has been developed which captures the natural algorithmic content of the notion of a semi-continuous function and this is used to obtain an effective version of the “chattering lemma” of control theory and ordinary differential equations. This lemma reveals the main computational content of the theory of relaxed optimal control.

Relativistic geometrical action for a quantum particle in the superspace is analyzed from theoretical group point of view. To this end an alternative technique of quantization outlined by the authors in a previous work and, that is, based in the correct interpretation of the square root Hamiltonian, is used. The obtained spectrum of physical states and the Fock construction consist of Squeezed States which correspond to the representations with the lowest weights \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$${\lambda=\frac{1}{4}}$$\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}$${\frac{3}{4}}$$\end{document} with four possible fractional representations for the group decomposition of the spin structure. From the theory of semi-groups the analytical representation of the radical operator in the superspace is constructed, the conserved currents are computed and a new relativistic wave equation is proposed and explicitly solved for the time dependent case. The relation with the Relativistic Schrödinger equation and the Time-dependent Harmonic Oscillator is analyzed and discussed. (shrink)

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields and of the theory of separably closed fields of arbitrary imperfection degree.

We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.

This paper provides characterisations of the equational theory of the PER model of a typed lambda calculus with inductive types. The characterisation may be cast as a full abstraction result; in other words, we show that the equations between terms valid in this model coincides with a certain syntactically defined equivalence relation. Along the way we give other characterisations of this equivalence; from below, from above, and from a domain model, a version of the Kreisel-Lacombe-Shoenfield theorem allows us to (...) transfer the result from the domain model to the PER model. (shrink)

This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras). For example, an easily applicable but deep method, based on von Neumann's coordinatization theorem, is developed for establishing undecidability results. The method is used to solve several outstanding problems posed by Tarski. In addition, the complexity of intervals of equational theories of relation algebras with respect to questions of decidability is investigated. Using ideas that go back to (...) Jonsson and Lyndon, the authors show that such intervals can have the same complexity as the lattice of subsets of the set of the natural numbers. Finally, some new and quite interesting examples of decidable equational theories are given. The methods developed in the monograph show promise of broad applicability. They provide researchers in algebra and logic with a new arsenal of techniques for resolving decision questions in various domains of algebraic logic. (shrink)

We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symbols. We show that consistency of such equational theories can be proved in the weak fragment of arithmetic S 1 2 . In particular this solves an open problem formulated by TAKEUTI (c.f. [5, p.5 problem 9.]).

For a finite von Neumann algebra factor M, the projections form a modular ortholattice L(M). We show that the equational theory of L(M) coincides with that of some resp. all L(ℂ n × n ) and is decidable. In contrast, the uniform word problem for the variety generated by all L(ℂ n × n ) is shown to be undecidable.

Among others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEA ω 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schema-axiomatizable, as well). We will also show that the complexity of the equational theory of RPEA ω is also extremely high in (...) the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and Viktor Gyuris [12], the following methodological conclusions will be drawn: The negative properties of polyadic (equality) algebras can be removed by switching from what we call the "polyadic algebraic paradigm" to the "cylindric algebraic paradigm". (shrink)

For $\Bbb {F}$ the field of real or complex numbers, let $CG(\Bbb {F})$ be the continuous geometry constructed by von Neumann as a limit of finite dimensional projective geometries over $\Bbb {F}$ . Our purpose here is to show the equational theory of $CG(\Bbb {F})$ is decidable.

It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic . In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known . Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes are in fact quasivarieties.

The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts of \ (...) ’s, as well. We prove that the equational theory of \ is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work. (shrink)

Several attempts have been done to distinguish “positive” information in an arbitrary first order theory, i.e., to find a well behaved class of closed sets among the definable sets. In many cases, a definable set is said to be closed if its conjugates are sufficiently distinct from each other. Each such definition yields a class of theories, namely those where all definable sets are constructible, i.e., boolean combinations of closed sets. Here are some examples, ordered by strength:Weak normality describes (...) a rather small class of theories which are well understood by now (see, for example, [P]). On the other hand, normalization is so weak that all theories, in a suitable context, are normalizable (see [HH]). Thus equational theories form an interesting intermediate class of theories. Little work has been done so far. The original work of Srour [S1, S2, S3] adopts a point of view that is closer to universal algebra than to stability theory. The fundamental definitions and model theoretic properties can be found in [PS], though some easy observations are missing there. Hrushovski's example of a stable non-equational theory, the first and only one so far, is described in the unfortunately unpublished manuscript [HS]. In fact, it is an expansion of the free pseudospace constructed independently by Baudisch and Pillay in [BP] as an example of a strictly 2-ample theory. Strong equationality, defined in [Hr], is also investigated in [HS]. (shrink)

Among others we will prove that the equational theory of $\omega$ dimensional representable polyadic equality algebras is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable. We will also show that the complexity of the equational theory of RPEA$_\omega$ is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and (...) Viktor Gyuris [12], the following methodological conclusions will be drawn: The negative properties of polyadic algebras can be removed by switching from what we call the "polyadic algebraic paradigm" to the "cylindric algebraic paradigm". (shrink)

Among others we will see that the equational theory of ω dimensional representable polyadic equality algebras. We will also see that the complexity of the equational theory of RPEAω is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and Viktor Gyuris [10], the following methodological conclusions will be drawn: the negative properties of polyadic algebras can be removed by switching from what we call the `polyadic (...) algebraic paradigm' to the `cylindric algebraic paradigm'. (shrink)

We show the undecidability of the equational theories of some classes of BAOs with a non-associative, residuated binary extra-Boolean operator. These results solve problems in Jipsen [9], Pratt [21] and Roorda [22], [23]. This paper complements Andréka-Kurucz-Németi-Sain-Simon [3] where the emphasis is on BAOs with an associative binary operator.

Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T. In the 1960s, Tarski and Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Green announced the results of their collaboration in 1970, (...) the only fuller publication of their work occurred as part of a seminar led by Tarski at Berkeley during the 1968–69 academic year. The present paper gives a full account of their findings and their proofs. (shrink)

The class $$\mathsf{TPA}$$ TPA of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of $$\mathsf{TPA}$$ TPA nor the first order theory of $$\mathsf{TPA}$$ TPA are decidable. Moreover, we show that the set of all equations valid in $$\mathsf{TPA}$$ TPA is exactly on the $$\Pi ^1_1$$ Π 1 1 level. We consider the class (...) $$\mathsf{TPA}^-$$ TPA - of the relation algebra reducts of $$\mathsf{TPA}$$ TPA ’s, as well. We prove that the equational theory of $$\mathsf{TPA}^-$$ TPA - is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work. (shrink)

The empirical level of research in the experimental sciences always involves description of what is found by observation and experimentation. These descriptions most often take the form of tables of various sorts . In the process of compiling tables of functions, the method of smoothing-out data plays a significant role. It is often performed by graph procedures. This work results in the formulation of laws, general relationships, which are clothed, in mathematical natural science, in the form of empirical or (...) class='Hi'>semi-empirical equations. (shrink)

The Kantian theory of private law, as Ernest Weinrib and Arthur Ripstein have developed it over the last two decades, is based on a fundamental normative truth, viz., no person is subordinate or superior to another person. Kantians construe any attempt to understand and justify the distribution of the rights-claims and rights-liberties that constitute private law in terms of aggregate welfare and/or distributive justice, as a deep category mistake. This essay outlines a ‘semi-Kantian’ theory of private law, which is (...) like Kant’s in that it understands private law as a means of instituting and protecting private freedom. Yet, semi-Kantians insist that the choice between different private law programs, which respect private freedom equally well, can at times be justified by considerations of aggregate welfare and distributive justice, as well as other considerations that concern the impact on society as a whole. (shrink)

Most axiomatizations of set theory that have been treated metamathematically have been based either entirely on classical logic or entirely on intuitionistic logic. But a natural conception of the settheoretic universe is as an indefinite (or “potential”) totality, to which intuitionistic logic is more appropriately applied, while each set is taken to be a definite (or “completed”) totality, for which classical logic is appropriate; so on that view, set theory should be axiomatized on some correspondingly mixed basis. Similarly, in the (...) case of predicative analysis, the natural numbers are considered to form a definite totality, while the universe of sets (or functions) of natural numbers are viewed as an indefinite totality, so that, again, a mixed semi-constructive logic should be the appropriate one to treat the two together. Various such semiconstructive systems of analysis and set theory are formulated here and their proof-theoretic strength is characterized. Interestingly, though the logic is weakened, one can in compensation strengthen certain principles in a way that could be advantageous for mathematical applications. (shrink)

The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of (...) variables, one obtains, for each number of variables, a fragment of the theory that is indeed Turing-decidable. In a 1982 conversation, Alfred Tarski announced that he believed the theory to be decidable, despite this contradicting CTT. The article gives the background for this proclamation, considers alternate interpretations, and sets the stage for further research. (shrink)

Currently there are at least four sizeable projects going on to establish the gravitational acceleration of massive antiparticles on earth. While general relativity and modern quantum theories strictly forbid any repulsive gravity, it has not yet been established experimentally that gravity is attraction only. With that in mind, the Elementary Process Theory (EPT) is a rather abstract theory that has been developed from the hypothesis that massive antiparticles are repulsed by the gravitational field of a body of ordinary matter: (...) the EPT essentially describes the elementary processes by which the smallest massive systems have to interact with their environments for repulsive gravity to exist. In this paper we model a nonrelativistic, one-component massive system that evolves in time by the processes as described by the EPT in an environment described by classical fields: the main result is a semi-classical model of a process at Planck scale by which a non-relativistic onecomponent system interacts with its environment, such that the interaction has both gravitational and electromagnetic aspects. Some worked-out examples are provided, among which the repulsion of an antineutron by the gravitational field of the earth. The general conclusion is that the semi-classical model of the EPT corresponds to non-relativistic classical mechanics. Further research is aimed at demonstrating that the EPT has a model that reproduces the successful predictions of general relativity. (shrink)