We introduce prime products as a generalization of ultraproducts for positive logic. Prime products are shown to satisfy a version of Łoś’s Theorem restricted to positive formulas, as well as the following variant of the Keisler Isomorphism Theorem: under the generalized continuum hypothesis, two models have the same positive theory if and only if they have isomorphic prime powers of ultrapowers.

In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and (...) applies it to constructive investigations of variants of determinacy statements for those games in which the players make choices from only finitely many alternatives. As a result, three formulations of open determinacy, that are all classically equivalent with each other, are equivalent to three different semi-classical principles, namely Markov’s Principle, Lesser Limited Principle of Omniscience and Limited Principle of Omniscience, over a suitable constructive base theory that proves clopen determinacy. Open and clopen determinacies for these games are thus separated. Some basic results on variants of inductive definitions for \ positive operators will also be given. (shrink)

This work is in two parts. The main aim of part 1 is a systematic examination of deductive, probabilistic, inductive and purely inductive dependence relations within the framework of Kolmogorov probability semantics. The main aim of part 2 is a systematic comparison of (in all) 20 different relations of probabilistic (in)dependence within the framework of Popper probability semantics (for Kolmogorov probability semantics does not allow such a comparison). Added to this comparison is an examination of (in all) 15 purely inductive (...) dependence relations. ————Part 1 leads in an axiomatic step-by-step development from the elementary classical truth value semantics of a sentential-logical language, called ‘L’, (chapter 1) to the elementary Kolmogorov probability semantics of L (chapter 2), which is then extended to four axiomatic semantical theories of dependence relations between the formulae of L. First the elementary Kolmogorov probability semantics of L is extended to a theory, called ‘Kdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 3). Then Kdd is extended to a theory, called ‘Kpd1’, of the degree to which formulae of L probabilistically depend on each other in regard to a given probability distribution on the set of all formulae of L (chapter 4). Kpd1, in its turn, gets extended to a theory, called ‘Kpd2’, of the relations of probabilistic dependence and independence, relativized to unary Kolmogorov probability functions defined on L (chapter 5). Then Kpd2 is extended to a theory, called ‘Kid’, of the relations of inductive dependence and inductive independence, again relativized to unary Kolmogorov probability functions defined on L (chapter 6). Finally, Kid is extended to a theory, called ‘Kpid’, of the relations of purely inductive positive and negative dependence, relativized to unary Kolmogorov probability functions defined on L (chapter 7). ——Chapter 1, which deals with the familiar notions of truth value functions, tautologies, consequence relations and relations of logical opposition, is naturally the shortest chapter of part 1.——In chapter 2, the elementary classical semantics of L is extended to the elementary Kolmogorov probability semantics of L, i.e. to an axiomatic theory of unary and of binary Kolmogorov probability functions defined on the set of formulae of L. Because of the elementary character of this theory, chapter 2 is also rather short.——Chapter 3 introduces the first theory on dependence relations, to wit: Kdd, the theory of deductive (in)dependence between formulae of L. I follow here the well-known idea of Popper and Miller, who have used it in a famous discussion on the nature of probabilistic support for their arguments that probabilistic support is deductive, not inductive. I develop Kdd in the form of about 100 theorems, making ample use of the fact that deductive independence is nothing but subcontrary opposition, and close with a remark on the fundamental difference between deductive and logical dependence—two relations the ideas of which are all too easily mixed up.——Chapters 4 and 5 deal extensively with the traditional ideas of probabilistic (in)dependence, applied to formulae rather than to events. As always, I proceed axiomatically in a step-by-step process under systematic viewpoints and obtain about 300 theorems in this way. In the formulation of the theorems, I took special care to state clearly and expressly so-called tacit assumptions, especially those concerning the probability values of the formulae said to be dependent on each other. These assumptions are usually missing in the literature, due either to economy of writing or to sloppiness of thinking. Presumably, both chapters contain little that is new, their value lying more in the systematic grouping and organic development of the theorems than in the newness of these.——In chapter 6, I extend the axiomatic theory about probabilistic (in)dependence which has been elaborated in chapter 5, to an axiomatic theory of inductive (in)dependence by requiring of the relation of inductive (in)dependence that it be probabilistic (in)dependence, but not also logical implication or logical opposition. I point out the differences between probabilistic and inductive (in)dependence by means of some 60 theorems and close my examination of inductive (in)dependence by considering its relationship to the notion of support in the philosophy of science.——Finally, in chapter 7, the last of part 1, I take the step from inductive dependence to what I call ‘purely inductive dependence’ by combining the idea of inductive dependence with that of deductive independence in a way which is suggested by writings of Popper and Miller. I arrive at two noteworthy theorems. Firstly, there is indeed no purely inductive support. But secondly, and perhaps amazingly, countersupport is purely inductive.————Whereas the probabilistic framework of part 1 of the present work is Kolmogorov probability semantics, the framework of part 2 is Popper probability semantics, which is not only worth examining as a fascinating alternative to orthodox Kolmogorov probability semantics, but also allows us to examine dependence relations more deeply, than Kolmogorov probability semantics does. Part 2 leads—again in an axiomatic step-by-step development—from the basic Popper probability semantics of L, called ‘Pb’, (chapter 8) via a probabilistic theory of logical attributes, called ‘Ps’, (chapter 9) to four axiomatic semantical theories of dependence relations between the formulae of L. First, Ps is extended to a theory, called ‘Pdd’, of the relations of deductive dependence and deductive independence between formulae of L (chapter 10). Then Pdd is extended to a theory, called ‘Ppd’, of (in all) 20 relations of probabilistic (in)dependence, relativized to binary Popper probability functions defined on L (chapter 11). Ppd, in its turn, is extended to a theory, called ‘Pid’, of (in all) 10 relations of inductive dependence, again relativized to binary Popper probability functions defined on L (first part of chapter 12). Finally, Pid is extended to a theory, called ‘Ppid’, of (in all) 15 relations of purely inductive positive and negative dependence, relativized to binary Popper probability functions defined on L (second part of chapter 12).——Chapter 8, the first chapter of part 2 of the present work, is entirely preparatory. It introduces the axioms and about 180 theorems (150 of them together with their proofs) of basic Popper probability semantics in order to set this kind of semantics under way.——Then, in chapter 9, basic Popper probability semantics is extended to a probabilistic theory of logical properties of and relations between the formulae of L. Although I think that the way I did this extension is of some interest in itself, the main task of chapter 9 is again a preparatory one: to yield the indispensable lemmata (about 90 in number) for the theorems concerning probabilistic dependence relations in chapter 11 and concerning inductive dependence relations in chapter 12.——Chapter 10 brings the extension of Ps to the theory Pdd of deductive (in)dependence. Only half a dozen theorems are noted here for later use in the Pdd-extensions Ppd and Ppid. In view of the over 100 theorems already gained on this topic in the Kolmogorovian framework (cf. chapter 3), a similar extensive elaboration of Pdd would have been superfluous.——Chapter 11 is the most important one of part 2. It consists of a systematic comparison of 20 probabilistic (in)dependence concepts by means of about 230 theorems, obtained within the axiomatic theory Ppd, which is built up as an extension of Pdd. The main points of comparison were: differences in logical strength; reflexivity and symmetry; behaviour under the condition that the probability values of the formulae in question are extreme. It turned out that each of the examined concepts violates a strong and straightforward version of the intuitive requirement that probabilistic dependence should go with logical dependence. Whereas the corresponding chapter 5 in part 1 of the present work may not have led to new theorems, chapter 11 yields dozens of them in the process of comparison of concepts of dependence and independence which had—as far as I know—never before been treated in a single theoretical framework. With Popper probability semantics, this framework has become available, and here I have simply made full use of it.——In chapter 12, I extend the theory Ppd of probabilistic (in)dependence to the theories Pid and Ppid of inductive and purely inductive dependence, in a way very similar to that in which I have extended the theory Kpd2 to the theories Kid and Kpid in chapters 6 and 7. The first main result of Kpid (roughly: there is no purely inductive support) could be repeated for four of the five purely inductive positive dependence relations considered in chapter 12, whereas the second main result of Kpid (roughly: there is purely inductive countersupport ) could be repeated for each of the five examined purely inductive negative dependence relations. Chapter 12 closes with a brief recapitulation and critical discussion of the main results. (shrink)

