The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...) logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

The dialogue Bruno of 1802 is arguably the natural starting point for any investigation on the concepts of finitude, evil and human freedom in Schelling’s middle metaphysics. In this dialogue the author elaborates for the first time in his system a concept of freedom and independence of the finite, which extends via his reformulation in Philosophy and Religion of 1804 to the Freedom Essay of 1809 and beyond to the works of 1810 and 1811 – Stuttgart Private Lectures and The (...) Ages of the World. The central ontological problem of the dialogue relates to the possibility of a separation between the absolute and the world as space of finite beings, which, according to the system of identity first presented in 1801, cannot exist as such. The question we will then address concerns the status of the finite as such and how would it be possible to admit both its existence for consciousness and the positing of an absolute and infinite principle of philosophy. We will show how Schelling’s interest shifts, almost unintentionally, from the infinite principle to the finite as such, as a principle of freedom and self-initiation independent of the real. (shrink)

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)

This book is a rich collection of philosophical essays radically interrogating key notions and preoccupations of the phenomenological tradition. While using Heidegger’s Being and Time as its permanent point of reference and dispute, this collection also confronts other important philosophers, such as Kant, Nietzsche, and Derrida. The projects of these pivotal thinkers of finitude are relentlessly pushed to their extreme, with respect both to their unexpected horizons and to their as yet unexplored analytical potential. A Finite Thinking shows that, paradoxically, (...) where the thought of finitude comes into its own it frees itself, not only to reaffirm a certain transformed and transformative presence, but also for a non-religious reconsideration and reaffirmation of certain theologemes, as well as of the body, heart, and love. This book shows the literary dimension of philosophical discourse, providing important enabling ideas for scholars of literature, cultural theory, and philosophy. (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)

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.

