This paper presents an exposition of subsystems and of Quine's , originally defined and shown to be consistent by Crabbé, along with related systems and of type theory. A proof that (and so ) interpret the ramified theory of types is presented (this is a simplified exposition of a result of Crabbé). The new result that the consistency strength of is the same as that of is demonstrated. It will also be shown that cannot be finitely axiomatized (as can (...) and ). (shrink)

Cognitive semantic studies have shown that our conceptualization of morality is at least partially metaphorical and that our moral cognition is grounded in some fundamental contrastive categories of our embodied experience in the physical environment. It is argued that our moral cognition is built on a moral metaphor system. Within the framework of conceptual metaphor theory, this study aims to examine the spatial subsystem of moral metaphors in English. We set out with five pairs of moral metaphors that involve the (...) following spatial source concepts: HIGH and LOW, UPRIGHT and TILTED, LEVEL and UNLEVEL, STRAIGHT and CROOKED, and BIG and SMALL. These metaphors were found to constitute the spatial subsystem of moral metaphors in Chinese. Our primary goal is to find out if the five pairs of moral–spatial metaphors are manifested in English as well. To that end we collected linguistic data from the Corpus of Contemporary American English and searched Google Images for multimodal evidence. Our finding is that the five pairs of moral–spatial metaphors are applicable in English as they are in Chinese. We also discuss issues related to conceptual metaphor theory. (shrink)

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak (...) K\"onig's Lemma, and (iv) the large-scale intellectual backdrop to arithmetical transfinite recursion in descriptive set theory and its effectivization by Borel, Lusin, Addison, and others. (shrink)

We show that certain model-theoretic forcing arguments involving subsystems of second-order arithmetic can be formalized in the base theory, thereby converting them to effective proof-theoretic arguments. We use this method to sharpen the conservation theorems of Harrington and Brown-Simpson, giving an effective proof that WKL+0 is conservative over RCA0 with no significant increase in the lengths of proofs.

We study the provability in subsystems of second-order arithmetic of two theorems of Harrington and Shelah [6] about Borel quasi-orderings of the reals. These theorems turn out to be provable in ATR0, thus giving further evidence to the observation that ATR0 is the minimal subsystem of second-order arithmetic in which significant portion of descriptive set theory can be developed. As in [6] considering the lightface versions of the theorems will be instrumental in their proof and the main techniques employed (...) will be the reflection principles and Gandy forcing. (shrink)

To appear in the Proceedings of Logic Colloquium 2006. (32 pages).

Working within weak subsystems of second-order arithmetic Z2 we consider two versions of the Baire Category theorem which are not equivalent over the base system RCA0. We show that one version (B.C.T.I) is provable in RCA0 while the second version (B.C.T.II) requires a stronger system. We introduce two new subsystems of Z2, which we call RCA+ 0 and WKL+ 0, and show that RCA+ 0 suffices to prove B.C.T.II. Some model theory of WKL+ 0 and its importance in (...) view of Hilbert's program is discussed, as well as applications of our results to functional analysis. (shrink)

One of the main results of Gödel [4] and [5] is that, if M is a transitive set such that $\langle M, \epsilon \rangle$ is a model of ZF (Zermelo-Fraenkel set theory) and α is the least ordinal not in M, then $\langle L_\alpha, \epsilon \rangle$ is also a model of ZF. In this note we shall use the Jensen uniformisation theorem to show that results analogous to the above hold for certain subsystems of ZF. The subsystems we (...) have in mind are those that are formed by restricting the formulas in the separation and replacement axioms to various levels of the Levy hierarchy. This is all done in § 1. In § 2 we proceed to establish the exact order relationships which hold among the ordinals of the minimal models of some of the systems discussed in § 1. Although the proofs of these latter results will not require any use of the uniformisation theorem, we will find it convenient to use some of the more elementary results and techniques from Jensen's fine-structural theory of L. We thus provide a brief review of the pertinent parts of Jensen's works in § 0, where a list of general preliminaries is also furnished. We remark that some of the techniques which we use in the present paper have been used by us previously in [6] to prove various results about β-models of analysis. Since β-models for analysis are analogous to transitive models for set theory, this is not surprising. (shrink)