A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA0, those in second order set theory extending NBG are. In this article, we establish the equivalence between Δ01-LFP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-LFP}}$$\end{document} and Δ01-FP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Delta^1_0\mbox{\bf-FP}}$$\end{document}, which assert the existence of a least and of a fixed point, respectively, for positive elementary operators. Our proof (...) also shows the equivalence between ID1 and ID^1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\widehat{\it ID}_1}$$\end{document}, both of which are defined in the standard way but with the starting theory PA replaced by ZFC. (shrink)

Hailed by the Bulletin of the American Mathematical Society as "easy to use and a pleasure to read," this research monograph is recommended for students and professionals interested in model theory and definability theory. The sole prerequisite is a familiarity with the basics of logic, model theory, and set theory. 1974 edition.

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)

The control of pattern formation and the significance of gradients is reconsidered on the basis of the concept of cell sociology (which takes into account continuous exchange of information between cells and the possibility of autonomous progression in differentiation). Not all traits of a pattern are imposed by a single prepattern, which would be an organized molecular framework or a gradient. Patterns are unfolded in steps; these are readjustments of a cell population to intrinsic and extrinsic changes in cell activities. (...) Prepatterns are the various components of the programme of every readjustment and are established by information of various origins, which can be dissociated experimentally: determination (elementary social prepattern), pre-existing organization (antecedent pp.), surrounding cell populations (environmental pp.), position among other tissues (positional pp.) and the organization of inducers (imprinting pp.). Every transitory pattern formed during a readjustment serves as antecedent pp. during the next readjustment. Covert graded patterns result from various aspects of the social behaviour of cells (growth, aggregation, induction, cell renewal) and may serve as antecedent or imprinting prepatterns. They appear as water marks in the final patterns, or generate overt graded patterns. They also manifest themselves in temporal patterns, particularly in gradients of relative growth. (shrink)

