We show how to interpret Heyting's arithmetic in an intuitionistic version of TT, Russell's Simple Theory of Types. We also exhibit properties of finite sets in this theory and compare them with the corresponding properties in classical TT. Finally, we prove that arithmetic can be interpreted in intuitionistic TT, the subsystem of intuitionistic TT involving only three types. The definitions of intuitionistic TT and its finite sets and natural numbers are obtained in a straightforward way from the classical (...) definitions. This is very natural and seems to make intuitionistic TT an interesting intuitionistic set theory to study, beside intuitionistic ZF. (shrink)

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)

In this paper, we prove that Heyting's arithmetic can be interpreted in an intuitionistic version of Russell's Simple Theory of Types without extensionality.

Introduction Major scientific revolutions are rarely, if ever, started deliberately. They can be "in the air" for a long time before the first recognizable ...

Despite his commitment to universal explicability, a case can be made that Hegel is better labelled an idealist than a naturalist. As an analysis of his three syllogisms of philosophy reveals, he strictly differentiates between the domains of nature and Geist, suggesting in sequence that Geist replaces nature, Geist comprehends nature and that Geist and nature are comprehended as forms of the metaphysical idea and determine and mediate each other. Since Hegel grounds his accounts of the (...) metaphysical idea and its forms nature and Geist in concept-metaphysics and these include a supernatural notion of undetermined, self-positing universality, Hegel’s entire ontological edifice is ultimately supernatural. This stands in stark contrast to the metaphysics of naturalism, which are based on categories Hegel associates with the logics of being and essence or which fail to sufficiently emancipate universality from its immediate connection to particularity. (shrink)

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)

Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions (...) of the connectives in question. (shrink)

It is proved that in a suitable intuitionistic, locally classical, version of the theory ZFC deprived of the axiom of infinity, the requirement that every set be finite is equivalent to the assertion that every ordinal is a natural number. Moreover, the theory obtained with the addition of these finiteness assumptions is equivalent to a theory of hereditarily finite sets, developed by Previale in "Induction and foundation in the theory of hereditarily finite sets." This solves some problems (...) stated there. The analysis is undertaken using for each of these results a limited fragment of the relevant theory. (shrink)

We study definability in terms of monotone generalized quantifiers satisfying Isomorphism Closure, Conservativity and Extension. Among the quantifiers with the latter three properties - here called CE quantifiers - one finds the interpretations of determiner phrases in natural languages. The property of monotonicity is also linguistically ubiquitous, though some determiners like an even number of are highly non-monotone. They are nevertheless definable in terms of monotone CE quantifiers: we give a necessary and sufficient condition for such definability. We further identify (...) a stronger form of monotonicity, called smoothness, which also has linguistic relevance, and we extend our considerations to smooth quantifiers. The results lead us to propose two tentative universals concerning monotonicity and natural language quantification. The notions involved as well as our proofs are presented using a graphical representation of quantifiers in the so-called number triangle. (shrink)

This essay argues that Spinoza believed that each finite mode is absolutely necessitated by God's nature and is causally necessitated by the laws of nature in conjunction with other finite modes. A geometrical analogy from Part 2 of the Ethics is employed in order to give a more suggestive account of the ways in which all things are necessary, according to Spinoza.

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)

Natural argument is represented as the limit, to which an infinite Turing process converges. A Turing machine, in which the bits are substituted with qubits, is introduced. That quantum Turing machine can recognize two complementary natural arguments in any data. That ability of natural argument is interpreted as an intellect featuring any quantum computer. The property is valid only within a quantum computer: To utilize it, the observer should be sited inside it. Being outside it, the observer would obtain quite (...) different result depending on the degree of the entanglement of the quantum computer and observer. All extraordinary properties of a quantum computer are due to involving a converging infinite computational process contenting necessarily both a continuous advancing calculation and a leap to the limit. Three types of quantum computation can be distinguished according to whether the series is a finite one, an infinite rational or irrational number. -/- . (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.

We prove that all finitely axiomatizable tense logics with temporal operators for ‘always in the future’ and ‘always in the past’ and determined by linear fows time are coNP-complete. It follows, for example, that all tense logics containing a density axiom of the form ■n+1F p → nF p, for some n ≥ 0, are coNP-complete. Additionally, we prove coNP-completeness of all ∩-irreducible tense logics. As these classes of tense logics contain many Kripke incomplete bimodal logics, we obtain many natural (...) examples of Kripke incomplete normal bimodal logics which are nevertheless coNP-complete. (shrink)

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)