Building on the content, developmental, and neurological evidence that there are numerous parallels between waking cognition and dreaming, this article argues that the likely neural substrate that supports dreaming, which was discovered through converging lesion and neuroimaging studies, may be a subsystem of the waking default network, which is active during mind wandering, daydreaming, and simulation. Support for this hypothesis would strengthen the case for a more general neurocognitive theory of dreaming that starts with established findings and concepts derived from (...) studies of waking cognition and neurocognition. If this theory is correct, then dreaming may be the quintessential cognitive simulation because it is often highly complex, often includes a vivid sensory environment, unfolds over a duration of a few minutes to a half hour, and is usually experienced as real while it is happening. (shrink)

We develop fundamental aspects of the theory of metric, Hilbert, and Banach spaces in the context of subsystems of second-order arithmetic. In particular, we explore issues having to do with distances, closed subsets and subspaces, closures, bases, norms, and projections. We pay close attention to variations that arise when formalizing definitions and theorems, and study the relationships between them.

In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA0*, which consists of the axioms of discrete ordered semi‐rings with exponentiation, Δ10 comprehension and Π00 induction, and which is known as a weaker system than the popularbase theory RCA0: 1. Bisep(Δ10, Σ10)‐Det* ↔ WKL0, 2. Bisep(Δ10, Σ20)‐Det* ↔ (...) ATR0 + Σ11 induction, 3. Bisep(Σ10, Σ20)‐Det* ↔ Sep(Σ10, Σ20)‐Det* ↔ Π11‐CA0, 4. Bisep(Δ20, Σ20)‐Det* ↔ Π11‐TR0, where Det* stands for the determinacy of infinite games in the Cantor space (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim). (shrink)

A computational theory of consciousness should include a quantitative measure of consciousness, or MoC, that (i) would reveal to what extent a given system is conscious, (ii) would make it possible to compare not only different systems, but also the same system at different times, and (iii) would be graded, because so is consciousness. However, unless its design is properly constrained, such an MoC gives rise to what we call the boundary problem: an MoC that labels a system as conscious (...) will do so for some – perhaps most – of its subsystems, as well as for irrelevantly extended systems (e.g., the original system augmented with physical appendages that contribute nothing to the properties supposedly supporting consciousness), and for aggregates of individually conscious systems (e.g., groups of people). This problem suggests that the properties that are being measured are epiphenomenal to consciousness, or else it implies a bizarre proliferation of minds. We propose that a solution to the boundary problem can be found by identifying properties that are intrinsic or systemic: properties that clearly differentiate between systems whose existence is a matter of fact, as opposed to those whose existence is a matter of interpretation (in the eye of the beholder). We argue that if a putative MoC can be shown to be systemic, this ipso facto resolves any associated boundary issues. As test cases, we analyze two recent theories of consciousness in light of our definitions: the Integrated Information Theory and the Geometric Theory of consciousness. (shrink)

In Spescha and Strahm [15], a system of explicit mathematics in the style of Feferman [6] and [7] is introduced, and in Spescha and Strahm [16] the addition of the join principle to is studied. Changing to intuitionistic logic, it could be shown that the provably terminating operations of are the polytime functions on binary words. However, although strongly conjectured, it remained open whether the same holds true for the corresponding theory with classical logic. This note supplements a proof of (...) this conjecture. (shrink)

The pointwise ergodic theorem is nonconstructive. In this paper, we examine origins of this non-constructivity, and determine the logical strength of the theorem and of the auxiliary statements used to prove it. We discuss properties of integrable functions and of measure preserving transformations and give three proofs of the theorem, though mostly focusing on the one derived from the mean ergodic theorem. All the proofs can be carried out in ACA₀; moreover, the pointwise ergodic theorem is equivalent to (ACA) over (...) the base theory RCA₀. (shrink)

Instantiation Theory presents a new, general unification algorithm that is of immediate use in building theorem provers and logic programming systems. Instantiation theory is the study of instantiation in an abstract context that is applicable to most commonly studied logical formalisms. The volume begins with a survey of general approaches to the study of instantiation, as found in tree systems, order-sorted algebras, algebraic theories, composita, and instantiation systems. A classification of instantiation systems is given, based on properties of substitutions, (...) degree of type strictness, and well-foundedness of terms. Equational theories and the use of typed variables are studied in terms of quotient homomorphisms and embeddings, respectively. Every instantiation system is a quotient system of a subsystem of first-order term instantiation. The general unification algorithm is developed as an application of the basic theory. Its soundness is rigorously proved, and its completeness and efficiency are verfied for certain classes of instantiation systems. Appropriate applications of the algorithm include unification of first-order terms, order-sorted terms, and first-order formulas modulo alpha-conversion, as well as equational unification using simple congruences. (shrink)

