We present a comprehensive study of the axiom schemas IΣ - n , BΣ - n (induction and collection schemas for parameter free Σ n formulas) and some closely related schemas.

We characterize the sets of all Π2 and all equation image theorems of IΠ−1 in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ−n + 1 is conservative over IΣ−n with respect to equation image sentences cannot be extended to Πn + 2 sentences. © 2011 WILEY-VCH Verlag (...) GmbH & Co. KGaA, Weinheim. (shrink)

Consider the following restriction of the polymorphically typed lambda calculus . All quantifications are parameter free. In other words, in every universal type α.τ, the quantified variable α is the only free variable in the scope τ of the quantification. This fragment can be locally proven terminating in a system of intuitionistic second-order arithmetic known to have strength of finitely iterated inductive definitions.

Abstract.This paper is the second in a series of three culminating in an ordinal analysis of Π12-comprehension. Its objective is to present an ordinal analysis for the subsystem of second order arithmetic with Δ12-comprehension, bar induction and Π12-comprehension for formulae without set parameters. Couched in terms of Kripke-Platek set theory, KP, the latter system corresponds to KPi augmented by the assertion that there exists a stable ordinal, where KPi is KP with an additional axiom stating that every set is (...) contained in an admissible set. (shrink)

We introduce a new axiom called inductive dichotomy, a weak variant of the axiom of inductive definition, and analyze the relationships with other variants of inductive definition and with related axioms, in the general second order framework, including second order arithmetic, second order set theory and higher order arithmetic. By applying these results to the investigations on the determinacy axioms, we show the following. (i) Clopen determinacy is consistency-wise strictly weaker than open determinacy in these frameworks, except second order arithmetic; (...) this is an enhancement of Schweber–Hachtman separation of open and clopen determinacy into the consistency-wise separation. (ii) Hausdorff–Kuratowski hierarchy of differences of opens is faithfully reflected by the hierarchy of consistency strengths of corresponding parameter-free determinacies in the aforementioned frameworks; this result is valid also in second order arithmetic only except clopen determinacy. (shrink)

We show that Matijasevič's Theorem on the diophantine representation of r.e. predicates is provable in the subsystem I ∃ - 1 of Peano Arithmetic formed by restricting the induction scheme to diophantine formulas with no parameters. More specifically, I ∃ - 1 ⊢ IE - 1 + E ⊢ Matijasevič's Theorem where IE - 1 is the scheme of parameter-free bounded existential induction and E is an ∀∃ axiom expressing the existence of a function of exponential (...) growth. We conclude by examining the consequences of these results to the structure of countable nonstandard models of IE - 1. (shrink)

We study the fragment of Peano arithmetic formalizing the induction principle for the class of decidable predicates, $I\Delta_1$ . We show that $I\Delta_1$ is independent from the set of all true arithmetical $\Pi_2-sentences$ . Moreover, we establish the connections between this theory and some classes of oracle computable functions with restrictions on the allowed number of queries. We also obtain some conservation and independence results for parameter free and inference rule forms of $\Delta_1-induction$ . An open (...) problem formulated by J. Paris is whether $I\Delta_1$ proves the corresponding least element principle for decidable predicates, $L\Delta_1$ (or, equivalently. the $\Sigma_1-collection$ principle $B\Sigma_1$ ). We reduce this question to a purely computation-theoretic one. (shrink)

In this paper we study local induction w.r.t. Σ1‐formulas over the weak arithmetic. The local induction scheme, which was introduced in, says roughly this: for any virtual class that is progressive, i.e., is closed under zero and successor, and for any non‐empty virtual class that is definable by a Σ1‐formula without parameters, the intersection of and is non‐empty. In other words, we have, for all Σ1‐sentences S, that S implies, whenever is progressive. Since, in the weak context, we (...) have (at least) two definitions of Σ1, we obtain two minimal theories of local induction w.r.t. Σ1‐formulas, which we call Peano Corto and Peano Basso.In the paper we give careful definitions of Peano Corto and Peano Basso. We establish their naturalness both by giving a model theoretic characterization and by providing an equivalent formulation in terms of a sentential reflection scheme.The theories Peano Corto and Peano Basso occupy a salient place among the sequential theories on the boundary between weak and strong theories. They bring together a powerful collection of principles that is locally interpretable in. Moreover, they have an important role as examples of various phenomena in the metamathematics of arithmetical (and, more generally, sequential) theories. We illustrate this by studying their behavior w.r.t. interpretability, model interpretability and local interpretability. In many ways the theories are more like Peano arithmetic or Zermelo Fraenkel set theory, than like finitely axiomatized theories as Elementary Arithmetic, and. On the one hand, Peano Corto and Peano Basso are very weak: they are locally cut‐interpretable in. On the other hand, they behave as if they were strong: they are not contained in any consistent finitely axiomatized arithmetical theory, however strong. Moreover, they extend, the theory of parameter‐free Π1‐induction. (shrink)