When a structure or class of structures admits an unbounded induction, we can do arithmetic on the stages of that induction: if only bounded inductions are admitted, then clearly each inductively definable relation can be defined using a finite explicit expression. Is the converse true? We examine evidence that the converse is true, in positive elementary induction . We present a stronger conjecture involving the language L consisting of all L∞ω formulas with a finite number (...) of variables, and examine a combinatorial property equivalent to “all L-definable relations are elementary”. (shrink)

We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.

We characterize the polynomial time operations as those which are provably total in a first order system, which comprises (untyped) combinatory logic with extensionality, together with positive “safe induction” on the set of binary strings. The formalization of safe induction is inspired by Leivants idea of ramification. We also show how to replace ramification by means of modal logic.

We prove that any positive elementary (least fixed point) induction expressing the negation of transitive closure on finite nondirected graphs requires at least two recursion variables.

Many of the earliest books, particularly those dating back to the 1900s and before, are now extremely scarce and increasingly expensive. We are republishing these classic works in affordable, high quality, modern editions, using the original text and artwork.

The paper generalises Goldblatt's completeness proof for Lemmon–Scott formulas to various modal propositional logics without classical negation and without ex falso, up to positive modal logic, where conjunction and disjunction, andwhere necessity and possibility are respectively independent.Further the paper proves definability theorems for Lemmon–Scottformulas, which hold even in modal propositional languages without negation and without falsum. Both, the completeness theorem and the definability theoremmake use only of special constructions of relations,like relation products. No second order logic, no general frames (...) are involved. (shrink)

Using a queer theory and disrupting heteronormativity framework, we applied a model lesson in the elementary methods course to understand preservice teachers’ experiences with LGBTQ individuals and families and their beliefs about utilizing children׳s literature portraying LGBTQ families in the elementary classroom. Participants reported a range of personal experiences with LGBTQ individuals and families and relatively positive responses to the family text set presented but wavered on LGBTQ themed books due to perceived conflict, religious beliefs, and ideas (...) about what is appropriate content for young learners. A discussion of the findings also includes preservice teachers’ intentions for future teaching related to LGBTQ topics. Implications for teacher education and social studies education are explored. (shrink)

Disputants in the debate regarding whether Hume's argument on induction is descriptive or normative have by and large ignored Hume’s positive argument (that custom is what determines inferences to the unobserved), largely confining themselves to intricate debates within the negative argument (that inferences to the unobserved are not founded on reason). I believe that this is a mistake, for I think Hume’s positive argument to have significant implications for the interpretation of his negative argument. In this paper, (...) I will argue that Hume’s positive and negative arguments should be read as addressing the same issues, whether normative or causal. I will then focus on the Enquiry version of Hume’s positive argument, arguing that it carries a significant normative conclusion: there, Hume argues that custom plays a normative role in justifying our inductive inferences. Given that Hume’s positive argument should be read as addressing the same issues as his negative argument, we should correspondingly read Hume’s negative argument in the Enquiry as having a normative conclusion. (shrink)