Some axiomatic theories of truth and related subsystems of second-order arithmetic are surveyed and shown to be conservative over their respective base theory. In particular, it is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS of [2] are conservative over PA.

Physical theories are complex and necessary tools for gaining new knowledge about their areas of application. A distinction is made between abstract and practical theories. The last are constantly being improved in the cognitive activity of professional physicists and studied by future physicists. A variant of the philosophy of physics based on a modified structural-nominative reconstruction of practical theories is proposed. Readers should decide whether this option is useful for their understanding of the philosophy of physics, as (...) well as other philosophies of particular sciences. (shrink)

There is “something more” to money, as this incisive review shows. The target article's shortcoming is its overextension of the “drug” metaphor as a blend of features that do not fit the rationalistic economics and behavioral psychologies summarized as tool theories, but this may be resolved by viewing money as a particular case of the more general evolutionary phenomenon of emergent subsystem autonomy. (Published Online April 5 2006).

Evolutionary Psychology is based on the idea that the mind is a set of special purpose thinking devices or modules whose domain-specific structure is an adaptation to ancestral environments. The modular view of the mind is an uncontroversial description of the periphery of the mind, the input-output sensorimotor and affective subsystems. The novelty of EP is the claim that higher order cognitive processes also exhibit a modular structure. Autism is a primary case study here, interpreted as a developmental failure (...) of a module devoted to social intelligence or Theory of Mind. In this article I reappraise the arguments for innate modularity of TOM and argue that they fail. TOM ability is a consequence of domain general development scaffolded by early, innately specified, sensorimotor abilities. The alleged Modularity of TOM results from interpreting the outcome of developmental failures characteristic of autism at too high a level of cognitive abstraction. (shrink)

Machine generated contents note: 1. Introduction Juliette Kennedy and Roman Kossak; 2. Historical remarks on Suslin's problem Akihiro Kanamori; 3. The continuum hypothesis, the generic-multiverse of sets, and the [OMEGA] conjecture W. Hugh Woodin; 4. [omega]-Models of finite set theory Ali Enayat, James H. Schmerl and Albert Visser; 5. Tennenbaum's theorem for models of arithmetic Richard Kaye; 6. Hierarchies of subsystems of weak arithmetic Shahram Mohsenipour; 7. Diophantine correct open induction Sidney Raffer; 8. Tennenbaum's theorem and recursive reducts James (...) H. Schmerl; 9. History of constructivism in the 20th century A. S. Troelstra; 10. A very short history of ultrafinitism Rose M. Cherubin and Mirco A. Mannucci; 11. Sue Toledo's notes of her conversations with Gödel in 1972-1975 Sue Toledo; 12. Stanley Tennenbaum's Socrates Curtis Franks; 13. Tennenbaum's proof of the irrationality of [the square root of] 2́. (shrink)

Saunders Mac Lane has drawn attention many times, particularly in his book Mathematics: Form and Function, to the system of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, , of Transitive Containment, we shall refer as . His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasises, one that is (...) adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke–Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory , and obtain an apparently new proof that is not finitely axiomatisable; we study Friedman's strengthening of , and the Forster–Kaye subsystem of , and use forcing over ill-founded models and forcing to establish independence results concerning and ; we show, again using ill-founded models, that proves the consistency of ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret and Boffa that proves a weak form of Stratified Collection, and that is a conservative extension of for stratified sentences, from which we deduce that proves a strong stratified version of ; we analyse the known equiconsistency of with the simple theory of types and give Lake's proof that an instance of Mathematical Induction is unprovable in Mac Lane's system; we study a simple set theoretic assertion—namely that there exists an infinite set of infinite sets, no two of which have the same cardinal—and use it to establish the failure of the full schema of Stratified Collection in ; and we determine the point of failure of various other schemata in . The paper closes with some philosophical remarks. (shrink)

This paper is a companion to work of Feferman, Jäger, Glaß, and Strahm on the proof theory of the type two functionals μ and E1 in the context of Feferman-style applicative theories. In contrast to the previous work, we analyze these two functionals in the context of Schlüter's weakened applicative basis PRON which allows for an interpretation in the primitive recursive indices. The proof-theoretic strength of PRON augmented by μ and E1 is measured in terms of the two (...) class='Hi'>subsystems of second order arithmetic, Π10-CA and Π11-CA, respectively. (shrink)