We study the arithmetical schema asserting that every eventually decreasing elementary recursive function has a limit. Some other related principles are also formulated. We establish their relationship with restricted parameter-free induction schemata. We also prove that the same principle, formulated as an inference rule, provides an axiomatization of the Σ2-consequences of IΣ1.Using these results we show that ILM is the logic of Π1-conservativity of any reasonable extension of parameter-free Π1-induction schema. This result, however, cannot (...) be much improved: by adapting a theorem of D. Zambella and G. Mints we show that the logic of Π1-conservativity of primitive recursive arithmetic properly extends ILM.In the third part of the paper we give an ordinal classification of -consequences of the standard fragments of Peano arithmetic in terms of reflection principles. This is interesting in view of the general program of ordinal analysis of theories, which in the most standard cases classifies Π-classes of sentences. (shrink)

This book is a contribution to the flourishing field of formal and philosophical work on truth and the semantic paradoxes. Our aim is to present several theories of truth, to investigate some of their model-theoretic, recursion-theoretic and proof-theoretic aspects, and to evaluate their philosophical significance. In Part I we first outline some motivations for studying formal theories of truth, fix some terminology, provide some background on Tarski’s and Kripke’s theories of truth, and then discuss the prospects of classical type-free (...) truth. In Chapter 4 we discuss some minimal adequacy conditions on a satisfactory theory of truth based on the function that the truth predicate is intended to fulfil on the deflationist account. We cast doubt on the adequacy of some non-classical theories of truth and argue in favor of classical theories of truth. Part II is devoted to grounded truth. In chapter 5 we introduce a game-theoretic semantics for Kripke’s theory of truth. Strategies in these games can be interpreted as reference-graphs of the sentences in question. Using that framework, we give a graph-theoretic analysis of the Kripke-paradoxical sentences. In chapter 6 we provide simultaneous axiomatizations of groundedness and truth, and analyze the proof-theoretic strength of the resulting theories. These range from conservative extensions of Peano arithmetic to theories that have the full strength of the impredicative system ID1. Part III investigates the relationship between truth and set-theoretic comprehen- sion. In chapter 7 we canonically associate extensions of the truth predicate with Henkin-models of second-order arithmetic. This relationship will be employed to determine the recursion-theoretic complexity of several theories of grounded truth and to show the consistency of the latter with principles of generalized induction. In chapter 8 it is shown that the sets definable over the standard model of the Tarskian hierarchy are exactly the hyperarithmetical sets. Finally, we try to apply a certain solution to the set-theoretic paradoxes to the case of truth, namely Quine’s idea of stratification. This will yield classical disquotational theories that interpret full second-order arithmetic without set parameters, Z2- . We also indicate a method to recover the parameters. An appendix provides some background on ordinal notations, recursion theory and graph theory. (shrink)

By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first-order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. (...) As a consequence, we obtain results on the quantifier complexity, finite axiomatizability and relative strength of schemes for Δn+1-formulas. (shrink)

It is well-known (due to C. Parsons) that the extension of primitive recursive arithmeticPRA by first-order predicate logic and the rule ofΠ 2 0 -inductionΠ 2 0 -IR isΠ 2 0 -conservative overPRA. We show that this is no longer true in the presence of function quantifiers and quantifier-free choice for numbersAC 0,0-qf. More precisely we show that ℐ :=PRA 2 +Π 2 0 -IR+AC 0,0-qf proves the totality of the Ackermann function, wherePRA 2 is the extension ofPRA by (...) number and function quantifiers andΠ 2 0 -IR may contain function parameters.This is true even forPRA 2 +∑ 1 0 -IR+Π 2 0 -IR −+AC 0,0-qf, whereΠ 2 0 -IR − is the restriction ofΠ 2 0 -IR without function parameters. (shrink)

