A stable theory is finitely based if every set of indiscernibles is based on a finite subset. This is a common generalization of superstability and 1-basedness. We show that if such theories have more than one model they must have infinitely many, and prove some other conjectures.

We examine the notion of primitive satisfaction in logical matrices. Theorem II. 1, being the matrix counterpart of Baker's well-known result for congruently distributive varieties of algebras (cf [1], Thm. 1.5), links the notions of primitive and standard satisfaction. As a corollary we give the matrix version of Jónsson's Lemma, proved earlier in [4]. Then we investigate propositional logics with disjunction. The main result, Theorem III. 2, states a necessary and sufficient condition for such logics to be finitely (...) class='Hi'>based. (shrink)

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.

In this paper we exhibit a non-finitely based, finitely generated quasi-variety of De Morgan algebras and determine the bottom of the lattices of sub-quasi-varieties of Kleene and De Morgan algebras.

This paper deals with axiomatization problems for varieties of residuated meet semilattice-ordered monoids. An internal characterization of the finitely subdirectly irreducible RSs is proved, and it is used to investigate the varieties of RSs within which the finitely based subvarieties are closed under finite joins. It is shown that a variety has this closure property if its finitely subdirectly irreducible members form an elementary class. A syntactic characterization of this hypothesis is proved, and examples are discussed.

It is shown that given any finite system of monoid identities, it is decidable if the class of locally finite monoids that satisfy the system is a variety. This answers an open problem of Mark V. Sapir.

Motivated by a question of W. Rautenberg, we prove that any matrix that is term-equivalent to the well-known nonfinitely based matrix of A. Wroski is itself also nonfinitely based.

In this paper, finite-time tracking problem of nonholonomic mobile robots for a moving target is considered. First of all, polar coordinates are used to characterize the distance and azimuth between the moving target and the robot. Then, based on the distance and azimuth transported from the sensor installed on the robot, a finite-time tracking control law is designed for the nonholonomic mobile robot by the switching control method. Rigorous proof shows that the tracking error converges to zero in a (...) finite time. Numerical simulation demonstrates the effectiveness of the proposed control method. (shrink)

This work investigates the finite-time control problem for a nonlinear four-tank cross-coupled liquid level system by the port-controlled Hamiltonian model. A fixed-free methodology is exhibited which can be used to simplify the controller design procedure. To get an adjustable convergent gain of the finite-time control, a feasible technique named damping normalization is proposed. A novel parameter autotuning algorithm is given to clarify the principle of choosing parameters of the PCH method. Furthermore, a finite-time controller is designed by a state-error desired (...) Hamiltonian function, and the relationship between the settling time and a parameter is given, which can be applied in practical engineering easily to adjust the settling time according to the industrial need. Finally, simulation and experimental results verify the effectiveness of the proposed algorithm. (shrink)

Shoenfield [8] has shown that a hierarchy for the functions recursive in a type-2 object can be set up whenever E2 (the type-2 object that introduces numerical quantification) is recursive in that type-2 object. With a restriction that we will discuss in the next paragraph, Moschovakis [4, pp. 254–259] has solved the analogous problem for type-3 objects. His method seems to generalize for any type-n object, where n ≥ 2. We will solve this same problem of finding hierarchies based (...) on type-n objects by a different method. Instead of using ordinal notations for indexing stages of hierarchies, as do Shoenfield and Moschovakis, we will define notation-independent stages. (shrink)

Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighbourhood of its free variables. Such notions have proved to be useful in many applications. They all, however, refer to isomorphisms of neighbourhoods, which most local logics cannot test. A stronger notion of locality says that the truth value of a formula is determined by what the logic itself can say about that small neighbourhood. Since (...) the expressiveness of many logics can be characterized by games, one can also say that the truth value of a formula is determined by the type, with respect to a game, of that small neighbourhood. Such game-based notions of locality can often be applied when traditional isomorphism-based notions of locality cannot.Our goal is to study game-based notions of locality. We work with an abstract view of games that subsumes games for many logics. We look at three, progressively more complicated locality notions. The easiest requires only very mild conditions on the game and works for most logics of interest. The other notions, based on Hanf’s and Gaifman’s theorems, require more restrictions. We state those restrictions and give examples of logics that satisfy and fail the respective game-based notions of locality. (shrink)