In the 80's Pierangelo Miglioli, starting from motivations in the framework of Abstract Data Types and Program Synthesis, introduced semiconstructive theories, a family of large subsystems of classical theories that guarantee the computability of functions and predicates represented by suitable formulas. In general, the above computability results are guaranteed by algorithms based on a recursive enumeration of the theorems of the whole system. In this paper we present a family of semiconstructive systems, we call uniformly semiconstructive, that (...) provide computational procedures only involving formulas with bounded complexity. We present several examples of uniformly semiconstructive systems containing Harrop theories, induction principles and some well-known predicate intermediate principles. Among these, we give an account of semiconstructive and uniformly semiconstructive systems which lie between Intuitionistic and Classical Arithmetic and we discuss their constructive incompatibility. (shrink)

The logical system Hyperproof and the computer implementation of it--both created by Jon Barwise and John Etchemendy--present a radical new approach to modeling and teaching about reasoning. Hyperproof is a heterogeneous proof system that uses both sentences and diagrams as steps in proofs. This dissertation addresses important logical, philosophical, and pedagogical issues that Hyperproof raises. We formalize the syntax and semantics of Hyperproof, show that the major inference rules are valid, and give completeness results for four subsystems of Hyperproof. (...) We address philosophical issues raised by the logical analysis, including the importance of the presence of homomorphism between diagrams and the worlds they represent. We also apply the constructivist educational philosophy to create a detailed explanation of how to teach analytic reasoning with Hyperproof, and we discuss how Hyperproof can be augmented to teach about reasoning with different types of domains. (shrink)

This paper starts by investigating Ackermann's interpretation of finite set theory in the natural numbers. We give a formal version of this interpretation from Peano arithmetic (PA) to Zermelo-Fraenkel set theory with the infinity axiom negated (ZF−inf) and provide an inverse interpretation going the other way. In particular, we emphasize the precise axiomatization of our set theory that is required and point out the necessity of the axiom of transitive containment or (equivalently) the axiom scheme of ∈-induction. This clarifies the (...) nature of the equivalence of PA and ZF−inf and corrects some errors in the literature. We also survey the restrictions of the Ackermann interpretation and its inverse to subsystems of PA and ZF−inf, where full induction, replacement, or separation is not assumed. The paper concludes with a discussion on the problems one faces when the totality of exponentiation fails, or when the existence of unordered pairs or power sets is not guaranteed. (shrink)

We give an overview of recent results in ordinal analysis. Therefore, we discuss the different frameworks used in mathematical proof-theory, namely "subsystem of analysis" including "reverse mathematics", "Kripke-Platek set theory", "explicit mathematics", "theories of inductive definitions", "constructive set theory", and "Martin-Löf's type theory".

One objective of this paper is the determination of the proof-theoretic strength of Martin-Löf's type theory with a universe and the type of well-founded trees. It is shown that this type system comprehends the consistency of a rather strong classical subsystem of second order arithmetic, namely the one with Δ 2 1 comprehension and bar induction. As Martin-Löf intended to formulate a system of constructive (intuitionistic) mathematics that has a sound philosophical basis, this yields a constructive consistency proof of a (...) strong classical theory. Also the proof-theoretic strength of other inductive types like Aczel's type of iterative sets is investigated in various contexts.Further, we study metamathematical relations between type theories and other frameworks for formalizing constructive mathematics, e.g. Aczel's set theories and theories of operations and classes as developed by Feferman. (shrink)