It is well-known (due to C. Parsons) that the extension of primitive recursive arithmeticPRA by first-order predicate logic and the rule ofΠ 2 0 -inductionΠ 2 0 -IR isΠ 2 0 -conservative overPRA. We show that this is no longer true in the presence of function quantifiers and quantifier-free choice for numbersAC 0,0-qf. More precisely we show that ℐ :=PRA 2 +Π 2 0 -IR+AC 0,0-qf proves the totality of the Ackermann function, wherePRA 2 is the extension ofPRA by (...) number and function quantifiers andΠ 2 0 -IR may contain function parameters. This is true even forPRA 2 +∑ 1 0 -IR+Π 2 0 -IR −+AC 0,0-qf, whereΠ 2 0 -IR − is the restriction ofΠ 2 0 -IR without function parameters. (shrink)

It is well-known (due to C. Parsons) that the extension of primitive recursive arithmeticPRA by first-order predicate logic and the rule ofΠ 2 0 -inductionΠ 2 0 -IR isΠ 2 0 -conservative overPRA. We show that this is no longer true in the presence of function quantifiers and quantifier-free choice for numbersAC 0,0-qf. More precisely we show that ℐ :=PRA 2 +Π 2 0 -IR+AC 0,0-qf proves the totality of the Ackermann function, wherePRA 2 is the extension ofPRA by (...) number and function quantifiers andΠ 2 0 -IR may contain function parameters. This is true even forPRA 2 +∑ 1 0 -IR+Π 2 0 -IR −+AC 0,0-qf, whereΠ 2 0 -IR − is the restriction ofΠ 2 0 -IR without function parameters. (shrink)

Sequential decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameter-free theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline how the AIXI model can formally solve a number (...) of problem classes, including sequence prediction, strategic games, function minimization, reinforcement and supervised learning. The major drawback of the AIXI model is that it is uncomputable. To overcome this problem, we construct a modified algorithm AIXItl that is still effectively more intelligent than any other time t and length l bounded agent. The computation time of AIXItl is of the order t x 2^l. The discussion includes formal definitions of intelligence order relations, the horizon problem and relations of the AIXI theory to other AI approaches. (shrink)

A well known theorem proved by J. Paris and H. Friedman states that BΣn +1 is a Πn +2-conservative extension of IΣn . In this paper, as a continuation of our previous work on collection schemes for Δn +1-formulas , we study a general version of this theorem and characterize theories T such that T + BΣn +1 is a Πn +2-conservative extension of T . We prove that this conservativeness property is equivalent to a model-theoretic property relating Πn-envelopes and (...) Πn-indicators for T . The analysis of Σn +1-collection we develop here is also applied to Σn +1-induction using Parsons' conservativeness theorem instead of Friedman-Paris' theorem.As a corollary, our work provides new model-theoretic proofs of two theorems of R. Kaye, J. Paris and C. Dimitracopoulos : BΣn +1 and IΣn +1 are Σn +3-conservative extensions of their parameter free versions, BΣ–n +1 and IΣ–n +1. (shrink)

The Emergic Cognitive Model (ECM) is a unified computational model of visual filling-in based on the Emergic Network architecture. The Emergic Network was designed to help realize systems undergoing continuous change. In this thesis, eight different filling-in phenomena are demonstrated under a regime of continuous eye movement (and under static eye conditions as well). -/- ECM indirectly demonstrates the power of unification inherent with Emergic Networks when cognition is decomposed according to finer-grained functions supporting change. These can interact to raise (...) additional emergent behaviours via cognitive re-use, hence the Emergic prefix throughout. Nevertheless, the model is robust and parameter free. Differential re-use occurs in the nature of model interaction with a particular testing paradigm. -/- ECM has a novel decomposition due to the requirements of handling motion and of supporting unified modelling via finer functional grains. The breadth of phenomenal behaviour covered is largely to lend credence to our novel decomposition. -/- The Emergic Network architecture is a hybrid between classical connectionism and classical computationalism that facilitates the construction of unified cognitive models. It helps cutting up of functionalism into finer-grains distributed over space (by harnessing massive recurrence) and over time (by harnessing continuous change), yet simplifies by using standard computer code to focus on the interaction of information flows. Thus while the structure of the network looks neurocentric, the dynamics are best understood in flowcentric terms. Surprisingly, dynamic system analysis (as usually understood) is not involved. An Emergic Network is engineered much like straightforward software or hardware systems that deal with continuously varying inputs. Ultimately, this thesis addresses the problem of reduction and induction over complex systems, and the Emergic Network architecture is merely a tool to assist in this epistemic endeavour. -/- ECM is strictly a sensory model and apart from perception, yet it is informed by phenomenology. It addresses the attribution problem of how much of a phenomenon is best explained at a sensory level of analysis, rather than at a perceptual one. As the causal information flows are stable under eye movement, we hypothesize that they are the locus of consciousness, howsoever it is ultimately realized. (shrink)

