The purpose of this note is to present a simplification of the system of arithmetical axioms given in previous work; specifically, it is shown how the induction principle can in fact be obtained from the remaining axioms, without the need of explicit postulation. The argument might be of more general interest, beyond the specifics of the proposed axiomatization, as it highlights the interaction of the notion of Dedekind-finiteness and the induction principle.

The paper discusses a few tensions “crucifying” the works and even personality of the great Georgian philosopher Merab Mamardashvili: East and West; human being and thought, symbol and consciousness, infinity and finiteness, similarity and differences. The observer can be involved as the correlative counterpart of the totality: An observer opposed to the totality externalizes an internal part outside. Thus the phenomena of an observer and the totality turn out to converge to each other or to be one and the (...) same. In other words, the phenomenon of an observer includes the singularity of the solipsistic Self, which (or “who”) is the same as that of the totality. Furthermore, observation can be thought as that primary and initial action underlain by the phenomenon of an observer. That action of observation consists in the externalization of the solipsistic Self outside as some external reality. It is both a zero action and the singularity of the phenomenon of action. The main conclusions are: Mamardashvili’s philosophy can be thought both as the suffering effort to be a human being again and again as well as the philosophical reflection on the genesis of thought from itself by the same effort. Thus it can be recognized as a powerful tension between signs and symbol, between conscious structures and consciousness, between the syncretism of the East and the discursiveness of the West crucifying spiritually Georgia. (shrink)

Today’s philosophical thinking mostly deals with the problem of sin from a religious, phenomenological or ethical point of view. This paper is an attempt to find hermeneutical points of view for the possibility of an interpretation of sin which can be opened by philosophical hermeneutics with reference to our historical being, the linguistic form of experience and the experience of finitude. The train of thoughts takes us from the analysis of the concept “original sin” to the disclosure of the speculative (...) structure and existential meaning of the original sin. Throughout this examination, the essence of original sin is revealed as the medium and the universal experience-horizon of the history of human being and of meaning. (shrink)

We consider a family of differential algebras of real functions on real euclidean spaces, stable under right composition by affine maps. We prove that under a weak finiteness property, there is an o-minimal expansion of the ordered field of real numbers in which all these functions are definable.

We show that (i) it is consistent with that there are infinite sets X on which every metric is discrete; (ii) the notion of real infinite is strictly stronger than that of metrically infinite; (iii) a set X is metrically infinite if and only if it is weakly Dedekind‐infinite if and only if the cardinality of the set of all metrically finite subsets of X is strictly less than the size of ; and (iv) an infinite set X is weakly (...) Dedekind‐infinite if and only if has infinite towers if and only if X has countable partitions. (shrink)

This paper proves the finite axiomatizability of transitive modal logics of finite depth and finite width w.r.t. proper-successor-equivalence. The frame condition of the latter requires, in a rooted transitive frame, a finite upper bound of cardinality for antichains of points with different sets of proper successors. The result generalizes Rybakov’s result of the finite axiomatizability of extensions of $\mathbf {S4}$ of finite depth and finite width.

The typical rules for truth-trees for first-order logic without functions can fail to generate finite branches for formulas that have finite models–the rule set fails to have the finite tree property. In 1984 Boolos showed that a new rule set proposed by Burgess does have this property. In this paper we address a similar problem with the typical rule set for first-order logic with identity and functions, proposing a new rule set that does have the finite tree property.

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)

Finite-state methods are applied to the Russell-Wiener notion of time (based on events) and developed into an account of interval relations and temporal propositions. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and non-deterministic relations defining notions of partiality within and across such levels.

We write and for the cardinalities of the set of finite subsets and the set of permutations with finitely many non‐fixed points, respectively, of a set which is of cardinality. In this paper, we investigate relationships between and for an infinite cardinal in the absence of the Axiom of Choice. We give conditions that make and comparable as well as give related consistency results.