In this thesis I outline a view of primary legislation from a systems perspective. I suggest that systems theory and, in particular, autopoietic theory, as modified by field theory, is a mechanism for understanding how society operates. The description of primary legislation that I outline differs markedly from any conventional definition in that I argue that primary legislation is not, and indeed cannot be, either a law or any of the euphemisms that are usually accorded to an enactment by a (...) parliament. I cite two reasons for such a conclusion. The primary reason for my conclusion is that I see primary legislation as being an output of a particular subsystem of society, while the law is the output of another subsystem of society. I argue that these outputs are the discrete products of separate subsystems of society. I argue that primary legislation should be viewed as a trinity. The first state of this trinity is that, upon enactment, primary legislation is a brute fact in that it is but a thing and the only property of this thing is that of being a text. The second state of this trinity is that following the act of enactment, the thing enacted will be reproduced and this reproduction is a separate thing that will sit in some repository until used. The third state of this trinity is that, upon use, this thing that is primary legislation will be transformed into an object and the user will attribute such functions and attributes to that object as are appropriate to the context within which the object is used. The thing has therefore become an object and an institutional fact. The second reason for my conclusion that primary legislation is not a law relates to the fact that the thing that is primary legislation is a text and the only function of a text is that it is available to be read. That is to say, of itself, a text is incapable of doing anything: it is the reader who defines the status of the text and attributes functions and attributes. Upon use, primary legislation thus becomes a censored input for future action and one of these actions may be some statement by a court of law. I assert that the view of primary legislation that has been accepted within the body politic is the product of the discourse of a particular subsystem of society that I have designated 'the legal practice', and I outline why and how this has occurred. Outlining a view about primary legislation also necessitates outlining a view as to the nature of the law. I assert that the law is a myth and I see this myth as a product of the discourse of the legal practice. I have asserted that although it is the judges that state the law, such statements flow from the discourse of those who practise the law. (shrink)