We investigate quantifier-free induction for Lisp-like lists constructed inductively from the empty list $$ nil $$ nil and the operation $${\textit{cons}}$$ cons, that adds an element to the front of a list. First we show that, for $$m \ge 1$$ m ≥ 1, quantifier-free $$m$$ m -step induction does not simulate quantifier-free $$(m + 1)$$ ( m + 1 ) -step induction. Secondly, we show that for all $$m \ge 1$$ m ≥ 1, quantifier- (...) class='Hi'>free $$m$$ m -step induction does not prove the right cancellation property of the concatenation operation on lists defined by left-recursion. (shrink)

We present a method for rejecting competing models from noisy time-course data that does not rely on parameter inference. First we characterize ordinary differential equation models in only measurable variables using differential-algebra elimination. This procedure gives input-output equations, which serve as invariants for time series data. We develop a model comparison test using linear algebra and statistics to reject incorrect models from their invariants. This algorithm exploits the dynamic properties that are encoded in the structure of the model equations (...) without recourse to parameter values, and, in this sense, the approach is parameter-free. We demonstrate this method by discriminating between different models from mathematical biology. (shrink)

Based on the computation mode introduced in [13], we deal with the time complexity of computations over arbitrary first-order structures.The main emphasis is on parameter-free computations. Some transfer results for solutions of P versus NP problems as well as relationships to quantifier elimination are discussed. By computation tree analysis using first-order formulas, it follows that P versus NP solutions and other results of structural complexity theory are invariant under elementary equivalence of structures.

Linguistic and non-linguistic pattern learning have been studied separately, but we argue for a comparative approach. Analogous inductive problems arise in phonological and visual pattern learning. Evidence from three experiments shows that human learners can solve them in analogous ways, and that human performance in both cases can be captured by the same models. We test GMECCS, an implementation of the Configural Cue Model in a Maximum Entropy phonotactic-learning framework with a single free parameter, against the alternative hypothesis (...) that learners seek featurally simple algebraic rules. We study the full typology of patterns introduced by Shepard, Hovland, and Jenkins (), instantiated as both phonotactic patterns and visual analogs, using unsupervised training. Unlike SHJ, Experiments 1 and 2 found that both phonotactic and visual patterns that depended on fewer features could be more difficult than those that depended on more features, as predicted by GMECCS but not by rule-seeking. GMECCS also correctly predicted performance differences between stimulus subclasses within each pattern. A third experiment tried supervised training to elicit simple rule-seeking phonotactic learning, but cue-based behavior persisted. We conclude that similar cue-based cognitive processes are available for phonological and visual concept learning, and hence that studying either kind of learning can lead to significant insights about the other. (shrink)

Arguing from inductive risk, Heather Douglas tried to show that the ideal of value-free science is completely unfounded. The argument has been widely acknowledged to be a strong argument against the ideal. In this paper, beginning with an analysis of the concept of an ideal, we argue that the value-free ideal is an epistemic ideal rather than a practical or ethical ideal. Then, we aim to show that the argument from inductive risk cannot be employed against the value- (...) class='Hi'>free ideal as far as it is understood as an epistemic ideal. We try to show that the argument takes practical and ethical limitations of actual scientific enterprise into account to undermine the value-free ideal. But employing non-epistemic considerations makes the argument impotent against an epistemic ideal. (shrink)