This paper investigates the question of how we manage to single out the natural number structure as the intended interpretation of our arithmetical language. Horsten submits that the reference of our arithmetical vocabulary is determined by our knowledge of some principles of arithmetic on the one hand, and by our computational abilities on the other. We argue against such a view and we submit an alternative answer. We single out the structure of natural numbers through our intuition of the absolute (...) notion of finiteness. (shrink)

We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations \ and \. The set of its minimal elements proves to be very rich, and the \-hierarchy is used to get a better intuition of this richness. We find the place of the set of \-maximal ultrafilters among some known families of ultrafilters. Finally, we introduce new notions of largeness of subsets (...) of \, and compare it to other such notions, important for infinite combinatorics and topological dynamics. (shrink)

Finitely axiomatizable ℵ 1 categorical theories are locally modular.

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)

Tense logics in the bimodal propositional language are investigated with respect to the Finite Model Property. In order to prove positive results techniques from investigations of modal logics above K4 are extended to tense logic. General negative results show the limits of the transfer.

We investigate properties of propositional modal logic over the classof finite structures. In particular, we show that certain knownpreservation theorems remain true over this class. We prove that aclass of finite models is defined by a first-order sentence and closedunder bisimulations if and only if it is definable by a modal formula.We also prove that a class of finite models defined by a modal formulais closed under extensions if and only if it is defined by a -modal formula.

In this paper, we show that the finite model property fails for certain non‐integral semilinear substructural logics including Metcalfe and Montagna's uninorm logic and involutive uninorm logic, and a suitable extension of Metcalfe, Olivetti and Gabbay's pseudo‐uninorm logic. Algebraically, the results show that certain classes of bounded residuated lattices that are generated as varieties by their linearly ordered members are not generated as varieties by their finite members.

The problem of adaptive finite-time fault-tolerant control and output constraints for a class of uncertain nonlinear half-vehicle active suspension systems are investigated in this work. Markovian variables are used to denote in terms of different random actuators failures. In adaptive backstepping design procedure, barrier Lyapunov functions are adopted to constrain vertical motion and pitch motion to suppress the vibrations. Unknown functions and coefficients are approximated by the neural network. Assisted by the stochastic practical finite-time theory and FTC theory, the proposed (...) controller can ensure systems achieve stability in a finite time. Meanwhile, displacement and pitch angle in systems would not violate their maximum values, which imply both ride comfort and safety have been enhanced. In addition, all the signals in the closed-loop systems can be guaranteed to be semiglobal finite-time stable in probability. The simulation results illustrate the validity of the established scheme. (shrink)

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to the (...) -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

We explore a network architecture introduced by Elman (1988) for predicting successive elements of a sequence. The network uses the pattern of activation over a set of hidden units from time-step 25-1, together with element t, to predict element t + 1. When the network is trained with strings from a particular finite-state grammar, it can learn to be a perfect finite-state recognizer for the grammar. When the network has a minimal number of hidden units, patterns on the hidden units (...) come to correspond to the nodes of the grammar, although this correspondence is not necessary for the network to act as a perfect finite-state recognizer. We explore the conditions under which the network can carry information about distant sequential contingencies across intervening elements. Such information is maintained with relative ease if it is.. (shrink)

We prove a finite model theorem and infinitary completeness result for the propositional -calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of well-quasi-orders.

We attempt to formulate issues around modularity and Zilber’s trichotomy in a setting that intersects additive combinatorics. In particular, we update the open problems on quasi-finite structures from [9].

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.

The logic Kf of the modalities of finite, devised to capture the notion of 'there exists a finite number of accessible worlds such that . . . is true', was introduced and axiomatized by Fattorosi. In this paper we enrich the logical framework of Kf: we give consistency properties and a tableau system (which yields the decidability) explicitly designed for Kf, and we introduce a shorter and more natural axiomatization. Moreover, we show the strong and suggestive relationship between Kf and (...) the much older logic of the physical modalities of Burks. (shrink)