Discussion on whether Hume's treatment of induction is descriptive or normative has usually centred on Hume's negative argument, somewhat neglecting the positive argument. In this paper, I will buck this trend, focusing on the positive argument. First, I argue that Hume's positive and negative arguments should be read as addressing the same issues . I then argue that Hume's positive argument in the Enquiry is normative in nature; drawing on his discussion of scepticism in Section (...) 12 of the Enquiry, I explain a framework by which he provides what I call consequent justification for our inductive practices in his positive argument. Based on this, I argue that his negative argument in the Enquiry should similarly be read as normative in nature. (shrink)

This paper deals with: (i) the theory ID # 1 which results from $\widehat{\mathrm{ID}}_1$ by restricting induction on the natural numbers to formulas which are positive in the fixed point constants, (ii) the theory BON(μ) plus various forms of positive induction, and (iii) a subtheory of Peano arithmetic with ordinals in which induction on the natural numbers is restricted to formulas which are Σ in the ordinals. We show that these systems have proof-theoretic strength φω (...) 0. (shrink)

This paper deals with: (i) the theory $\mathrm{ID}^{\tt\#}_1$ which results from $\widehat{\mathrm{ID}}_1$ by restricting induction on the natural numbers to formulas which are positive in the fixed point constants, (ii) the theory $\mathrm{BON}(\mu)$ plus various forms of positive induction, and (iii) a subtheory of Peano arithmetic with ordinals in which induction on the natural numbers is restricted to formulas which are $\Sigma$ in the ordinals. We show that these systems have proof-theoretic strength $\varphi\omega 0$.

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive (...) formulae are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

The article shows a simple way of calibrating the strength of the theory of positive induction, ${{\rm ID}^{*}_{1}}$ . Crucially the proof exploits the equivalence of ${\Sigma^{1}_{1}}$ dependent choice and ω-model reflection for ${\Pi^{1}_{2}}$ formulae over ACA 0. Unbeknown to the authors, D. Probst had already determined the proof-theoretic strength of ${{\rm ID}^{*}_{1}}$ in Probst, J Symb Log, 71, 721–746, 2006.

A growing body of evidence suggests that emotional states under which individuals perform decision-making tasks modulate performance. Studies have mainly reported that negative emotions can differe...

We interpret intuitionistic theories of (iterated) strictly positive inductive definitions (s.p.-ID i′ s) into Martin-Löf's type theory. The main purpose being to obtain lower bounds of the proof-theoretic strength of type theories furnished with means for transfinite induction (W-type, Aczel's set of iterative sets or recursion on (type) universes). Thes.p.-ID i′ s are essentially the wellknownID i -theories, studied in ordinal analysis of fragments of second order arithmetic, but the set variable in the operator form is restricted to (...) occur only strictly positively. The modelling is done by constructivizing continuity notions for set operators at higher number classes and proving that strictly positive set operators are continuous in this sense. The existence of least fixed points, or more accurately, least sets closed under the operator, then easily follows. (shrink)

I set up two axiomatic theories of inductive support within the framework of Kolmogorovian probability theory. I call these theories ‘Popperian theories of inductive support’ because I think that their specific axioms express the core meaning of the word ‘inductive support’ as used by Popper (and, presumably, by many others, including some inductivists). As is to be expected from Popperian theories of inductive support, the main theorem of each of them is an anti-induction theorem, the stronger one of them (...) saying, in fact, that the relation of inductive support is identical with the empty relation. It seems to me that an axiomatic treatment of the idea(s) of inductive support within orthodox probability theory could be worthwhile for at least three reasons. Firstly, an axiomatic treatment demands from the builder of a theory of inductive support to state clearly in the form of specific axioms what he means by ‘inductive support’. Perhaps the discussion of the new anti-induction proofs of Karl Popper and David Miller would have been more fruitful if they had given an explicit definition of what inductive support is or should be. Secondly, an axiomatic treatment of the idea(s) of inductive support within Kolmogorovian probability theory might be accommodating to those philosophers who do not completely trust Popperian probability theory for having theorems which orthodox Kolmogorovian probability theory lacks; a transparent derivation of anti-induction theorems within a Kolmogorovian frame might bring additional persuasive power to the original anti-induction proofs of Popper and Miller, developed within the framework of Popperian probability theory. Thirdly, one of the main advantages of the axiomatic method is that it facilitates criticism of its products: the axiomatic theories. On the one hand, it is much easier than usual to check whether those statements which have been distinguished as theorems really are theorems of the theory under examination. On the other hand, after we have convinced ourselves that these statements are indeed theorems, we can take a critical look at the axioms—especially if we have a negative attitude towards one of the theorems. Since anti-induction theorems are not popular at all, the adequacy of some of the axioms they are derived from will certainly be doubted. If doubt should lead to a search for alternative axioms, sheer negative attitudes might develop into constructive criticism and even lead to new discoveries. -/- I proceed as follows. In section 1, I start with a small but sufficiently strong axiomatic theory of deductive dependence, closely following Popper and Miller (1987). In section 2, I extend that starting theory to an elementary Kolmogorovian theory of unconditional probability, which I extend, in section 3, to an elementary Kolmogorovian theory of conditional probability, which in its turn gets extended, in section 4, to a standard theory of probabilistic dependence, which also gets extended, in section 5, to a standard theory of probabilistic support, the main theorem of which will be a theorem about the incompatibility of probabilistic support and deductive independence. In section 6, I extend the theory of probabilistic support to a weak Popperian theory of inductive support, which I extend, in section 7, to a strong Popperian theory of inductive support. In section 8, I reconsider Popper's anti-inductivist theses in the light of the anti-induction theorems. I conclude the paper with a short discussion of possible objections to our anti-induction theorems, paying special attention to the topic of deductive relevance, which has so far been neglected in the discussion of the anti-induction proofs of Popper and Miller. (shrink)

