Results for 'Ary Khachaturian'

107 found
Order:
  1.  16
    Statist Political Science and American Marxism: A Historical Encounter.Rafael Khachaturian - 2018 - Contemporary Political Theory 17 (1):28-48.
  2.  13
    The Modern World-System IV: Centrist Liberalism Triumphant, 1789–1914, Immanuel Wallerstein, Berkeley: University of California Press, 2011. [REVIEW]Rafael Khachaturian - 2013 - Historical Materialism 21 (4):273-288.
    The book continues Immanuel Wallerstein’s historical narrative of the modern world-system. It focuses primarily on the social and political developments in the European core during the nineteenth century, tracing the rise of liberal hegemony, the growth of the administrative state, and the emergence of modern social science. It also examines the rise of anti-systemic socialist, feminist, and nationalist movements that challenged the liberal project. The book successfully illustrates how the world-systems framework can be used to analyse the intersection between the (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  3.  9
    Book Review Section 1. [REVIEW] Carbone Jr, Donald Ary, Robert Karabinus, Paul H. Mattingly, W. Warren Wagar, Herbert G. Vaughn, Michael H. Jessup, Clinton Humbolt, Nicholas D. Colucci, Lewis E. Cloud, Thomas E. Spencer & Richard Gambino - 1974 - Educational Studies 5 (4):221-247.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4. Normal Forms for Characteristic Functions on N-Ary Relations.Jan van Eijck - unknown
    Functions of type n are characteristic functions on n-ary relations. Keenan [5] established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, i.e., functions of type n that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker [3] improved on these by proposing an invariance condition that characterizes the functions with a reducible counterpart with the same behaviour on product relations. The present paper (...)
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  5. Canonical Calculi with (N,K)-Ary Quantifiers.Arnon Avron - unknown
    Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a connective is introduced and no other connective is mentioned. [2] provides a constructive coherence criterion for the non-triviality of such systems and shows that a system of this kind admits cut-elimination iff it is coherent. The semantics of such systems is provided using two-valued non-deterministic matrices (2Nmatrices). [23] extends these results (...)
     
    Export citation  
     
    Bookmark   1 citation  
  6.  2
    Representing N-Ary Relations in the Semantic Web.Marco Giunti, Giuseppe Sergioli, Giuliano Vivanet & Simone Pinna - forthcoming - Logic Journal of the IGPL.
    Knowledge representation is a central issue for Artificial Intelligence and the Semantic Web. In particular, the problem of representing n-ary relations in RDF-based languages such as RDFS or OWL by no means is an obvious one. With respect to previous attempts, we show why the solutions proposed by the well known W3C Working Group Note on n-ary relations are not satisfactory on several scores. We then present our abstract model for representing n-ary relations as directed labeled graphs, and we show (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  4
    The 2N-Ary Choice Tree Model for N-Alternative Preferential Choice.Lena M. Wollschläger & Adele Diederich - 2012 - Frontiers in Psychology 3.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  8.  9
    The Expressive Power of K-Ary Exclusion Logic.Raine Rönnholm - 2019 - Annals of Pure and Applied Logic 170 (9):1070-1099.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  25
    Capturing K -Ary Existential Second Order Logic with K -Ary Inclusion–Exclusion Logic.Raine Rönnholm - 2018 - Annals of Pure and Applied Logic 169 (3):177-215.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  13
    Unreducible N-Ary Quantifiers in Natural Language.Edward L. Keenan - 1987 - In Peter Gärdenfors (ed.), Generalized Quantifiers. Reidel Publishing Company. pp. 109--150.
  11. Reviews : Elizabeth Wright (Ed.), Feminism and Psychoanalysis: A Critical Diction Ary. Oxford: Blackwell, 1992. £60, Paper, £16.95, Xix + 485 Pp. [REVIEW]Lois McNay - 1994 - History of the Human Sciences 7 (1):128-130.
  12.  44
    M ARY J O N YE , The Cambridge History of Science. Volume 5: The Modern Physical and Mathematical Sciences. Cambridge: Cambridge University Press, 2003. Pp. Xxix+678. ISBN 0-521-57199-5. £65.00, $95.00. [REVIEW]Matthew Stanley - 2006 - British Journal for the History of Science 39 (1):123-125.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  20
    Modal Logics Withn-Ary Connectives.S. Ghilardi & G. C. Meloni - 1990 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 36 (3):193-215.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  14.  6
    Finite Generation Problem and N-Ary Quantifiers.Lauri Hella & Kerkko Luosto - 1995 - In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 63--104.
  15.  9
    A Class of Conceptual Spaces Consisting of Boundaries of Infinite P -Ary Trees.Roman Urban & Simona Mróz - 2019 - Journal of Logic, Language and Information 28 (1):73-95.
    A new construction of a certain conceptual space is presented. Elements of this conceptual space correspond to concept elements of reality, which potentially comprise an infinite number of qualities. This construction of a conceptual space solves a problem stated by Dietz and his co-authors in 2013 in the context of Voronoi diagrams. The fractal construction of the conceptual space is that this problem simply does not pose itself. The concept of convexity is discussed in this new conceptual space. Moreover, the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  13
    The Influence Of Oghuz Turkish And Using Of Synonym Compound Verb That Was Constructed Auxilıary Verbs Kıl- And Et- On The Sayf-I Sarayı’s Gulistan Bi’T-Turki.Mustafa Yildiz - 2010 - Journal of Turkish Studies 5:687-706.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  18
    Narrow Coverings of Ω-Ary Product Spaces.Randall Dougherty - 1997 - Annals of Pure and Applied Logic 88 (1):47-91.
    Results of Sierpiski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is ‘narrow’ in a corresponding direction; that is, each line in that direction intersects the subset in a small set. For example, if the set ω × ω is partitioned into two pieces along the diagonal, then one piece meets every horizontal line in a finite set, and the other piece meets each vertical line in a finite set. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  18.  3
    Modal Logics with N‐Ary Connectives.S. Ghilardi & G. C. Meloni - 1990 - Mathematical Logic Quarterly 36 (3):193-215.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  9
    Canonical Signed Calculi with Multi-Ary Quantifiers.Anna Zamansky & Arnon Avron - 2012 - Annals of Pure and Applied Logic 163 (7):951-960.
  20.  14
    The Number of Moduli in $N$-Ary Relations.Robert E. Clay - 1960 - Notre Dame Journal of Formal Logic 1 (3):118-121.
  21.  6
    Čulík Karel II. N-Ary Grammars and the Description of Mapping of Languages. English with English and Czech Summaries. Kybernetika , Vol. 6 , Pp. 99–117. [REVIEW]Gene F. Rose - 1973 - Journal of Symbolic Logic 38 (3):525-525.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  22.  4
    Ary Mothersill "Beauty Restored". [REVIEW]Malcolm Budd - 1986 - Philosophical Quarterly 36 (42):89.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  23. 10. Multiple Originals: New Approaches to Hebrew Bible Textual Criticism by G Ary D. M Artin Multiple Originals: New Approaches to Hebrew Bible Textual Criticism by G Ary D. M Artin (Pp. 168-169). [REVIEW]Eve Levavi Feinstein, Stephen C. Russell, Jeremy Penner, Eric D. Reymond, Edwin Yamauchi, Mark W. Chavalas, Brian Brown, Carol Bier, Ronald J. Leprohon & Holger Kockelmann - 2013 - Journal of the American Oriental Society 133 (1).
     
    Export citation  
     
    Bookmark  
  24. Review: Karel Culik II, N-Ary Grammars and the Descriptions of Mapping of Languages. [REVIEW]Gene F. Rose - 1973 - Journal of Symbolic Logic 38 (3):525-525.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  18
    N-Ary Almost Recursive Functions.John W. Berry - 1974 - Mathematical Logic Quarterly 20 (34-36):551-559.
  26.  33
    A Warning About the Choice of Primitive Operators in Modal Logic.David Makinson - 1973 - Journal of Philosophical Logic 2 (2):193 - 196.
    Draws attention to some unexpected consequences of using a zero-ary connective in modal propositional logic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  27.  17
    Hierarchies in Φ‐Spaces and Applications.Victor L. Selivanov - 2005 - Mathematical Logic Quarterly 51 (1):45-61.
    We establish some results on the Borel and difference hierarchies in φ-spaces. Such spaces are the topological counterpart of the algebraic directed-complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non-collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28.  18
    Modal Aggregation and the Theory of Paraconsistent Filters.Peter Apostoli - 1996 - Mathematical Logic Quarterly 42 (1):175-190.
    This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which contains I, is closed under supersets on I, and contains ∪{Xi ≤ Xj : 0 ≤ i < j ≤ k} whenever it contains the subsets X0,…, Xk. The mathematical content of the proof that weakly aggregative modal logic (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  29. Species as Family Resemblance Concepts: The (Dis-)Solution of the Species Problem?Massimo Pigliucci - 2003 - Bioessays 25 (6):596-602.
    The so-called ‘‘species problem’’ has plagued evolution- ary biology since before Darwin’s publication of the aptly titled Origin of Species. Many biologists think the problem is just a matter of semantics; others complain that it will not be solved until we have more empirical data. Yet, we don’t seem to be able to escape discussing it and teaching seminars about it. In this paper, I briefly examine the main themes of the biological and philosophical liter- atures on the species problem, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   23 citations  
  30. From Simple Associations to Systematic Reasoning: A Connectionist Representation of Rules, Variables, and Dynamic Binding Using Temporal Synchrony.Lokendra Shastri & Venkat Ajjanagadde - 1993 - Behavioral and Brain Sciences 16 (3):417-51.
    Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency – as though these inferences were a reflexive response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuronlike elements represent a large (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   108 citations  
  31.  27
    Weakly Aggregative Modal Logic: Characterization and Interpolation.Jixin Liu, Yanjing Wang & Yifeng Ding - 2019 - In Patrick Blackburn, Emiliano Lorini & Meiyun Guo (eds.), Logic, Rationality, and Interaction 7th International Workshop, LORI 2019, Chongqing, China, October 18–21, 2019, Proceedings. pp. 153-167.
    Weakly Aggregative Modal Logic (WAML) is a collection of disguised polyadic modal logics with n-ary modalities whose arguments are all the same. WAML has some interesting applications on epistemic logic and logic of games, so we study some basic model theoretical aspects of WAML in this paper. Specifically, we give a van Benthem-Rosen characterization theorem of WAML based on an intuitive notion of bisimulation and show that each basic WAML system Kn lacks Craig Interpolation.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32. A Natural Extension of Natural Deduction.Peter Schroeder-Heister - 1984 - Journal of Symbolic Logic 49 (4):1284-1300.
    The framework of natural deduction is extended by permitting rules as assumptions which may be discharged in the course of a derivation. this leads to the concept of rules of higher levels and to a general schema for introduction and elimination rules for arbitrary n-ary sentential operators. with respect to this schema, (functional) completeness "or", "if..then" and absurdity is proved.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   59 citations  
  33.  4
    Order- Dual Realational Semantics for Non-Distributive Propositional Logics.Chrysafis Hartonas - 2017 - Logic Journal of the IGPL 25 (2):145-182.
    This article addresses and resolves some issues of relational, Kripke-style, semantics for the logics of bounded lattice expansions with operators of well-defined distribution types, focusing on the case where the underlying lattice is not assumed to be distributive. It therefore falls within the scope of the theory of Generalized Galois Logics, introduced by Dunn, and it contributes to its extension. We introduce order-dual relational semantics and present a semantic analysis and completeness theorems for non-distributive lattice logic with n -ary additive (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  34. Who Needs (to Assume) Hume's Principle? July 2006.Andrew Boucher - manuscript
    In the Foundations of Arithmetic, Frege famously developed a theory which today goes by the name of logicism - that it is possible to prove the truths of arithmetic using only logical principles and definitions. Logicism fell out of favor for various reasons, most spectacular of which was that the system, which Frege thought would definitively prove his thesis, turned out to be inconsistent. In the early 1980s a movement called neo-logicism was begun by Crispin Wright. Neo-logicism holds that Frege (...)
     
    Export citation  
     
    Bookmark  
  35.  93
    A Graph-Theoretic Method to Define Any Boolean Operation on Partitions.David Ellerman - 2019 - The Art of Discrete and Applied Mathematics 2 (2):1-9.
    The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  22
    Complexity of Equations Valid in Algebras of Relations Part I: Strong Non-Finitizability.Hajnal Andréka - 1997 - Annals of Pure and Applied Logic 89 (2):149-209.
    We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  37.  22
    Structure and Definability in General Bounded Arithmetic Theories.Chris Pollett - 1999 - Annals of Pure and Applied Logic 100 (1-3):189-245.
    The bounded arithmetic theories R2i, S2i, and T2i are closely connected with complexity theory. This paper is motivated by the questions: what are the Σi+1b-definable multifunctions of R2i? and when is one theory conservative over another? To answer these questions we consider theories , and where induction is restricted to prenex formulas. We also define which has induction up to the 0 or 1-ary L2-terms in the set τ. We show and and for . We show that the -multifunctions of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  38.  22
    A Mereotopology Based on Sequent Algebras.Dimiter Vakarelov - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):342-364.
    Mereotopology is an extension of mereology with some relations of topological nature like contact. An algebraic counterpart of mereotopology is the notion of contact algebra which is a Boolean algebra whose elements are considered to denote spatial regions, extended with a binary relation of contact between regions. Although the language of contact algebra is quite expressive to define many useful mereological relations and mereotopological relations, there are, however, some interesting mereotopological relations which are not definable in it. Such are, for (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  39
    Aquinas and the Metaphysics of Divine Providence - De Potentia Dei 3, 7 and Super Librum de Causis Expositio.Ignacio Silva - 2019 - Studium : revista de filosofía y teología 22 (43):53-72.
    The main goal of this paper is tocompare how Thomas Aquinas expressedhis doctrine of providence through second-ary causes, making use of both Aristotelianand Neo-Platonic principles, in the seventharticle of the third question of his Quaes-tiones Disputatae De Potentia Dei and his Super Librum de Causis Expositio , in whichhe intends to solve the problem of themetaphysical mechanism by which God providentially guides creation. I will rst present his arguments as they appear inthe disputed questions, followed by a pre-sentation of his (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  40.  11
    Multifunction Algebras and the Provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.
    We introduce multifunction algebras B i τ where τ is a set of 0 or 1-ary terms used to bound recursion lengths. We show that if for all ℓ ∈ τ we have ℓ ∈ O then B i τ = FP Σ i−1 p , those multifunctions computable in polynomial time with at most O )) queries to a Σ i−1 p witness oracle for ℓ ∈ τ and p a polynomial. We use our algebras to obtain independence results (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  41.  19
    Type-Amalgamation Properties and Polygroupoids in Stable Theories.John Goodrick, Byunghan Kim & Alexei Kolesnikov - 2015 - Journal of Mathematical Logic 15 (1):1550004.
    We show that in a stable first-order theory, the failure of higher dimensional type amalgamation can always be witnessed by algebraic structures that we call n-ary polygroupoids. This generalizes a result of Hrushovski in [16] that failures of 4-amalgamation are witnessed by definable groupoids. The n-ary polygroupoids are definable in a mild expansion of the language.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  77
    Naming and Diagonalization, From Cantor to Gödel to Kleene.Haim Gaifman - 2006 - Logic Journal of the IGPL 14 (5):709-728.
    We trace self-reference phenomena to the possibility of naming functions by names that belong to the domain over which the functions are defined. A naming system is a structure of the form ,{ }), where D is a non-empty set; for every a∈ D, which is a name of a k-ary function, {a}: Dk → D is the function named by a, and type is the type of a, which tells us if a is a name and, if it is, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  6
    Dominions and Primitive Positive Functions.Miguel Campercholi - 2018 - Journal of Symbolic Logic 83 (1):40-54.
    LetA≤Bbe structures, and${\cal K}$a class of structures. An elementb∈BisdominatedbyArelative to${\cal K}$if for all${\bf{C}} \in {\cal K}$and all homomorphismsg,g':B → Csuch thatgandg'agree onA, we havegb=g'b. Our main theorem states that if${\cal K}$is closed under ultraproducts, thenAdominatesbrelative to${\cal K}$if and only if there is a partial functionFdefinable by a primitive positive formula in${\cal K}$such thatFB =bfor somea1,…,an∈A. Applying this result we show that a quasivariety of algebras${\cal Q}$with ann-ary near-unanimity term has surjective epimorphisms if and only if$\mathbb{S}\mathbb{P}_n \mathbb{P}_u \left$has surjective epimorphisms. It (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  73
    Schönfinkel-Type Operators for Classical Logic.Katalin Bimbó - 2010 - Studia Logica 95 (3):355-378.
    We briefly overview some of the historical landmarks on the path leading to the reduction of the number of logical connectives in classical logic. Relying on the duality inherent in Boolean algebras, we introduce a new operator ( Nallor ) that is the dual of Schönfinkel’s operator. We outline the proof that this operator by itself is sufficient to define all the connectives and operators of classical first-order logic ( Fol ). Having scrutinized the proof, we pinpoint the theorems of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  12
    Testing Measurement Invariance Across Groups of Children with and Without Attention-Deficit/ Hyperactivity Disorder: Applications for Word Recognition and Spelling Tasks.Patrícia S. Lúcio, Giovanni Salum, Walter Swardfager, Jair de Jesus Mari, Pedro M. Pan, Rodrigo A. Bressan, Ary Gadelha, Luis A. Rohde & Hugo Cogo-Moreira - 2017 - Frontiers in Psychology 8.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  46.  17
    Singulary Extensional Connectives: A Closer Look. [REVIEW]I. L. Humberstone - 1997 - Journal of Philosophical Logic 26 (3):341-356.
    The totality of extensional 1-ary connectives distinguishable in a logical framework allowing sequents with multiple or empty (alongside singleton) succedents form a lattice under a natural partial ordering relating one connective to another if all the inferential properties of the former are possessed by the latter. Here we give a complete description of that lattice; its Hasse diagram appears as Figure 1 in §2. Simple syntactic descriptions of the lattice elements are provided in §3; §§4 and 5 give some additional (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  47.  31
    Aggregation and Idempotence.Lloyd Humberstone - 2013 - Review of Symbolic Logic 6 (4):680-708.
    A 1-ary sentential context is aggregative (according to a consequence relation) if the result of putting the conjunction of two formulas into the context is a consequence (by that relation) of the results of putting first the one formula and then the other into that context. All 1-ary contexts are aggregative according to the consequence relation of classical propositional logic (though not, for example, according to the consequence relation of intuitionistic propositional logic), and here we explore the extent of this (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  16
    Multimodal Linguistic Inference.Michael Moortgat - 1995 - Logic Journal of the IGPL 3 (2-3):371-401.
    In this paper we compare grammatical inference in the context of simple and of mixed Lambek systems. Simple Lambek systems are obtained by taking the logic of residuation for a family of multiplicative connectives /, *, \, together with a package of structural postulates characterizing the resource management properties of the * connective. Different choices for Associativity and Commutativity yield the familiar logics NL, L, NLP, LP. Semantically, a simple Lambek system is a unimodal logic: the connectives get a Kripke (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  49.  29
    Degrees of Difficulty of Generalized R.E. Separating Classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.
    Important examples of $\Pi^0_1$ classes of functions $f \in {}^\omega\omega$ are the classes of sets (elements of ω 2) which separate a given pair of disjoint r.e. sets: ${\mathsf S}_2(A_0, A_1) := \{f \in{}^\omega2 : (\forall i < 2)(\forall x \in A_i)f(x) \neq i\}$ . A wider class consists of the classes of functions f ∈ ω k which in a generalized sense separate a k-tuple of r.e. sets (not necessarily pairwise disjoint) for each k ∈ ω: ${\mathsf S}_k(A_0,\ldots,A_k-1) := (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  49
    Natural Selection and Causal Productivity.Roberta L. Millstein - 2013 - In Hsiang-Ke Chao, Szu-Ting Chen & Roberta L. Millstein (eds.), Mechanism and Causality in Biology and Economics,. Springer.
    In the recent philosophical literature, two questions have arisen concerning the status of natural selection: (1) Is it a population-level phenomenon, or is it an organism-level phenomenon? (2) Is it a causal process, or is it a purely statistical summary of lower-level processes? In an earlier work (Millstein, Br J Philos Sci, 57(4):627–653, 2006), I argue that natural selection should be understood as a population-level causal process, rather than a purely statistical population-level summation of lower-level processes or as an organism-level (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 107