The present study addresses the fluid transport behaviour of the flow of gold -copper /biomagnetic blood hybrid nanofluid in an inclined irregular stenosis artery as a consequence of varying viscosity and Lorentz force. The nonlinear flow equations are transformed into dimensionless form by using nonsimilar variables. The finite-difference technique is involved in computing the nonlinear transport dimensionless equations. The significant parameters like angle parameter, the Hartmann number, changing viscosity, constant heat source, the Reynolds number, and nanoparticle volume fraction on the (...) flow field are exhibited through figures. Present results disclose that the Lorentz force strongly lessens the hybrid nanofluid velocity. Elevating the Grashof number values enhances the rate of blood flow. Growing values of the angle parameter cause to reduce the resistance impedance on the wall. Hybrid nanoparticles have a superior wall shear stress than copper nanoparticles. The heat transfer rate is amplifying at the axial direction with the growing values of nanoparticles concentration. The applied Lorentz force significantly reduces the hybrid and unitary nanofluid flow rate in the axial direction. The hybrid nanoparticles expose a supreme rate of heat transfer than the copper nanoparticles in a blood base fluid. Compared to hybrid and copper nanofluid, the blood base fluid has a lower temperature. (shrink)

We give a proof of the finite model property of some fragments of commutative and noncommutative linear logic: the Lambek calculus, BCI, BCK and their enrichments, MALL and Cyclic MALL. We essentially simplify the method used in [4] for proving fmp of BCI and the Lambek ca culus and in [5] for proving fmp of MALL. Our construction of finite models also differs from that used in Lafont [8] in his proof of fmp of MALL.

The tangle modality is a propositional connective that extends basic modal logic to a language that is expressively equivalent over certain classes of finite frames to the bisimulation-invariant fragments of both first-order and monadic second-order logic. This paper axiomatises several logics with tangle, including some that have the universal modality, and shows that they have the finite model property for Kripke frame semantics. The logics are specified by a variety of conditions on their validating frames, including local and global connectedness (...) properties. Some of the results have been used to obtain completeness theorems for interpretations of tangled modal logics in topological spaces. (shrink)

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)

The problem of finite-time tracking control is discussed for a class of uncertain nonstrict-feedback time-varying state delay nonlinear systems with full-state constraints and unmodeled dynamics. Different from traditional finite-control methods, a C 1 smooth finite-time adaptive control framework is introduced by employing a smooth switch between the fractional and cubic form state feedback, so that the desired fast finite-time control performance can be guaranteed. By constructing appropriate Lyapunov-Krasovskii functionals, the uncertain terms produced by time-varying state delays are compensated for and (...) unmodeled dynamics is coped with by introducing a dynamical signal. In order to avoid the inherent problem of “complexity of explosion” in the backstepping-design process, the DSC technology with a novel nonlinear filter is introduced to simplify the structure of the controller. Furthermore, the results show that all the internal error signals are driven to converge into small regions in a finite time, and the full-state constraints are not violated. Simulation results verify the effectiveness of the proposed method. (shrink)