A system of finite mathematics is proposed that has all of the power of classical mathematics. I believe that finite mathematics is not committed to any form of infinity, actual or potential, either within its theories or in the metalanguage employed to specify them. I show in detail that its commitments to the infinite are no stronger than those of primitive recursive arithmetic. The finite mathematics of sets is comprehensible and usable on its own terms, without appeal (...) to any form of the infinite. That makes it possible to, without circularity, obtain the axioms of full Zermelo-Fraenkel Set Theory with the Axiom of Choice (ZFC) by extrapolating (in a precisely defined technical sense) from natural principles concerning finite sets, including indefinitely large ones. The existence of such a method of extrapolation makes it possible to give a comparatively direct account of how we obtain knowledge of the mathematical infinite. The starting point for finite mathematics is Mycielski's work on locally finite theories. (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)

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)

A cutset of H is a subset of ∪ H which meets every element of H.H has the finite cutset property if every cutset of H contains a finite one. We study this notion, and in particular how it is related to the compactness of H for the natural topology. MSC: 04A20, 54D30.

This book gives a comprehensive overview of central themes of finite model theory – expressive power, descriptive complexity, and zero-one laws – together with selected applications relating to database theory and artificial intelligence, especially constraint databases and constraint satisfaction problems. The final chapter provides a concise modern introduction to modal logic, emphasizing the continuity in spirit and technique with finite model theory. This underlying spirit involves the use of various fragments of and hierarchies within first-order, second-order, fixed-point, and (...) infinitary logics to gain insight into phenomena in complexity theory and combinatorics. The book emphasizes the use of combinatorial games, such as extensions and refinements of the Ehrenfeucht-Fraissé pebble game, as a powerful way to analyze the expressive power of such logics, and illustrates how deep notions from model theory and combinatorics, such as o-minimality and treewidth, arise naturally in the application of finite model theory to database theory and AI. Students of logic and computer science will find here the tools necessary to embark on research into finite model theory, and all readers will experience the excitement of a vibrant area of the application of logic to computer science. (shrink)

In many classes of structures, each computable structure has computable dimension 1 or $\omega$. Nevertheless, Goncharov showed that for each $n < \omega$, there exists a computable structure with computable dimension $n$. In this paper we show that, under one natural definition of relativized computable dimension, no computable structure has finite relativized computable dimension greater than 1.

In this paper, we consider, for a set \ of natural numbers, the following notions of finitenessFIN1:There are a natural number l and a bijection f between \\);FIN5:It is not the case that \\), and infinitenessINF1:There are not a natural number l and a bijection f between \\);INF5:\\). In this paper, we systematically compare them in the method of constructive reverse mathematics. We show that the equivalence among them can be characterized by various combinations of induction axioms and non-constructive principles, (...) including the axiom of bounded comprehension. (shrink)

The complexity of aII 4 set of natural numbers is encoded into a linear order to show that the finite condensation of a recursive linear order can beII 2–II 1. A priority argument establishes the same result, and is extended to a complete classification of finite condensations iterated finitely many times.

The grounding of semiotics in the finiteness of cognition is extended into constructs and methods for analysis by incorporating the assumption that cognition can be similar within and between agents. After examining and formalizing cognitive similarity as an ontological commitment, the recurrence of cognitive states is examined in terms of a “cognitive set.” In the individual, the cognitive set is seen as evolving under the bidirectional, cyclical determination of thought by the historical environment. At the population level, the distributed “global” (...) cognitive set is argued to be constrained to a manifold in which the cognition of individuals is determined only when their cognitive sets meet certain conditions in the world: a result seen as consistent with Lotman’s semiosphere. With these foundations in place, dimensional modelling of the semiosic field is inaugurated. Firstly, measures of cognitive similarity are formalized as cognitive “distance” and on this basis the concept of a semiotic vector is defined. Secondly, semiotic vectors are seen to shape a general pattern of oscillation in semiosis, and thus to imply zero points in semiosic potential. Thirdly, semiosic oscillation in individual agents is shown to be consistent with a novel diachronic or longitudinal interpretation of Greimas’ semiotic square expanded into a “semiotic pipe” in which cognition traverses an n-dimensional space structured by axes of oscillation. Finally, the expanded theory of finite semiotics is advanced as a useful basis for two new complementary disciplines: a computational, mathematical science of “natural semiotic processing” to trace and model semiotic vectors and oscillation; and an ethical, rhetorical art of “technological influencing” to guide its inputs and applications. (shrink)