Sociology of religion is an interdisciplinary formation at the intersection of sociology and religious studies. While trying to explain the relationship of religion -as a noticeable parameter- with other variables and analyze the current pattern, the unity of social sciences and basic Islamic sciences is occasionally needed. It is expected that the intersection points with the auxiliary sciences will be clearly explained, and the research will represent the field by positioning at the center of the sociology of religion. The (...) valid way for readers to understand texts that are written within the discipline of the sociology of religion is to increase the textual representation of research. The basic issue to increase this representation is locked on the determination of the method as in other sciences. Although it can be mentioned that the studies focusing on the method in the field of sociology of religion are based on the philosophy of science and methodology-oriented evaluations, it is clear that the subject does not receive the necessary attention. This study questions the schematic feasibility of the method that can be used in researches within the field of sociology of religion hypothetically. By schematizing, it is meant to show the main tricks of the method use in the sociology of religion and draw a design. For this reason, firstly the problems encountered in the determination of the method will be addressed and then methodological scheme that can be followed in the studies of the sociology of religion will be evaluated together with the mental, the actional and the semiotic process added as an original category. The article focuses on principal information on how to use the method while studying the sociology of religion; however, does not promise an in-depth study of how the method can be used in practice. The most general output of the research is that by following the signs shown in the study, in-depth examples for further studies can be presented. The study emphasizes that the method as the umbrella concept used jointly by the natural and social sciences is not the only mental processes such as induction and deduction, and also explains that it cannot be labeled as actional processes such as research technique, pattern, model, or theory and approach. It is suggested that the method, which is the product of both abstract and concrete effort, should be taken into account not only with its mental and actional aspects, but also with its semiotic process. In the specialized scheme, while the mental and actional categories have more in common with markers in other sub-branches of sociology, the semiotic side differentiates as a new category. The first point to be mentioned is the necessity to draw attention to the indicative meaning of every object seen in the scientific process. Before the research plan, when a sociologist of religion internalizes that every object around him/her is a part of the body of signs, countless inventories of topics worth investigating are presented. Various protocols suggested by semiotics are followed in the process of providing inventory. Secondly, the researcher is expected to discover his/her own semiotic identity. Since the scholars of the sociology of religion, have largely received theological education, there is a greater possibility that their embodied knowledge will be reflected in the text. Through the inclusion of the semiotic process in the method, the researcher learns before the mental process that he/she cannot conduct a scientific study with a subjective perspective in a way to legitimize his own values and tenets. Through this awareness, he/she recognizes his semiotic identity and reaches the kitchen of meaning. When the researcher is closest to objectivity, receptors understand that they are not reading dogmatic text. This situation, on the one hand, leads to an increase in the studies of the sociology of religion to be carried out in a free arena, on the other hand, it allows to establish a stakeholder with dehumanized sociology texts. The reflection of the principle, sociology not sociologies, to the texts improves the use of related concepts by developing the common language, and the arranged conceptual material helps to prevent schematic clutter. Also the researcher of the sociology of religion expands the doors of a cognitive process as much as possible to get more than they think. Reasoning forms such as induction, deduction or hypothetical-deduction determine the direction of whole and particular. The fact that the researcher takes into account both the whole and the part, and the multi-directional connection between them and indicate which mental process he/she followed according to the course of the research, enables the reader to comprehend the method. (shrink)

Occam’s razor directs us to adopt the simplest hypothesis consistent with the evidence. Learning theory provides a precise definition of the inductive simplicity of a hypothesis for a given learning problem. This definition specifies a learning method that implements an inductive version of Occam’s razor. As a case study, we apply Occam’s inductive razor to causal learning. We consider two causal learning problems: learning a causal graph structure that presents global causal connections among a set of domain variables, and learning (...) context-sensitive causal relationships that hold not globally, but only relative to a context. For causal graph learning, Occam’s inductive razor directs us to adopt the model that explains the observed correlations with a minimum number of direct causal connections. For expanding a causal graph structure to include context-sensitive relationships, Occam’s inductive razor directs us to adopt the expansion that explains the observed correlations with a minimum number of free parameters. This is equivalent to explaining the correlations with a minimum number of probabilistic logical rules. The paper provides a gentle introduction to the learning-theoretic definition of inductive simplicity and the application of Occam’s razor for causal learning. (shrink)

The argument from inductive risk has been embraced by many as a successful account of the role of values in science that challenges the value-free ideal. We argue that it is not obvious that the argument from inductive risk actually undermines the value-free ideal. This is because the inductive risk argument endorses an assumption held by proponents of the value-free ideal: that contextual values never play an appropriate role in determining evidence. We show that challenging the value- (...) class='Hi'>free ideal ultimately requires rejecting this assumption. (shrink)

Cosmology raises novel philosophical questions regarding the use of probabilities in inference. This work aims at identifying and assessing lines of arguments and problematic principles in probabilistic reasoning in cosmology. -/- The first, second, and third papers deal with the intersection of two distinct problems: accounting for selection effects, and representing ignorance or indifference in probabilistic inferences. These two problems meet in the cosmology literature when anthropic considerations are used to predict cosmological parameters by conditionalizing the distribution of, e.g., the (...) cosmological constant on the number of observers it allows for. However, uniform probability distributions usually appealed to in such arguments are an inadequate representation of indifference, and lead to unfounded predictions. It has been argued that this inability to represent ignorance is a fundamental flaw of any inductive framework using additive measures. In the first paper, I examine how imprecise probabilities fare as an inductive framework and avoid such unwarranted inferences. In the second paper, I detail how this framework allows us to successfully avoid the conclusions of Doomsday arguments in a way no Bayesian approach that represents credal states by single credence functions could. -/- There are in the cosmology literature several kinds of arguments referring to self- locating uncertainty. In the multiverse framework, different "pocket-universes" may have different fundamental physical parameters. We don’t know if we are typical observers and if we can safely assume that the physical laws we draw from our observations hold elsewhere. The third paper examines the validity of the appeal to the "Sleeping Beauty problem" and assesses the nature and role of typicality assumptions often endorsed to handle such questions. -/- A more general issue for the use of probabilities in cosmology concerns the inadequacy of Bayesian and statistical model selection criteria in the absence of well-motivated measures for different cosmological models. The criteria for model selection commonly used tend to focus on optimizing the number of free parameters, but they can select physically implausible models. The fourth paper examines the possibility for Bayesian model selection to circumvent the lack of well-motivated priors. (shrink)