In the longstanding foundational debate whether to require that probability is countably additive, in addition to being finitely additive, those who resist the added condition raise two concerns that we take up in this paper. (1) _Existence_: Settings where no countably additive probability exists though finitely additive probabilities do. (2) _Complete Additivity_: Where reasons for countable additivity don’t stop there. Those reasons entail complete additivity—the (measurable) union of probability 0 sets has probability 0, regardless the cardinality of that union. Then (...) probability distributions are discrete, not continuous. We use Easwaran’s (Easwaran, Thought 2:53–61, 2013) advocacy of the _Comparative_ principle to illustrate these two concerns. Easwaran supports countable additivity, both for numerical probabilities and for finer, qualitative probabilities, by defending a condition he calls the _Comparative_ principle [ \({\mathcal{C}}\) ]. For numerical probabilities, principle \({\mathcal{C}}\) contrasts pairs, P 1 and P 2, defined over a common partition \(\prod\) = {a _i_ : _i_ ∈ I} of measurable events. \({\mathcal{C}}\) requires that no P 1 may be pointwise dominated, i.e., no (finitely additive) probability P 2 exists such that for each _i_ ∈ I, P 2 (a _i_ ) > P 1 (a _i_ ). By design, the cardinality of \(\prod\) is not limited in \({\mathcal{C}}\), which Easwaran asserts is important when arguing that the principle does not require more, or less, than that probability is countably additive. We agree that a numerical probability P satisfies principle \({\mathcal{C}}\) in all partitions just in case P is countably additive. However, we show that for numerical probabilities, by considering the size of the algebra of events to which probability is applied, principle \({\mathcal{C}}\) is subject to each of the above concerns, (1) and (2). Also, Easwaran considers principle \({\mathcal{C}}\) with non-numerical, qualitative probabilities, where a qualitative probability may be finer than an almost agreeing numerical probability P. A qualitative probability is regular if possible events are strictly more likely than impossible events. Easwaran motivates and illustrates regular qualitative probabilities using a continuous, almost agreeing quantitative probability that is uniform on the unit interval. We make explicit the conditions for applying principle \({\mathcal{C}}\) with qualitative probabilities and show that \({\mathcal{C}}\) restricts regular qualitative probabilities to those whose almost agreeing quantitative probabilities are completely additive. For instance, Easwaran’s motivating example of a regular qualitative probability is precluded by principle \({\mathcal{C}}\). (shrink)

We study properties of certain subclasses of the Dedekind finite sets in set theory without the axiom of choice with respect to the comparability of their elements and to the boundedness of such classes, and we answer related open problems from Herrlich’s “The Finite and the Infinite.” The main results are as follows: 1. It is relatively consistent with ZF that the class of all finite sets is not the only finiteness class such that any two of its elements (...) are comparable. 2. The principle “Small Violations of Choice” —introduced by A. Blass—implies that the class of all Dedekind finite sets is bounded above. 3. “The class of all Dedekind finite sets is bounded above” is true in every permutation model of ZFA in which the class of atoms is a set, and in every symmetric model of ZF. 4. There exists a model of ZFA set theory in which the class of all atoms is a proper class and in which the class of all infinite Dedekind finite sets is not bounded above. 5. There exists a model of ZF in which the class of all infinite Dedekind finite sets is not bounded above. (shrink)

Let be a finite collection of finite algebras of finite signature such that SP( ) has meet semi-distributive congruence lattices. We prove that there exists a finite collection 1 of finite algebras of the same signature, , such that SP( 1) is finitely axiomatizable.We show also that if , then SP( 1) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract (...) indicates. (shrink)

A superstable homogeneous structure is said to be simple if every complete type over any set A has a free extension over any B ⊇ A. In this paper we give a characterization for this property in terms of U-rank. As a corollary we get that if the structure has finite U-rank, then it is simple.

When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classical priority constructions can be lifted to any admissible ordinal satisfying a sufficiently strong fragment of the replacement scheme. We show, however, that this is not always the case. In fact, there are some constructions which make an essential use of the notion of finiteness which cannot be replaced by the generalized notion of $\alpha$-finiteness. As examples we discuss bothcodings of models of arithmetic (...) into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. We show that if an admissible ordinal $\alpha$ is effectively close to $\omega$ (where this closeness can be measured by size or by cofinality) then such constructions maybe performed in the $\alpha$-r.e. degrees, but otherwise they fail. The results of these constructions can be expressed in the first-order language of partially ordered sets, and so these results also show that there are natu. (shrink)

A finitely alternative normal tense logic \ is a normal tense logic characterized by frames in which every point has at most n future alternatives and m past alternatives. The structure of the lattice \\) is described. There are \ logics in \\) without the finite model property, and only one pretabular logic in \\). There are \ logics in \\) which are not finitely axiomatizable. For \, there are \ logics in \\) without the FMP, and infinitely many pretabular (...) extensions of \. (shrink)