Formal learning theory constitutes an attempt to describe and explain the phenomenon of learning, in particular of language acquisition. The considerations in this domain are also applicable in philosophy of science, where it can be interpreted as a description of the process of scientific inquiry. The theory focuses on various properties of the process of hypothesis change over time. Treating conjectures as informational states, we link the process of conjecture-change to epistemic update. We reconstruct and analyze the temporal aspect of (...) learning in the context of dynamic and temporal logics of epistemic change. We first introduce the basic formal notions of learning theory and basic epistemic logic. We provide a translation of the components of learning scenarios into the domain of epistemic logic. Then, we propose a characterization of finite identifiability in an epistemic temporal language. In the end we discuss consequences and possible extensions of our work. (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.

We use the apparatus of the canonical formulas introduced by Zakharyaschev [10] to prove that all finitely axiomatizable normal modal logics containing K4.3 are decidable, though possibly not characterized by classes of finite frames. Our method is purely frame-theoretic. Roughly, given a normal logic L above K4.3, we enumerate effectively a class of frames with respect to which L is complete, show how to check effectively whether a frame in the class validates a given formula, and then apply a Harropstyle (...) argument to establish the decidability of L, provided of course that it has finitely many axioms. (shrink)

Our investigation is concerned with the finite model property with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, (...) S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics have fmp w.r.t. admissibility. (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.

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 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.

We provide a canonical construction of conformal covers for finite hypergraphs and present two immediate applications to the finite model theory of relational structures. In the setting of relational structures, conformal covers serve to construct guarded bisimilar companion structures that avoid all incidental Gaifman cliques-thus serving as a partial analogue in finite model theory for the usually infinite guarded unravellings. In hypergraph theoretic terms, we show that every finite hypergraph admits a bisimilar cover by a finite conformal hypergraph. In terms (...) of relational structures, we show that every finite relational structure admits a guarded bisimilar cover by a finite structure whose Gaifman cliques are guarded. One of our applications answers an open question about a clique constrained strengthening of the extension property for partial automorphisms (EPPA) of Hrushovski, Herwig and Lascar. A second application provides an alternative proof of the finite model property (FMP) for the clique guarded fragment of first-order logic CGF, by reducing (finite) satisfiability in CGF to (finite) satisfiability in the guarded fragment, GF. (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)

We introduce insertion domains that support the placement of new, higher, vertices into finite trees. We prove that every nonincreasing insertion domain has an element with simple structural properties in the style of classical Ramsey theory. This result is proved using standard large cardinal axioms that go well beyond the usual axioms for mathematics. We also establish that this result cannot be proved without these large cardinal axioms. We also introduce insertion rules that specify the placement of new, higher, vertices (...) into finite trees. We prove that every insertion rule greedily generates a tree with these same structural properties; and every decreasing insertion rule generates (or admits) a tree with these same structural properties. It is also necessary and sufficient to use the same large cardinals (in the precise sense of Corollary D.25). The results suggest new areas of research in discrete mathematics called "Ramsey tree theory" and "greedy Ramsey theory" which demonstrably require more than the usual axioms for mathematics. (shrink)

A geometrical interpretation of independence and exchangeability leads to understanding the failure of de Finetti's theorem for a finite exchangeable sequence. In particular an exchangeable sequence of length r which can be extended to an exchangeable sequence of length k is almost a mixture of independent experiments, the error going to zero like 1/k.

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.

We say that a first order theoryTislocally finiteif every finite part ofThas a finite model. It is the purpose of this paper to construct in a uniform way for any consistent theoryTa locally finite theory FIN which is syntactically isomorphic toT.Our construction draws upon the main idea of Paris and Harrington [6] and generalizes the syntactic aspect of their result from arithmetic to arbitrary theories. The first mathematically strong locally finite theory, called FIN, was defined in [1]. Now we get (...) much stronger ones, e.g. FIN.From a physicalistic point of view the theorems of ZF and their FIN-counterparts may have the same meaning. Therefore FIN is a solution of Hilbert's second problem. It eliminates ideal objects from the proofs of properties of concrete objects.In [4] we will demonstrate that one can develop a direct finitistic intuition that FIN is locally finite. We will also prove a variant of Gödel's second incompleteness theorem for the theory FIN and for all its primitively recursively axiomatizable consistent extensions.The results of this paper were announced in [3]. (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 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.

In this paper we describe the well-founded initial segment of the free Heyting algebra ������α on finitely many, α, generators. We give a complete classification of initial sublattices of ������₂ isomorphic to ������₁ (called 'low ladders'), and prove that for 2 < α < ω, the height of the well-founded initial segment of ������α.

We generalize the result of non-finite axiomatizability of totally categorical first-order theories from elementary model theory to homogeneous model theory. In particular, we lift the theory of envelopes to homogeneous model theory and develope theory of imaginaries in the case of ω-stable homogeneous classes of finite U-rank.

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)

By operations on models we show how to relate completeness with respect to permissivenominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal models, so the construction hinges on generating from an instance of the latter, some instance of the former in which sufficiently many inequalities are preserved between elements. We do this using an infinite generalisation of nominal atoms-abstraction. The results are of interest in their own right, (...) but also, we factor the mathematics so as to maximise the chances that it could be used off-the-shelf for other nominal reasoning systems too. Models with infinite support can be easier to work with, so it is useful to have a semi-automatic theorem to transfer results from classes of infinitely-supported nominal models to the more restricted class of models with finite support. In conclusion, we consider different permissive-nominal syntaxes and nominal models and discuss how they relate to the results proved here. (shrink)

Finite-state methods are applied to determine the consequences of events, represented as strings of sets of fluents. Developed to flesh out events used in natural language semantics, the approach supports reasoning about action in AI, including the frame problem and inertia. Representational and inferential aspects of the approach are explored, centering on conciseness of language, context update and constraint application with bias.

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)

We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. $\mathbf{Theorem A:}$ if a variety in a finite language is congruence meet-semidistributive and residually less than some finite cardinal, then it is finitely based. $\mathbf{Theorem B:}$ there is an algorithm which, given $m < \omega$ and a finite algebra in a finite language, determines whether the variety generated by the algebra is congruence meet-semidistributive and residually less than m.

Entanglement and non-locality are non-classical global characteristics of quantum states important to the foundations of quantum mechanics. Recent investigations have shown that environmental noise, even when it is entirely local in influence, can destroy both of these properties in finite time despite giving rise to full quantum state decoherence only in the infinite time limit. These investigations, which have been carried out in a range of theoretical and experimental situations, are reviewed here.

Quasi-set theory is a ZFU-like axiomatic set theory, which deals with two kinds of ur-elements: M-atoms, objects like the atoms of ZFU, and m-atoms, items for which the usual identity relation is not defined. One of the motivations to advance such a theory is to deal properly with collections of items like particles in non-relativistic quantum mechanics when these are understood as being non-individuals in the sense that they may be indistinguishable although identity does not apply to them. According to (...) some authors, this is the best way to understand quantum objects. The fact that identity is not defined for m-atoms raises a technical difficulty: it seems impossible to follow the usual procedures to define the cardinal of collections involving these items. In this paper we propose a definition of finite cardinals in quasi-set theory which works for collections involving m-atoms. (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)

Any interpretation of Hegel which stresses both his deep dependence on and radical revision of Kant must account for the nature of the difference between what Hegel calls a merely finite idealism and a so-called ’Absolute Idealism’. Such a clarification in turn depends on understanding Hegel’s claim to have preserved the distinguishability of intuition and concept, but to have insisted on their inseparability, or, to have defended their ’organic’ rather than ’mechanical’ relation. This is the main issue in this chapter, (...) which invokes John McDowell’s notion of ’the unboundedness of the conceptual’ to clarify the issue, as well as noting a number of similar claims in Wittgenstein. The implications of Hegel’s view for the issues of metaphysics generally is explored. (shrink)

Neo-Fregeanism contends that knowledge of arithmetic may be acquired by second-order logical reflection upon Hume's principle. Heck argues that Hume's principle doesn't inform ordinary arithmetical reasoning and so knowledge derived from it cannot be genuinely arithmetical. To suppose otherwise, Heck claims, is to fail to comprehend the magnitude of Cantor's conceptual contribution to mathematics. Heck recommends that finite Hume's principle be employed instead to generate arithmetical knowledge. But a better understanding of Cantor's contribution is achieved if it is supposed that (...) Hume's principle really does inform arithmetical practice. More generally, Heck's arguments misconceive the epistemological character of neo-Fregeanism. (shrink)

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)