The article approaches cut elimination from a new angle. On the basis of an arbitrary inference relation among logically atomic formulae, an inference relation on a language possessing logical operators is defined by means of inductive clauses similar to the operator-introducing rules of a cut-free intuitionistic sequent calculus. The logical terminology of the richer language is not uniquely specified, but assumed to satisfy certain conditions of a general nature, allowing for, but not requiring, the existence of infinite conjunctions and (...) disjunctions. We investigate to what extent structural properties of the given atomic relation are preserved through the extension to the full language. While closure under the Cut rule narrowly construed is not in general thus preserved, two properties jointly amounting to closure under the ordinary structural rules, including Cut, are. -/- Attention is then narrowed down to the special case of a standard first-order language, where a similar result is obtained also for closure under substitution of terms for individual parameters. Taken together, the three preservation results imply the familiar cut-elimination theorem for pure first-order intuitionistic sequent calculus. -/- In the interest of conceptual economy, all deducibility relations are specified purely inductively, rather than in terms of the existence of formal proofs of any kind. (shrink)

The plausibility of uncommon events and miracles based on testimony of such an event has been much discussed. When analyzing the probabilities involved, it has mostly been assumed that the common events can be taken as data in the calculations. However, we usually have only testimonies for the common events. While this difference does not have a significant effect on the inductive part of the inference, it has a large influence on how one should view the reliability of testimonies. In (...) this work, a full Bayesian solution is given for the more realistic case, where one has a large number of testimonies for a common event and one testimony for an uncommon event. A free-running parameter is given for the unreliability of testimony, to be determined from data. It is seen that, in order for there to be a large amount of testimonies for a common event, the testimonies will probably be quite reliable. For this reason, because the testimonies are quite reliable based on the testimonies for the common events, the probability for the uncommon event, given a testimony for it, is also higher. Perhaps surprisingly, in the simple case, the increase in plausibility from testimony for the uncommon events is of the same magnitude as the decrease in plausibility from induction. In summary, one should be more open-minded when considering the plausibility of uncommon events. (shrink)

The no free lunch theorem is a radicalized version of Hume’s induction skepticism. It asserts that relative to a uniform probability distribution over all possible worlds, all computable prediction algorithms—whether ‘clever’ inductive or ‘stupid’ guessing methods —have the same expected predictive success. This theorem seems to be in conflict with results about meta-induction. According to these results, certain meta-inductive prediction strategies may dominate other methods in their predictive success. In this article this conflict is analyzed and dissolved, (...) by means of probabilistic analysis and computer simulation. (shrink)

Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.