Relation algebras were invented by Tarski and his collaborators in the middle of the 20th century. The concept of integrality arose naturally early in the history of the subject, as did various constructions of finite integral relation algebras. Later the concept of finite-dimensionality was introduced for classifying nonrepresentable relation algebras. This concept is closely connected to the number of variables used in proofs in first-order logic. Some results on these topics are presented in chronological order.

Idealization in mathematics, by its very nature, generates a gap between the theoretical and the practical. This article constitutes an examination of two individual, yet similarly created, cases of mathematical idealization. Each involves using a theoretical extension beyond the finite limits which exist in practice regarding human activities, experiences, and perceptions. Scrutiny of details, however, brings out substantial differences between the two cases, not only in regard to the roles played by the idealized entities, but also in regard (...) to appropriate criteria for justifying the use of such entities. The background information supplied and the examples chosen for analysis in this paper were selected from the areas of measurement theory, probability theory, mathematical logic, and philosophy of mathematics. (shrink)

Idealization in mathematics, by its very nature, generates a gap between the theoretical and the practical. This article constitutes an examination of two individual, yet similarly created, cases of mathematical idealization. Each involves using a theoretical extension beyond the finite limits which exist in practice regarding human activities, experiences, and perceptions. Scrutiny of details, however, brings out substantial differences between the two cases, not only in regard to the roles played by the idealized entities, but also in regard (...) to appropriate criteria for justifying the use of such entities. The background information supplied and the examples chosen for analysis in this paper were selected from the areas of measurement theory, probability theory, mathematical logic, and philosophy of mathematics. (shrink)

Objects appear to fall into different sorts, each with their own criteria for identity. This raises the question of whether sorts overlap. Abstractionists about numbers—those who think natural numbers are objects characterized by abstraction principles—face an acute version of this problem. Many abstraction principles appear to characterize the natural numbers. If each abstraction principle determines its own sort, then there is no single subject-matter of arithmetic—there are too many numbers. That is, unless objects can belong to more than one sort. (...) But if there are multi-sorted objects, there should be cross-sortal identity principles for identifying objects across sorts. The going cross-sortal identity principle, ECIA2 of Cook and Ebert (2005), solves the problem of too many numbers. But, I argue, it does so at a high cost. I therefore propose a novel cross-sortal identity principle, based on embeddings of the induced models of abstracts developed by Walsh (2012). The new criterion matches ECIA2’s success, but offers interestingly different answers to the more controversial identifications made by ECIA2. (shrink)

One of the main themes in Spinoza’s Ethics is the issue of human freedom: What does it consist in and how may it be attained? Spinoza’s ethical views crucially depend on his metaphysical theory, and this close connection provides the answer to several central questions concerning Spinoza’s conception of human freedom. Firstly, how can we accommodate human freedom within Spinoza’s necessitarianism—in the context of which Spinoza rejects the notion of a free will? Secondly, how can humans, as merely finite (...) beings, genuinely attain freedom? Can Spinoza defend his claim that we may even attain blessedness? I will argue that these questions are answered by appeal to a twofold in human nature. According to Spinoza, we are finite in infinity. (shrink)

We show that a form of dependence known as G-dependence admits a very natural finite axiomatization, as well as Armstrong relations. We also give an explicit translation between functional dependence and G-dependence.

I would like to make some further clarifying remarks about the nature of learning machines, or finite automata as they are more generally known these days. It is clear from much that has recently been written on this subject that there are still many misunderstandings about their capacity and significance.