In this study, an accurate convergence time of the supertwisting algorithm is proposed to build up a framework for nonaffine nonlinear systems’ finite-time control. The convergence time of the STA is provided by calculating the solution of a differential equation instead of constructing Lyapunov function. Therefore, precise convergence time is presented instead of estimation of the upper bound of the algorithm’s reaching time. Regardless of affine or nonaffine nonlinear systems, supertwisting control provides a general solution based on virtual control (...) law skill ensuring the output of the systems converges to the origin point at exact time. Benchmark tests are simulated to demonstrate the effectiveness and efficiency of the algorithm. (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)

Nonmonotonic reasoning is a discipline of computer science, epistemology, and cognition: It models inferences where classical logic is inadequate in symbolic AI, defines normative models for reasoning with defeasible information in epistemology, and models human reasoning under information change in cognition. Its building blocks are defeasible rules formalised as DeFinetti conditionals. In this thesis, Christian Eichhorn examines qualitative and semi-quantitative inference relations on top said conditionals, using the conditional structure of the knowledge base and Spohn’s Ordinal Conditional Functions, using established (...) properties. Converting network approaches from probabilistics, he shows how to approach the relations with regard to implementation. (shrink)

A system of semigroup identities is hereditarily finitely based if it defines a variety all semigroups of which are finitely based. Two new types of hereditarily finitely based identity systems are presented. Two of these systems, together with eight existing systems, establish the hereditary finite basis property of every semigroup of order five or less with one possible exception.

Renowned scholar Robert Adams explores the relation between religion and ethics through a comprehensive philosophical account of a theistically-based framework for ethics. Adams' framework begins with the good rather than the right, and with excellence rather than usefulness. He argues that loving the excellent, of which adoring God is a clear example, is the most fundamental aspect of a life well lived. Developing his original and detailed theory, Adams contends that devotion, the sacred, grace, martyrdom, worship, vocation, faith, and (...) other concepts drawn from religious ethics have been sorely overlooked in moral philosophy and can enrich the texture of ethical thought. (shrink)

We define a property for varieties V, the f.r.p. . If it applies to a finitely based V then V is strongly finitely based in the sense of [14], see Theorem 2. Moreover, we obtain finite axiomatizability results for certain propositional logics associated with V, in its generality comparable to well-known finite base results from equational logic. Theorem 3 states that each variety generated by a 2-element algebra has the f.r.p. Essentially this implies finite axiomatizability of (...) a 2-valued logic in any finite language. (shrink)

In this paper I argue that de Finetti provided compelling reasons for rejecting countable additivity. It is ironical therefore that the main argument advanced by Bayesians against following his recommendation is based on the consistency criterion, coherence, he himself developed. I will show that this argument is mistaken. Nevertheless, there remain some counter-intuitive consequences of rejecting countable additivity, and one in particular has all the appearances of a full-blown paradox. I will end by arguing that in fact it is (...) no paradox, and that what it shows is that conditionalisation, often claimed to be integral to the Bayesian canon, has to be rejected as a general rule in a finitely additive environment. (shrink)

Adams offers a theistically-based framework for ethics, based upon the idea of a transcendent, infinite good, which is God, and its relation to the many finite examples of good in our experience. His account shows how philosophically unfashionable religious concepts can enrich ethical thought. "...one of the two most important books in moral philosophy of the last quarter century, the other being After Virtue."--Theology Today.

Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.

Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set.

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