Views which deny that there are necessary connections between distinct existences have often been criticized for leading to inductive skepticism. If there is no glue holding the world together then there seems to be no basis on which to infer from past to future. However, deniers of necessary connections have typically been unconcerned. After all, they say, everyone has a problem with induction. But, if we look at the connection between induction and explanation, we can develop the problem (...) of induction in a way that hits deniers of necessary connections, but not their opponents. The denier of necessary connections faces an `internal' problem with induction -- skepticism about important inductive inferences naturally flows from their position in a way that it doesn't for those who accept necessary connections. This is a major problem, perhaps a fatal one, for the denial of necessary connections. (shrink)

An Elementary Transition to Abstract Mathematics will help students move from introductory courses to those where rigor and proof play a much greater role. The text is organized into five basic parts: the first looks back on selected topics from pre-calculus and calculus, treating them more rigorously, and it covers various proof techniques; the second part covers induction, sets, functions, cardinality, complex numbers, permutations, and matrices; the third part introduces basic number theory including applications to cryptography; the fourth (...) part introduces key objects from abstract algebra; and the final part focuses on polynomials. Features: The material is presented in many short chapters, so that one concept at a time can be absorbed by the student. Two "looking back" chapters at the outset (pre-calculus and calculus) are designed to start the student's transition by working with familiar concepts. Many examples of every concept are given to make the material as concrete as possible and to emphasize the importance of searching for patterns. A conversational writing style is employed throughout in an effort to encourage active learning on the part of the student. (shrink)

Developing some suggestions of Ramsey (1925), elementary logic is formulated with respect to an arbitrary categorial system rather than the categorial system of Logical Atomism which is retained in standard elementary logic. Among the many types of non-standard categorial systems allowed by this formalism, it is argued that elementary logic with predicates of variable degree occupies a distinguished position, both for formal reasons and because of its potential value for application of formal logic to natural language and (...) natural science. This is illustrated by use of such a logic to construct a theory of quantity which is argued to be scientifically superior to existing theories of quantity based on standard categorial systems, since it yields real-valued scales without the need for unrealistic existence assumptions. This provides empirical evidence for the hypothesis that the categorial structure of the physical world itself is non-standard in this sense. (shrink)

In a context of high-stakes accountability in teacher education, concerns are emerging about challenges to the already tenuous position of elementary social studies teacher education. In this case study, the author administered a survey to elementary social studies teacher educators in Georgia and conducted follow-up interviews focusing on the impact of edTPA on elementary social studies teacher education and the ways in which they are navigating the new context of teaching elementary social studies methods. The findings (...) reveal the possibility of further decline of social studies in elementary teacher education programs due to elementary edTPA's singular focus on literacy and math content pedagogy along with the high-stakes nature of edTPA process. Implications for future research on edTPA and elementary social studies education are discussed. (shrink)

Altered state theories of hypnosis posit that a qualitatively distinct state of mental processing, which emerges in those with high hypnotic susceptibility following a hypnotic induction, enables the generation of anomalous experiences in response to specific hypnotic suggestions. If so then such a state should be observable as a discrete pattern of changes to functional connectivity (shared information) between brain regions following a hypnotic induction in high but not low hypnotically susceptible participants. Twenty-eight channel EEG was recorded from (...) 12 high susceptible (highs) and 11 low susceptible (lows) participants with their eyes closed prior to and following a standard hypnotic induction. The EEG was used to provide a measure of functional connectivity using both coherence (COH) and the imaginary component of coherence (iCOH), which is insensitive to the effects of volume conduction. COH and iCOH were calculated between all electrode pairs for the frequency bands: delta (0.1–3.9Hz), theta (4–7.9Hz) alpha (8–12.9Hz), beta1 (13–19.9Hz), beta2 (20–29.9Hz) and gamma (30–45Hz). The results showed that there was an increase in theta iCOH from the pre-hypnosis to hypnosis condition in highs but not lows with a large proportion of significant links being focused on a central-parietal hub. There was also a decrease in beta1 iCOH from the pre-hypnosis to hypnosis condition with a focus on a fronto-central and an occipital hub that was greater in high compared to low susceptibles. There were no significant differences for COH or for spectral band amplitude in any frequency band. The results are interpreted as indicating that the hypnotic induction elicited a qualitative change in the organization of specific control systems within the brain for high as compared to low susceptible participants. This change in the functional organization of neural networks is a plausible indicator of the much theorized “hypnotic-state”. (shrink)

The elementary arithmetic operations +,·,≤\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${+,\cdot,\le}$$\end{document} on integers are well-known to be computable in the weak complexity class TC0, and it is a basic question what properties of these operations can be proved using only TC0-computable objects, i.e., in a theory of bounded arithmetic corresponding to TC0. We will show that the theory VTC0 extended with an axiom postulating the totality of iterated multiplication proves induction for quantifier-free formulas in the (...) language ⟨+,·,≤⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle{+,\cdot,\le}\rangle}$$\end{document}, and more generally, minimization for Σ0b\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Sigma_{0}^{b}}$$\end{document} formulas in the language of Buss’s S2. (shrink)

I have applied a fairly general, learning theoretic perspective to some questions raised by Reichenbach's positions on induction and discovery. This is appropriate in an examination of the significance of Reichenbach's work, since the learning-theoretic perspective is to some degree part of Reichenbach's reliabilist legacy. I have argued that Reichenbach's positivism and his infatuation with probabilities are both irrelevant to his views on induction, which are principally grounded in the notion of limiting reliability. I have suggested that limiting (...) reliability is still a formidable basis for the formulation of methodological norms, particularly when reliability cannot possibly be had in the short run, so that refined judgments about evidential support must depend upon measure-theoretic choices having nothing to do in the short run with the truth of the hypothesis under investigation. To illustrate the generality of Reichenbach's program, I showed how it can be applied to methods that aim to solve arbitrary assessment and discovery problems in various senses. In this generalized Reichenbachian setting, we can characterize the intrinsic complexity of reliable inductive inference in terms of topological complexity. Finally, I let Reichenbach's theory of induction have the last say about hypothetico-deductive method. (shrink)

We present here an approach to the fine structure of L based solely on elementary model theoretic ideas, and illustrate its use in a proof of Global Square in L. We thereby avoid the Lévy hierarchy of formulas and the subtleties of master codes and projecta, introduced by Jensen [3] in the original form of the theory. Our theory could appropriately be called ”Hyperfine Structure Theory”, as we make use of a hierarchy of structures and hull operations which refines (...) the traditional Lα -or Jα-sequences with their Σn-hull operations.§1. Introduction. In 1938, K. Gödel defined the model L of set theory to show the relative consistency of Cantor's Continuum Hypothesis. L is defined as a unionof initial segments which satisfy: L0 = ∅, Lλ = ∪α<λLα for limit ordinals λ, and, crucially, Lα + 1 = the collection of 1st order definable subsets of Lα. Since every transitive model of set theory must be closed under 1st order definability, L turns out to be the smallest inner model of set theory. Thus it occupies the central place in the set theoretic spectrum of models.The proof of the continuum hypothesis in L is based on the very uniform hierarchical definition of the L-hierarchy. The Condensation Lemma states that if π : M → Lα is an elementary embedding, M transitive, then some ; the lemma can be proved by induction on α. If a real, i.e., a subset of ω, is definable over some Lα,then by a Löwenheim-Skolem argument it is definable over some countable M as above, and hence over some, < ω1. This allows one to list the reals in L in length ω1 and therefore proves the Continuum Hypothesis in L. (shrink)

The local justification of beliefs and hypotheses has recently become a major concern for epistemologists and philosophers of induction. As such, the problem of local justification is not entirely new. Most pragmatists had addressed themselves to it, and so did, to some extent, many classical inductivists in the Bacon-Whewell-Mill tradition. In the last few decades, however, the use of logic and semantics, probability calculus, statistical methods, and decision-theoretic concepts in the reconstruction of in ductive inference has revealed some important (...) technical respects in which inductive justification can be local: the choice of a language, with its syntactic and semantic features, the relativity of probabilistic evalua tions to an initial body of evidence or background knowledge and to an agent's utilities and preferences, etc. Some paradoxes and difficulties encountered by purely formal accounts of inductive justification, the erosion of the once dominant empiricist position, which most approaches to induction took for granted, and the increasing challenge of noninduc tivist epistemolgies have underscored the need of accounting for the methodological problems of applying inductive logic to real life contexts, particularly in science. As a result, in the late fifties and sixties, several related developments pointed to a new, local approach to inductive justification. (shrink)

The analogical position, as traditionally understood, is the claim that a person can inductively infer the existence of other minds from what he knows about his own mind and about physical objects. Of course this body of knowledge must not include such propositions about physical objects as "that human body over there is animated by a human mind," or "this automobile was designed by a human mind"; nor could my evidence for the existence of other minds be that I have (...) it on the authority of some of the best minds in the country. The body of knowledge in question must not entail that there are any other minds. In "Induction and Other Minds" I used the term "total evidence" to refer to this body of knowledge, defining that term as follows. (shrink)

A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for (...) k < ω, k times iterated ∑n reflection principle over EA precisely corresponds to the extension of EA by k nested applications of ∑n induction rule.The above relationship holds in greater generality than just stated. In fact, we give general formulas characterizing in terms of iterated reflection principles the extension of any given theory by k nested applications of ∑n or Πn induction rules. In particular, the closure of a theory T under just one application of ∑1 induction rule is equivalent to T together with ∑1 reflection principle for each finite Π2 axiomatized subtheory of T.These results have closely parallel ones in the theory of subrecursive function classes. The rules under study correspond, in a canonical way, to natural closure operators on the classes of provably recursive functions. Thus, ∑1 induction rule precisely corresponds to the primitive recursive closure operator, and ∑1 collection rule, introduced below, corresponds to the elementary closure operator. (shrink)

Some philosophers who believe that there are necessary connections in nature take it that an advantage of their commitment is that the problem of induction is solved. This paper aims to offer a comprehensive refutation of the arguments necessitarians use to show that if natural necessities are posited, then there is no problem of induction. In section 2, two models of natural necessity are presented. The “Contingent Natural Necessity” section examines David Armstrong’s explanationist ‘solution’ to the problem of (...) induction. The “Natural Necessity and IBE” section looks in detail into the claim that natural necessity is the best explanation of observed regularity. The “Dispositional Essentialism to the Rescue?” section moves on to Brian Ellis’s dispositional essentialist ‘solution’. The “Sankey’s Helping Hand” section examines Howard Sankey’s attempt to blend dispositional essentialism and explanationism. (shrink)

The first obstacle that confronts the student of induction is that of defining the subject matter. One initial point is to note that much of the relevant subject matter goes under the description ‘the theory of confirmation’. The distinction is primarily that the study of induction concerns inference, i.e. cases where one takes the conclusion to be established by the evidence, whereas confirmation concerns the weight of evidence, which one may take to be something like the credibility of (...) a hypothesis in the light of the evidence. Discussions of confirmation often concern incremental confirmation, i.e. cases where the evidence is taken to increase the credibility of some hypothesis, even if not sufficiently to warrant inferring the truth of that hypothesis. However, some uses of ‘confirmation’ clearly refer to absolute confirmation, cases where the credibility of the hypothesis in the light of the evidence exceeds some (high) threshold. One may ask whether inductive inference corresponds to the case of absolute confirmation for some suitable threshold. I shall discuss inference and confirmation together, though it should be noted that some approaches eschew inference altogether. For example, the Bayesian takes scientific reasoning to be a matter of adjusting credences in propositions in the light of evidence, and says nothing about unqualified belief in a proposition. However, if we are interested in inductive knowledge then we must consider inference, since only then do we have a detached proposition that is the possible content of a mental state of knowing. A more pressing question concerns which inferences (or allegedly confirmatory relations) should be classed as inductive. A natural and straightforward approach is to define induction as encompassing any form of reasoning that extrapolates from one population to another, usually from a sample of a population to the whole population. For example, one might note that all observations of the position of some planet fall on an ellipse that has the Sun at one of its foci; from this one concludes that all the positions that planet takes fall on this ellipse (i.e.. (shrink)

In their paper on the influence of meta-induction to the wisdom of the crowd, Paul Thorn and Gerhard Schurz argue that adding meta-inductive methods to a group influences the group positively, whereas replacing independend methods of a group with meta-inductive ones may have a negative impact. The first fact is due to an improvement of average ability of a group, the second fact is due to an impairment of average diversity within a group by meta-induction. In this paper (...) some critical remarks to meta-inductive group expansion and replacement are made. In particular it is stressed that both ability and diversity are of equal importance to a group’s performance. (shrink)

Conceptual change and its connection to the development of new seien tific theories has reeently beeome an intensively discussed topic in philo sophieal literature. Even if the inductive aspects related to conceptual change have already been discussed to some extent, there has so far existed no systematic treatment of inductive change due to conceptual enrichment. This is what we attempt to accomplish in this work, al though most of our technical results are restricted to the framework of monadic languages. We (...) extend Hintikka's system of inductive logic to apply to situations in which new concepts are introduced to the original language. By interpreting them as theoretica1 concepts, it is possible to discuss a number of currently debated philosophical and methodological problems which have previously escaped systematic and exact treatment. For instance, the role which seientific theories employing theoretical con cepts may play within inductive inference can be studied within this framework. From the viewpoint of seientific realism, sueh a study gives outlines for a theory of what we call hypothetico-induetive inference. Some parts of this work which are based on Hintikka's system of in ductive logic are fairly technical. However, no previous knowledge of this system is required, but, in general, acquaintance with the basic ideas of elementary logic and probability theory is suffieient. This work is part of a project, originated by Professors Jaakko Hintikka and Raimo Tuomela, concerning the role of theoretical concepts in science. (shrink)

As our epistemic ambitions grow, the common and scientific endeavours are becoming increasingly dependent on Machine Learning (ML). The field rests on a single experimental paradigm, which consists of splitting the available data into a training and testing set and using the latter to measure how well the trained ML model generalises to unseen samples. If the model reaches acceptable accuracy, an a posteriori contract comes into effect between humans and the model, supposedly allowing its deployment to target environments. Yet (...) the latter part of the contract depends on human inductive predictions or generalisations, which infer a uniformity between the trained ML model and the targets. The paper asks how we justify the contract between human and machine learning. It is argued that the justification becomes a pressing issue when we use ML to reach ‘elsewheres’ in space and time or deploy ML models in non-benign environments. The paper argues that the only viable version of the contract can be based on optimality (instead of on reliability which cannot be justified without circularity) and aligns this position with Schurz’s optimality justification. It is shown that when dealing with inaccessible/unstable ground-truths (‘elsewheres’ and non-benign targets), the optimality justification undergoes a slight change, which should reflect critically on our epistemic ambitions. Therefore, the study of ML robustness should involve not only heuristics that lead to acceptable accuracies on testing sets. The justification of human inductive predictions or generalisations about the uniformity between ML models and targets should be included as well. Without it, the assumptions about inductive risk minimisation in ML are not addressed in full. (shrink)

Elementary results concerning the connections between deductive relations and probabilistic support are given. These are used to show that Popper-Miller's result is a special case of a more general result, and that their result is not very unexpected as claimed. According to Popper-Miller, a purely inductively supports b only if they are deductively independent — but this means that a b. Hence, it is argued that viewing induction as occurring only in the absence of deductive relations, as Popper-Miller (...) sometimes do, is untenable. Finally, it is shown that Popper-Miller's claim that deductive relations determine probabilistic support is untrue. In general, probabilistic support can vary greatly with fixed deductive relations as determined by the relevant Lindenbaum algebra. (shrink)

In contemporary philosophy of science, the no-miracles argument and the pessimistic induction are regarded as the strongest arguments for and against scientific realism, respectively. In this paper, I construct a new argument for scientific realism which I call the anti-induction for scientific realism. It holds that, since past theories were false, present theories are true. I provide an example from the history of science to show that anti-inductions sometimes work in science. The anti-induction for scientific realism has (...) several advantages over the no-miracles argument as a positive argument for scientific realism. (shrink)