LetN. be the set of all natural numbers, and letD n * = {k N k|n} {0} wherek¦n if and only ifn=k.x f or somexN. Then, an ordered setD n * = D n *, n, wherex ny iffx¦y for anyx, yD n *, can easily be seen to be a pseudo-boolean algebra.In [5], V.A. Jankov has proved that the class of algebras {D n * nB}, whereB =, {k N is finitely axiomatizable.

000000001. Introduction Call a theory of the good—be it moral or prudential—aggregative just in case (1) it recognizes local (or location-relative) goodness, and (2) the goodness of states of affairs is based on some aggregation of local goodness. The locations for local goodness might be points or regions in time, space, or space-time; or they might be people, or states of nature.1 Any method of aggregation is allowed: totaling, averaging, measuring the equality of the distribution, measuring the minimum, etc.. (...) Call a theory of the good finitely additive just in case it is aggregative, and for any finite set of locations it aggregates by adding together the goodness at those locations. Standard versions of total utilitarianism typically invoke finitely additive value theories (with people as locations). A puzzle can arise when finitely additive value theories are applied to cases involving an infinite number of locations (people, times, etc.). Suppose, for example, that temporal locations are the locus of value, and that time is discrete, and has no beginning or end.2 How would a finitely additive theory (e.g., a temporal version of total utilitarianism) judge the following two worlds? Goodness at Locations (e.g. times) w1:..., 2, 2, 2, 2, 2, 2, 2, 2, 2, ..... w2:..., 1, 1, 1, 1, 1, 1, 1, 1, 1, ..... Example 1 At each time w1 contains 2 units of goodness and w2 contains only 1. Intuitively, we claim, if the locations are the same in each world, finitely additive theorists will want to claim that w1 is better than w2. But it's not clear how they could coherently hold this view. For using standard mathematics the sum of each is the same infinity, and so there seems to be no basis for claiming that one is better than the other.3 (Appealing to Cantorian infinities is of no help here, since for any Cantorian infinite N, 2xN=1xN.). (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)

We prove that the finite-model version of arithmetic with the divisibility relation is undecidable . Additionally we prove FM-representability theorem for this class of finite models. This means that a relation R on natural numbers can be described correctly on each input on almost all finite divisibility models if and only if R is of degree ≤0′. We obtain these results by interpreting addition and multiplication on initial segments of finite models with divisibility only.

Feynman's sum-over-histories formulation of quantum mechanics has been considered a useful calculational tool in which virtual Feynman histories entering into a coherent quantum superposition cannot be individually measured. Here we show that sequential weak values, inferred by consecutive weak measurements of projectors, allow direct experimental probing of individual virtual Feynman histories, thereby revealing the exact nature of quantum interference of coherently superposed histories. Because the total sum of sequential weak values of multitime projection operators for a complete set of (...) orthogonal quantum histories is unity, complete sets of weak values could be interpreted in agreement with the standard quantum mechanical picture. We also elucidate the relationship between sequential weak values of quantum histories with different coarse graining in time and establish the incompatibility of weak values for nonorthogonal quantum histories in history Hilbert space. Bridging theory and experiment, the presented results may enhance our understanding of both weak values and quantum histories. (shrink)

Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with par- tial valuations. The usual regular constructs (concatena- tion, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.

World-leading anthropologists and philosophers pursue the perplexing question fundamental to both disciplines: What is it to think of ourselves as human? A common theme is the open-ended and context-dependent nature of our notion of the human, one upshot of which is that perplexities over that notion can only be dealt with in a piecemeal fashion, and in relation to concrete real-life circumstances. Philosophical anthropology, understood as the exploration of such perplexities, will thus be both recognizably philosophical in character and (...) inextricably bound up with anthropological fieldwork. The volume is put together accordingly: Precisely by mixing ostensibly philosophical papers with papers that engage in close anthropological study of concrete issues, it is meant to reflect the vital tie between these two aspects of the overall philosophical-anthropological enterprise. The collection will be of great interest to philosophers and anthropologists alike, and essential reading for anyone interested in the interconnections between the two disciplines. (shrink)

SummaryFinite, or Fermat arithmetic, as we call it, differs from Peano arithmetic in that it does not involve the existence of an infinite set or Peano's induction postulate. Fermat's method of infinite descent takes the place of bound induction, and we show that a con‐structivist interpretation of logical connectives and quantifiers can account for the predicative finitary nature of Fermat's arithmetic. A non‐set‐theoretic arithemetical logic thus seems best suited to a constructivist‐inspired number theory.