In this work a double exponential time inseparability result is proven for a finitely axiomatizable first order theory Q₊. The theory, subset of Presburger theory of addition S₊, is the additive fragment of Robinson system Q. We prove that every set that separates Q₊` from the logically false sentences of addition is not recognizable by any Turing machine working in double exponential time. The lower bound is given both in the non-deterministic and in the linear alternating time models. The result (...) implies also that any theory of addition that is consistent with Q₊—in particular any theory contained in S₊—is at least double exponential time difficult. Our inseparability result is an improvement on the known lower bounds for arithmetic theories. Our proof uses a refinement and adaptation of the technique that Fischer and Rabin used to prove the difficulty of S₊. Our version of the technique can be applied to any incomplete finitely axiomatizable system in which all of the necessary properties of addition are provable. (shrink)

Tsang and Caves suggested the idea of a quantum-mechanics-free subsystem in 2012. We contend that Sudarshan’s viewpoint on Koopman-von Neumann mechanics is realized in the quantum-mechanics-free subsystem. Since quantum-mechanics-free subsystems are being experimentally realized, Koopman-von Neumann mechanics is essentially transformed into an engineering science.

The English Synopsis is after the text of the book. The book presents an original and generalizing substantive vision of the philosophy of science through the prism of a detailed analysis of the polysystem structure of scientific theories. Theories are considered, firstly, as complex specialized forms of developed scientific thinking about the realities studied by natural science, secondly, as constantly improving tools for producing new knowledge in interaction with experimental research, and thirdly, as carriers of ordered and verified (...) knowledge. Emphasis is placed on their nominal and ontic subsystems. The book develops personal and joint research of the authors (theoretical physicist and philosopher), the experience of teaching philosophy of physics at NaUKMA, philosophy of science at the Higher School of Philosophy at the H. Skovoroda Institute of Philosophy of the National Academy of Sciences of Ukraine and theoretical physics at the National Technical University "Ihor Sikorsky Kyiv Polytechnic Institute". The research is based on a significant source base covering works of modern Western researchers in natural science and philosophy of science. For students, teachers, and scientists who are interested in the problems of modern philosophy of science and have a certain amount of scientific knowledge. It will also be useful for high school students who are eager to become scientists. (shrink)

Human knowledge is a phenomenon whose roots extend from the cultural, through the neural and the biological and finally all the way down into the Precambrian “primordial soup.” The present paper reports an attempt at understanding this Greater System of Knowledge (GSK) as a hierarchical nested set of selection processes acting concurrently on several different scales of time and space. To this end, a general selection theory extending mainly from the work of Hull and Campbell is introduced. The perhaps most (...) drastic change from previous similar theories is that replication is revealed as a composite function consisting of what is referred to as memory and synthesis. This move is argued to drastically improve the fit between theory and human-related knowledge systems. The introduced theory is then used to interpret the subsystems of the GSK and their interrelations. This is done to the end of demonstrating some of the new perspectives offered by this view. (shrink)

Philosophy of Science; Ukraine; Polysytemic nature of theories; Practical theories; Subsystems of a theory.

In this paper we prove conservation theorems for theories of classical first-order arithmetic over their intuitionistic version. We also prove generalized conservation results for intuitionistic theories when certain weak forms of the principle of excluded middle are added to them. Members of two families of subsystems of Heyting arithmetic and Buss-Harnik’s theories of intuitionistic bounded arithmetic are the intuitionistic theories we consider. For the first group, we use a method described by Leivant based on the (...) negative translation combined with a variant of Friedman’s translation. For the second group, we use Avigad’s forcing method. (shrink)

We develop measure theory in the context of subsystems of second order arithmetic with restricted induction. We introduce a combinatorial principleWWKL (weak-weak König's lemma) and prove that it is strictly weaker thanWKL (weak König's lemma). We show thatWWKL is equivalent to a formal version of the statement that Lebesgue measure is countably additive on open sets. We also show thatWWKL is equivalent to a formal version of the statement that any Borel measure on a compact metric space is countably (...) additive on open sets. (shrink)

This paper formulates a notion of independence of subobjects of an object in a general (i.e. not necessarily concrete) category. Subobject independence is the categorial generalization of what is known as subsystem independence in the context of algebraic relativistic quantum field theory. The content of subobject independence formulated in this paper is morphism co-possibility: two subobjects of an object will be defined to be independent if any two morphisms on the two subobjects of an object are jointly implementable by a (...) single morphism on the larger object. The paper investigates features of subobject independence in general, and subobject independence in the category of C∗ - algebras with respect to operations (completely positive unit preserving linear maps on C∗ - algebras)as morphisms is suggested as a natural subsystem independence axiom to express relativistic locality of the covariant functor in the categorial approach to quantum field theory. (shrink)

A survey is presented of possible connections between quantum theory and consciousness that have been proposed in the past and those that have now opened as a result of work on cognitive subsystems of the brain in the past 10 years. It is argued that, in the light of such work and in contrast to speculations prior to it, these connections can now be seen as necessary and their investigation as feasible.

We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models. and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey's Theorem for Pairs.

The minimal ingredients to describe a quantum system are a Hamiltonian, an initial state, and a preferred tensor product structure that encodes a decomposition into subsystems. We explore a top-down approach in which the subsystems emerge from the spectrum of the whole system. This approach has been referred to as quantum mereology. First we show that decomposing a system into subsystems is equivalent to decomposing a spectrum into other spectra. Then we argue that the number of (...) class='Hi'>subsystems (the volume of the system) can be inferred from the spectrum itself. In local models, this information is encoded in finite size corrections to the Gaussian density of states. (shrink)

My dissertation establishes the basis for a systematic outlook on the role language plays in human cognition. It is an investigation based on a cognitive conception of language, as opposed to communicative conceptions, viz. those that suppose that language plays no role in cognition. I focus, in Chapter 2, on three paradigmatic theories adopting this perspective, each offering different views on how language contributes to or changes cognition. -/- In Chapter 3, I criticize current views held by dual-process theorists, (...) and I develop a picture of the complex interaction between language and cognition that I deem more plausible by using resources from the literature on the evolution of the faculty of language. Rather than trying to find one general explanation for all cognitive processes, I take seriously the idea that our mind is composed of many subsystems, and that language can interact and modify each in different ways. There is no reason offered in the empirical literature—besides maybe parsimony—that suggest that language has to interact in the same ways with all cognitive processes. Yet, this is seemingly taken for granted, especially within dual-process approaches. -/- On my view, it is a central requirement for a theory of the role of language in cognition to explain how language might have effects, at once, on and within various parts of cognition. In Chapter 4, I explore how this framework can modify how we think about some experiments in psychology, specifically in research on categorization. My idea is that language, once it evolved, changed how some cognitive capacities worked and interacted with each other, but did so in more than one or two ways. Cognitive systems are changed in very different ways—sometimes the transformation is very subtle, such as our way of forming categories by using how similar objects are, while other times it is deep and changes the very way the system works. (shrink)

The most puzzling issue in the foundations of quantum mechanics is perhaps that of the status of the wave function of a system in a quantum universe. Is the wave function objective or subjective? Does it represent the physical state of the system or merely our information about the system? And if the former, does it provide a complete description of the system or only a partial description? We shall address these questions here mainly from a Bohmian perspective, and shall (...) argue that part of the difficulty in ascertaining the status of the wave function in quantum mechanics arises from the fact that there are two different sorts of wave functions involved. The most fundamental wave function is that of the universe. From it, together with the configuration of the universe, one can define the wave function of a subsystem. We argue that the fundamental wave function, the wave function of the universe, has a law-like character. (shrink)