We prove that NIP valued fields of positive characteristic are henselian, and we begin to generalize the known results on dp-minimal fields to dp-finite fields. On any unstable dp-finite field K, we define a type-definable group of “infinitesimals,” corresponding to a canonical group topology on (K, +). We reduce the classification of positive characteristic dp-finite fields to the construction of non-trivial Aut(K/A)-invariant valuation rings.

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can (...) be approximated by finite-valued logics. It is shown that the minimal m-valued logic for which a given calculus is strongly sound can be calculated. It is also investigated under which conditions propositional logics can be characterized as the intersection of (effectively given) sequences of finite-valued logics. (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 this paper we describe, in a purely algebraic language, truth-complete finite-valued propositional logical calculi extending the classical Boolean calculus. We also give a new proof of the Completeness Theorem for such calculi. We investigate the quasi-varieties of algebras playing an analogous role in the theory of these finite-valued logics to the role played by the variety of Boolean algebras in classical logic.

0.0. Theistic Ethics as a Challenge and a Diagnostic Tool. Naturalistic conceptions in metaethics come in many varieties. Many philosophers who have sought to situate moral reasoning in a naturalistic metaphysical conception have thought it necessary to adopt non-cognitivist, prescriptivist, projectivist, relativist, or otherwise deflationary conceptions. Recently there has been a revival of interest in non-deflationary moral realist approaches to ethical naturalism. Many non-deflationary approaches have exploited the resources of non-empiricist “causal” or “naturalistic” conceptions of reference and of kind definitions (...) in service of the “naturalistic” metaphilosophical conception that substantive moral questions, and questions about the metaphysics of morals, are broadly a posteriori questions, somewhat analogous to scientific questions, and are not amenable to a priori resolution by “conceptual analysis.”. (shrink)

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