We introduce a family of tableau calculi for deontic action logics based on finite boolean algebras, these logics provide deontic operators which are applied to a finite number of actions ; furthermore, in these formalisms, actions can be combined by means of boolean operators, this provides an expressive algebra of actions. We define a tableau calculus for the basic logic and then we extend this calculus to cope with extant variations of this formalism; we prove the soundness and completeness (...) of these proof systems. In addition, we investigate the computational complexity of the satisfiability problem for DAL and its extensions; we show this problem is NP-complete when the number of actions considered is fixed, and it is \-Hard when the number of actions is taken as an extra parameter. The tableau systems introduced here can be implemented in PSPACE, this seems reasonable taking into consideration the computational complexity of the logics. (shrink)

The paper investigates completions in the context of finitely generated lattice-based varieties of algebras. In particular the structure of canonical extensions in such a variety $${\mathcal {A}}$$ is explored, and the role of the natural extension in providing a realisation of the canonical extension is discussed. The completions considered are Boolean topological algebras with respect to the interval topology, and consequences of this feature for their structure are revealed. In addition, we call on recent results from duality theory (...) to show that topological and discrete dualities for $${\mathcal {A}}$$ exist in partnership. (shrink)

In [2] A. Wroski proved that there is a strongly finite consequence C which is not finitely based i.e. for every consequence C + determined by a finite set of standard rules C C +. In this paper it will be proved that for every strongly finite consequence C there is a consequence C + determined by a finite set of structural rules such that C(Ø)=C +(Ø) and = (where , are consequences obtained by adding to the rules (...) of C, C + respectively the rule of substitution). Moreover it will be shown that under certain assumptions C=C +. (shrink)

Working in the language of first-order arithmetic we consider models of the base theory P - . Suppose M is a model of P - and let M satisfy induction for σ 1 -formulas. First it is shown that the Friedberg-Muchnik finite injury argument can be performed inside M, and then, using a blocking method for the requirements, we prove that the Sacks splitting construction can be done in M. So, the "amount" of induction needed to perform the known finite (...) injury priority arguments is Σ 1 -induction. (shrink)

Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have the `finite base property' and have decidable universal theories, and that any finite algebra in each class is representable on a finite set.

I show that frequentism, as an explanation of probability in classical statistical mechanics, can be extended in a natural way to a decoherent quantum history space, the analogue of a classical phase space. The result is a form of finite frequentism, in which Gibbs’ concept of an infinite ensemble of gases is replaced by the quantum state expressed as a superposition of a finite number of decohering microstates. It is a form of finite and actual frequentism (as opposed to hypothetical (...) frequentism) insofar as all the microstates exist, in keeping with the decoherence-based Everett interpretation, and some versions of pilot-wave theory. (shrink)

Proper fork algebras are algebras of binary relations over a structured set. The underlying set has changed from a set of pairs to a set closed under an injective function. In this paper we present a representation theorem for their abstract counterpart, that entails that proper fork algebras — whose underlying set is closed under an injective function — constitute a finitely based variety.1.

In order to modelize the reasoning of intelligent agents represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this paper, we consider logic systems called L'T without this kind of constants but limited to the case where T is a finite poset. We study the tableau method for this system and we prove its completeness for a class of formulas with respect to an algebraic (...) semantics. (shrink)

This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is (...) to develop a general model-construction method based on this definition. We do this and thereby obtain the completeness of most of the standard modal systems, and in addition apply the method to some other systems of interest. None of the results use filtration, but in our final section we explore the connection. (shrink)

In Finite and Infinite Goods, Adams develops a sophisticated and richly detailed Platonic-theistic framework for ethics. The view is Platonic in virtue of being Good-centered; it is theistic both in identifying God with the Good and, more distinctively, in including a divine command theory of moral obligation. Readers familiar with Adams’s earlier divine command theory will recall that in response to the worry that God might command something evil, Adams introduced an independent value constraint, claiming that only the commands of (...) a loving God were fit to constitute moral obligations. In Finite and Infinite Goods he develops this notion of a loving and good God in what is now a fundamentally Good-centered ethical framework with a subordinate divine command theory of moral obligation. There is much of worth here, especially for theists wishing to think through the merits of a good-based theistic ethics, but also for those nontheists like myself who have a general interest in the nature of value and obligation. (shrink)