This essay presents a point of view for looking at `free will', with the purpose of interpreting where exactly the freedom lies. For, freedom is what we mean by it. It compares the exercise of free will with the making of inferences, which usually is predominantly inductive in nature. The making of inference and the exercise of free will, both draw upon psychological resources that define our ‘selves’. I examine the constitution of the self of an individual, (...) especially the involvement of personal beliefs, personal memories, affects, emotions, and the hugely important psychological value-system, all of which distinguish the self of one individual from that of another. The foundational position that adopted in this essay is that all psychological processes are correlated with corresponding ones involving large scale neural aggregates in the brain, communicating with one another through wavelike modes of excitation and de-excitation. Of central relevance is the value-network around which the affect system is organized, the latter, in turn, being the axis around which is assembled the self, with all its emotional correlates. The self is a complex system. I include a brief outline of what complexity consists of. In reality all systems are complex, for complexity is ubiquitous, and certain parts of nature appear to us to be ‘simple’ only in certain specific contexts. It is in this background that the issue of determinism is viewed in this essay. Instead of looking at determinism as a grand principle entrenched in nature independent of our interpretation of it, I look at our ability to explain and to predict events and phenomena around us, which is made possible by the existence of causal links running in a complex course that set up correlations between diverse parts of nature, in this way putting the stamp of necessity on these events. However, the complexity of systems limits our ability to explain and to predict to within certain horizons defined by contexts. Our ability to explain and predict in matters relating to acts of free will is similarly limited by the operations of the self that remain hidden from our own awareness. The aspects of necessity and determinism appear to us in the form of reason and rationality that explain and predict only within a limited horizon, while the rest depends on the complex operation of self-linked psychological resources, where the latter appear as contingent in the context of the exercise of free will. The hallmark of complex systems is the existence of amplifying factors that operate as destabilizing ones, along with inhibiting or stabilizing factors as well that generally limit the destabilizing influences to local occurrences, while preserving the global integrity of a system. This complex interplay of destabilizing and stabilizing influences lead to the possibility of an enormous number of distinct modes of behavior that appear as emergent phenomena in complex systems. Looking at the particular case of the self of an individual that guide her actions and thoughts, it is the operation of our emotions, built around the psychological value-system, that provide for the amplifying and inhibiting factors mentioned above. The operation of these self-linked factors stamps our actions and thoughts as contingent ones that do not fit with our concepts of reason and rationality. And this is what provides the basis of our idea of free will. Free will is not ‘free’ in virtue of exemption from causal links running through all our self-based processes - ones that remain hidden from our awareness, but is free of what is perceived to be ‘reason and rationality’ based on knowledge and the common pool of beliefs and principles associated with a shared world-view. When we speak of the choice involved in an act of exercise of free will what we actually refer to is the commonly observed fact that various different individuals of a similar disposition respond differently when placed under similar circumstances. In other words, free will is ‘free’ precisely because it is not subject to constraints of a commonly accepted and shared set of principles, beliefs, and values. While it is possible that, in an exercise of free will, the self-linked psychological resources are brought into action when a number of alternatives are presented to the self by the operation of the ingredients of a commonly shared world-view, it seems likely that, that set of alternatives is not of primary relevance in the final response that the mind produces, since the latter is primarily a product of the operation of the self-based psychological resources. What is of greater relevance here is the operation of emotion-driven processes, guided by the psychological value-system based on the activity of the so-called reward-punishment network in the brain. These processes lead the individual to a response that appears to be free from the shackles of determinism precisely because their mechanisms, which are hidden from us, do not conform to commonly accepted and shared rules and principles. In contrast, inductive inference is a process that is based on the ‘cognitive face’ of self, where the self-based psychological resources play a supportive role to the commonly shared world-view of an individual. There is never any freedom from the all-pervading causal links representing correlations among all objects, entities, and events in nature. In the midst of all this, the closest thing to freedom that we can have in our life comes with self-examination and self-improvement. The possibility of self-examination appears in the form of specific conjunctions between our complex self-processes and the ceaseless changes of scenario in our external world. This actually makes the emergent phenomenon of self-examination a matter of chance, but one that keeps on appearing again and again in our life. Once realized, self examination creates possibilities that would not be there in the absence of it, and these possibilities include the enhancement of further self-enrichment and further diversity in the exercise of our free will. (shrink)

In this paper I shall defend the idea that there is an abstract and general core meaning of objectivity, and what is seen as a variety of concepts or conceptions of objectivity are in fact criteria of, or means to achieve, objectivity. I shall then discuss the ideal of value-free science and its relation to the objectivity of science; its status can be at best a criterion of, or means for, objectivity. Given this analysis, we can then turn to (...) the problem of inductive risk. Do the value judgements regarding inductive risk really pose a threat to the objectivity of science? I claim that this is not the case because they do not lower the thresholds scientifically postulated for objectivity. I shall conclude the paper with a discussion of under-appreciated influences of values on science, which indeed pose a serious threat to the objectivity of some scientific disciplines. (shrink)

We show that Intuitionistic Open Induction iop is not closed under the rule DNS(∃ - 1 ). This is established by constructing a Kripke model of iop + $\neg L_y(2y > x)$ , where $L_y(2y > x)$ is universally quantified on x. On the other hand, we prove that iop is equivalent with the intuitionistic theory axiomatized by PA - plus the scheme of weak ¬¬LNP for open formulas, where universal quantification on the parameters precedes double negation. We also (...) show that for any open formula φ(y) having only y free, $(PA^-)^i \vdash L_y\varphi(y)$ . We observe that the theories iop, i∀ 1 and iΠ 1 are closed under Friedman's translation by negated formulas and so under VR and IP. We include some remarks on the classical worlds in Kripke models of iop. (shrink)

Scientists can choose different claims as interpretations of the results of their research. Scientific rhetoric is understood as the attempt to make those claims most beneficial for the scientists' interests. A rational choice, game-theoretic model is developed to analyze how this choice can be made and to assess it from a normative point of view. The main conclusion is that `social' interests (pursuit of recognition) may conflict with `cognitive' ones when no constraints are put on the choices of the authors (...) of scientific papers, as in an `ideal free speech situation'. Scientific institutions may help to solve this conflict. Lastly, some empirical predictions are offered that can inspire future social research of the refereeing process. (shrink)

Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.

$$\mathbf {Z}$$ is a new type of non-finitist inference, i.e., an inference that involves treating some infinite collection as completed, designed for contraction free logic with unrestricted abstraction. It has been introduced in Petersen (Studia Logica 64:365–403, 2000) and shown to be consistent within a system $$\mathbf {{}L^iD{}}{}$$ $$_{\uplambda }$$ of contraction free logic with unrestricted abstraction. In Petersen (Arch Math Log 42(7):665–694, 2003) it was established that adding $$ \mathbf {Z}$$ to $$\mathbf {{}L^iD{}}{}$$ $$_{\uplambda }$$ is sufficient (...) to prove the totality of primitive recursive functions but it was also indicated that this would not extend to 2-recursive functions such as the Ackermann–Péter function, for instance. The purpose of the present paper is to expand the underlying idea in the construction of $$\mathbf {Z}$$ to gain a stronger notion, conveniently labeled $$\mathbf {Z}_2$$, which is sufficient to prove a form of nested double induction and thereby the totality of 2-recursive functions. (shrink)

\ is a new type of non-finitist inference, i.e., an inference that involves treating some infinite collection as completed, designed for contraction free logic with unrestricted abstraction. It has been introduced in Petersen and shown to be consistent within a system \ \ of contraction free logic with unrestricted abstraction. In Petersen :665–694, 2003) it was established that adding \ to \ \ is sufficient to prove the totality of primitive recursive functions but it was also indicated that (...) this would not extend to 2-recursive functions such as the Ackermann–Péter function, for instance. The purpose of the present paper is to expand the underlying idea in the construction of \ to gain a stronger notion, conveniently labeled \, which is sufficient to prove a form of nested double induction and thereby the totality of 2-recursive functions. (shrink)

For several subsystems of second order arithmetic T we show that the proof-theoretic strength of T + (bar rule) can be characterized in terms of T + (bar induction) □ , where the latter scheme arises from the scheme of bar induction by restricting it to well-orderings with no parameters. In addition, we demonstrate that ACA + 0 , ACA 0 + (bar rule) and ACA 0 + (bar induction) □ prove the same Π 1 1 -sentences.

White proposes an a priori justification of the reliability of inductive prediction methods based on his thesis of induction-friendliness. It asserts that there are by far more induction-friendly event sequences than induction-unfriendly event sequences. In this paper I contrast White's thesis with the famous no free lunch theorem. I explain two versions of this theorem, the strong NFL theorem applying to binary and the weak NFL theorem applying to real-valued predictions. I show that both versions refute (...) the thesis of induction-friendliness. In the conclusion I argue that an a priori justification of the reliability of induction based on a uniform probability distribution over possible event sequences is impossible. In the outlook I consider two alternative approaches: justification externalism and optimality justifications. (shrink)

Z\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {Z}$$\end{document} is a new type of non-finitist inference, i.e., an inference that involves treating some infinite collection as completed, designed for contraction free logic with unrestricted abstraction. It has been introduced in Petersen and shown to be consistent within a system LiD\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {{}L^iD{}}{}$$\end{document}λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_{\uplambda }$$\end{document} of contraction free logic with unrestricted abstraction. (...) In Petersen :665–694, 2003) it was established that adding Z\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathbf {Z}$$\end{document} to LiD\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {{}L^iD{}}{}$$\end{document}λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$_{\uplambda }$$\end{document} is sufficient to prove the totality of primitive recursive functions but it was also indicated that this would not extend to 2-recursive functions such as the Ackermann–Péter function, for instance. The purpose of the present paper is to expand the underlying idea in the construction of Z\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {Z}$$\end{document} to gain a stronger notion, conveniently labeled Z2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {Z}_2$$\end{document}, which is sufficient to prove a form of nested double induction and thereby the totality of 2-recursive functions. (shrink)