Results for 'pseudo-finite'

1000+ found
Order:
  1.  47
    On Pseudo-Finite Dimensions.Ehud Hrushovski - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):463-495.
    We attempt to formulate issues around modularity and Zilber’s trichotomy in a setting that intersects additive combinatorics. In particular, we update the open problems on quasi-finite structures from [9].
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  2.  59
    Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
    When analyzing database query languages a roperty, of theories, the pseudo-finite homogeneity property, has been introduced and applied (cf. [3]). We show that a stable theory has the pseudo-finite homogeneity property just in case its expressive power for finite states is bounded. Moreover, we introduce the corresponding pseudo-finite saturation property and show that a theory fails to have the finite cover property if and only if it has the pseudo-finite saturation (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  3.  11
    Pseudo-finite sets, pseudo-o-minimality.Nadav Meir - 2021 - Journal of Symbolic Logic 86 (2):577-599.
    We give an example of two ordered structures $\mathcal {M},\mathcal {N}$ in the same language $\mathcal {L}$ with the same universe, the same order and admitting the same one-variable definable subsets such that $\mathcal {M}$ is a model of the common theory of o-minimal $\mathcal {L}$ -structures and $\mathcal {N}$ admits a definable, closed, bounded, and discrete subset and a definable injective self-mapping of that subset which is not surjective. This answers negatively two question by Schoutens; the first being whether (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  5
    Pseudo-finite sets, pseudo-o-minimality—erratum.Nadav Meir - 2022 - Journal of Symbolic Logic 87 (1):436-436.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  3
    Pseudo‐c‐archimedean and pseudofinite cyclically ordered groups.Gérard Leloup - 2019 - Mathematical Logic Quarterly 65 (4):412-443.
    Robinson and Zakon gave necessary and sufficient conditions for an abelian ordered group to satisfy the same first‐order sentences as an archimedean abelian ordered group (i.e., which embeds in the group of real numbers). The present paper generalizes their work to obtain similar results for infinite subgroups of the group of unimodular complex numbers. Furthermore, the groups which satisfy the same first‐order sentences as ultraproducts of finite cyclic groups are characterized.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Elementary pairs of pseudo-finite fields: Counting completions.Helene Lejeune - 2000 - Journal of Symbolic Logic 65 (2):705-718.
  7.  33
    Uniformly defining valuation rings in Henselian valued fields with finite or pseudo-finite residue fields.Raf Cluckers, Jamshid Derakhshan, Eva Leenknegt & Angus Macintyre - 2013 - Annals of Pure and Applied Logic 164 (12):1236-1246.
    We give a definition, in the ring language, of Zp inside Qp and of Fp[[t]] inside Fp), which works uniformly for all p and all finite field extensions of these fields, and in many other Henselian valued fields as well. The formula can be taken existential-universal in the ring language, and in fact existential in a modification of the language of Macintyre. Furthermore, we show the negative result that in the language of rings there does not exist a uniform (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8.  25
    Model theory of finite fields and pseudo-finite fields.Zoé Chatzidakis - 1997 - Annals of Pure and Applied Logic 88 (2-3):95-108.
    We give a survey of results obtained in the model theory of finite and pseudo-finite fields.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  91
    Paires élémentaires de corps pseudo-Finis: Dénombrement Des complétions (elementary pairs of pseudo-finite fields: Counting completions).Hélène Lejeune - 2000 - Journal of Symbolic Logic 65 (2):705-718.
    Soit Π une théorie complète de corps pseudo-finis. L'objet de cet article est de montrer que, dans le langage des anneaux augmenté d'un symbole de prédicat unaire (pour le petit corps), la théorie des paires élémentaires non triviales de modèles de Π admet 2n0 complétions, soit le maximum envisageable. /// Let Π be a complete theorie of pseudo-finite fields. In this article we prove that, in the langage of fields to which we add a unary predicate for (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10. The elementary theory of free pseudo p-adically closed fields of finite corank.Ido Efrat - 1991 - Journal of Symbolic Logic 56 (2):484-496.
  11.  30
    The finite model property for semilinear substructural logics.San-Min Wang - 2013 - Mathematical Logic Quarterly 59 (4-5):268-273.
    In this paper, we show that the finite model property fails for certain non‐integral semilinear substructural logics including Metcalfe and Montagna's uninorm logic and involutive uninorm logic, and a suitable extension of Metcalfe, Olivetti and Gabbay's pseudo‐uninorm logic. Algebraically, the results show that certain classes of bounded residuated lattices that are generated as varieties by their linearly ordered members are not generated as varieties by their finite members.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  43
    States on pseudo MV-Algebras.Anatolij Dvurečenskij - 2001 - Studia Logica 68 (3):301-327.
    Pseudo MV-algebras are a non-commutative extension of MV-algebras introduced recently by Georgescu and Iorgulescu. We introduce states (finitely additive probability measures) on pseudo MV-algebras. We show that extremal states correspond to normal maximal ideals. We give an example in that, in contrast to classical MV-algebras introduced by Chang, states can fail on pseudo MV-algebras. We prove that representable and normal-valued pseudo MV-algebras admit at least one state.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  13.  14
    Pseudo-Superstructures as Nonstandard Universes.Mauro Di Nasso - 1998 - Journal of Symbolic Logic 63 (1):222 - 236.
    A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard universes are arranged in strata in the likeness of superstructures and allow a rank function taking linearly ordered values. Nonstandard universes are also constructed which model the whole ZFC theory without regularity and satisfy the κ-saturation property.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  17
    Pseudo-superstructures as nonstandard universes.Mauro Di Nasso - 1998 - Journal of Symbolic Logic 63 (1):222-236.
    A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard universes are arranged in strata in the likeness of superstructures and allow a rank function taking linearly ordered values. Nonstandard universes are also constructed which model the whole ZFC theory without regularity and satisfy the $\kappa$-saturation property.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  30
    Finite axiomatization for some intermediate logics.I. Janioka-Żuk - 1980 - Studia Logica 39 (4):415-423.
    LetN. be the set of all natural numbers, and letD n * = {k N k|n} {0} wherek¦n if and only ifn=k.x f or somexN. Then, an ordered setD n * = D n *, n, wherex ny iffx¦y for anyx, yD n *, can easily be seen to be a pseudo-boolean algebra.In [5], V.A. Jankov has proved that the class of algebras {D n * nB}, whereB =, {k N is finitely axiomatizable.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  20
    Cellularity of Pseudo-Tree Algebras.Jennifer Brown - 2006 - Notre Dame Journal of Formal Logic 47 (3):353-359.
    Recall that for any Boolean algebra (BA) A, the cellularity of A is c(A) = sup{|X| : X is a pairwise-disjoint subset of A}. A pseudo-tree is a partially ordered set (T, ≤) such that for every t in T, the set {r ∊ T : r ≤ t} is a linear order. The pseudo-tree algebra on T, denoted Treealg(T), is the subalgebra of ℘(T) generated by the cones {r ∊ T : r ≥ t}, for t in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  43
    Varieties of pseudo-interior algebras.Barbara Klunder - 2000 - Studia Logica 65 (1):113-136.
    The notion of a pseudo-interior algebra was introduced by Blok and Pigozzi in [BPIV]. We continue here our studies begun in [BK]. As a consequence of the representation theorem for pseudo-interior algebras given in [BK] we prove that the variety of all pseudo-interior algebras is generated by its finite members. This result together with Jónsson's Theorem for congruence distributive varieties provides a useful technique in the study of the lattice of varieties of pseudo-interior algebras.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  31
    Existentially closed fields with finite group actions.Daniel M. Hoffmann & Piotr Kowalski - 2018 - Journal of Mathematical Logic 18 (1):1850003.
    We study algebraic and model-theoretic properties of existentially closed fields with an action of a fixed finite group. Such fields turn out to be pseudo-algebraically closed in a rather strong sense. We place this work in a more general context of the model theory of fields with a group scheme action.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  41
    Borel reducibility and finitely Hölder (α) embeddability.Longyun Ding - 2011 - Annals of Pure and Applied Logic 162 (12):970-980.
    Let , be a sequence of pseudo-metric spaces, and let p≥1. For , let . For Borel reducibility between equivalence relations , we show it is closely related to finitely Hölder embeddability between pseudo-metric spaces.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20.  39
    For universals (but not finite-state learning) visit the zoo.Geoffrey K. Pullum & Barbara C. Scholz - 2009 - Behavioral and Brain Sciences 32 (5):466-467.
    Evans & Levinson's (E&L's) major point is that human languages are intriguingly diverse rather than (like animal communication systems) uniform within the species. This does not establish a about language universals, or advance the ill-framed pseudo-debate over universal grammar. The target article does, however, repeat a troublesome myth about Fitch and Hauser's (2004) work on pattern learning in cotton-top tamarins.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  13
    On the Origins of the Very First Principle as Infinite: The Hierarchy of the Infinite in Damascius and Pseudo-Dionysius the Areopagite.Tiziano F. Ottobrini - 2019 - Peitho 10 (1):133-152.
    This paper discusses the theoretical relationship between the views of Damascius and those of Pseudo-Dionysius the Areopagite. While Damascius’ De principiis is a bold treatise devoted to investigating the hypermetaphysics of apophatism, it anticipates various theoretical positions put forward by Dionysius the Areopagite. The present paper focuses on the following. First, Damascius is the only ancient philoso­pher who systematically demonstrates the first principle to be infinite. Second, Damascius modifies the concept and in several important passages shows the infinite to (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  22.  20
    Seperating the intrinsic complexity and the derivational complexity of the word problem for finitely presented groups.Daniel E. Cohen, Klaus Madlener & Friedrich Otto - 1993 - Mathematical Logic Quarterly 39 (1):143-157.
    A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is arbitrarily more (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  23.  20
    Cellularity and the Structure of Pseudo-Trees.Jennifer Brown - 2007 - Journal of Symbolic Logic 72 (4):1093 - 1107.
    Let T be an infinite pseudo-tree. In [2], we showed that the cellularity of the pseudo-tree algebra Treealg(T) was the maximum of four cardinals cT, lT, ϕT, and μT: roughly, cT is the "tallness" of T; lT is the "width" of T; ϕ is the number of "points of finite branching" in T; and μ is the number of "sections of no branching" in T. Here we ask: which inequalities among these four cardinals may be satisfied, in (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24. Pseudo-Archytas über die Kategorien.Pseudo-Archytas - 1972 - New York,: De Gruyter. Edited by Pseudo-Archytas & Thomas Alexander Szlezák.
  25.  32
    Strong completeness with respect to finite kripke models.Wiesław Dziobiak - 1981 - Studia Logica 40 (3):249-252.
    We prove that each intermediate or normal modal logic is strongly complete with respect to a class of finite Kripke frames iff it is tabular, i.e. the respective variety of pseudo-Boolean or modal algebras, corresponding to it, is generated by a finite algebra.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  26. Traktat kosmologiczny.Pseudo-Dionizy Areopagita - 2012 - Studia Philosophica Wratislaviensia:145-150.
    No categories
     
    Export citation  
     
    Bookmark  
  27. Homiliae VI, 1–16.Pseudo-Klemens - 2011 - Kronos - metafizyka, kultura, religia 4 (19).
    No categories
     
    Export citation  
     
    Bookmark  
  28. O sposobie rządzenia Ateńczyków.Pseudo-Ksenofont - 2007 - Studia Philosophica Wratislaviensia:139-140.
    No categories
     
    Export citation  
     
    Bookmark  
  29. Pseudo-Johannis Philoponi Expositiones in omnes XIV Aristotelis Libros metaphysicos.Pseudo-Johannes Philoponus - 1583 - Stuttgart-Bad Cannstatt: Frommann-Holzboog. Edited by Francesco Patrizi & Charles H. Lohr.
     
    Export citation  
     
    Bookmark  
  30. Mélanges.L. E. Pseudo-Ignace - 1900 - Revue D’Histoire Ecclésiastique 1:61.
    No categories
     
    Export citation  
     
    Bookmark  
  31.  6
    Definicijos.Pseudo - Platonas - 2016 - Problemos 89:172.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  18
    Motives for perfect PAC fields with pro-cyclic Galois group.Immanuel Halupczok - 2008 - Journal of Symbolic Logic 73 (3):1036-1050.
    Denef and Loeser defined a map from the Grothendieck ring of sets definable in pseudo-finite fields to the Grothendieck ring of Chow motives, thus enabling to apply any cohomological invariant to these sets. We generalize this to perfect, pseudo algebraically closed fields with pro-cyclic Galois group. In addition, we define some maps between different Grothendieck rings of definable sets which provide additional information, not contained in the associated motive. In particular we infer that the map of Denef-Loeser (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  33. A New Modal Lindstrom Theorem.Finite Depth Property - 2006 - In Henrik Lagerlund, Sten Lindström & Rysiek Sliwinski (eds.), Modality Matters: Twenty-Five Essays in Honour of Krister Segerberg. Uppsala Philosophical Studies 53. pp. 55.
     
    Export citation  
     
    Bookmark  
  34. An algorithm for axiomatizing and theorem proving in finite many-valued propositional logics* Walter A. Carnielli.Proving in Finite Many-Valued Propositional - forthcoming - Logique Et Analyse.
     
    Export citation  
     
    Bookmark  
  35. Vizantijska filozofija u srednjevekovnoj Srbiji.Boris Milosavljeviâc, Pseudo-Dionysius, John & Gregory Palamas (eds.) - 2002 - Beograd: "Stubovi kulture".
    No categories
     
    Export citation  
     
    Bookmark  
  36. Religia z postanowienia i z przekonania.Pseudo-Hołówka - 2010 - Przeglad Filozoficzny - Nowa Seria 76.
    No categories
     
    Export citation  
     
    Bookmark  
  37. Discursos a la academia de Dijon.Jean-Jacques Rousseau, A. Pintor-Ramos, John Locke, L. González Puertas, Cirilo Flórez Miguel & Pseudo-aristóteles - 1980 - Revista Portuguesa de Filosofia 36 (2):217-218.
    No categories
     
    Export citation  
     
    Bookmark  
  38.  80
    M-Zeroids: Structure and Categorical Equivalence.Joshua B. Palmatier & Fernando Guzman - 2012 - Studia Logica 100 (5):975-1000.
    In this note we develop a method for constructing finite totally-ordered m-zeroids and prove that there exists a categorical equivalence between the category of finite, totally-ordered m-zeroids and the category of pseudo Łukasiewicz-like implicators.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  39.  27
    Extended order-generic queries.Oleg V. Belegradek, Alexei P. Stolboushkin & Michael A. Taitslin - 1999 - Annals of Pure and Applied Logic 97 (1-3):85-125.
    We consider relational databases organized over an ordered domain with some additional relations — a typical example is the ordered domain of rational numbers together with the operation of addition. In the focus of our study are the first-order queries that are invariant under order-preserving “permutations” — such queries are called order-generic. It has recently been discovered that for some domains order-generic FO queries fail to express more than pure order queries. For example, every order-generic FO query over rational numbers (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  40.  20
    A general condition for collapse results.Michael A. Taitslin - 2001 - Annals of Pure and Applied Logic 113 (1-3):323-330.
    In Belegradek et al. 85) the collapse result theorem was proved for locally generic queries over ordered domain with pseudo-finite homogeneity property. In a very interesting paper of Baldwin and Benedikt the collapse result theorem was proved for locally generic queries over ordered domains without the independence property. It means that over such a domain, order-generic extended queries fail to express more than restricted queries. It was observed by Baldwin and Benedikt that any theory without the independence property (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  41.  41
    A saturation property of structures obtained by forcing with a compact family of random variables.Jan Krajíček - 2013 - Archive for Mathematical Logic 52 (1-2):19-28.
    A method for constructing Boolean-valued models of some fragments of arithmetic was developed in Krajíček (Forcing with Random Variables and Proof Complexity, London Mathematical Society Lecture Notes Series, Cambridge University Press, Cambridge, 2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random variables defined on a pseudo-finite sample space. We show that under a fairly natural condition on the family [called compactness in Krajíček (Forcing with Random Variables (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  42.  27
    Coding Complete Theories in Galois Groups.James Gray - 2008 - Journal of Symbolic Logic 73 (2):474 - 491.
    In this paper, I will give a new characterisation of the spaces of complete theories of pseudofinite fields and of algebraically closed fields with a generic automorphism (ACFA) in terms of the Vietoris topology on absolute Galois groups of prime fields.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  43.  11
    Co-theory of sorted profinite groups for PAC structures.Daniel Max Hoffmann & Junguk Lee - 2023 - Journal of Mathematical Logic 23 (3).
    We achieve several results. First, we develop a variant of the theory of absolute Galois groups in the context of many sorted structures. Second, we provide a method for coding absolute Galois groups of structures, so they can be interpreted in some monster model with an additional predicate. Third, we prove the “Weak Independence Theorem” for pseudo-algebraically closed (PAC) substructures of an ambient structure with no finite cover property (nfcp) and the property [Formula: see text]. Fourth, we describe (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  44. Hilbert Mathematics versus Gödel Mathematics. III. Hilbert Mathematics by Itself, and Gödel Mathematics versus the Physical World within It: both as Its Particular Cases.Vasil Penchev - 2023 - Philosophy of Science eJournal (Elsevier: SSRN) 16 (47):1-46.
    The paper discusses Hilbert mathematics, a kind of Pythagorean mathematics, to which the physical world is a particular case. The parameter of the “distance between finiteness and infinity” is crucial. Any nonzero finite value of it features the particular case in the frameworks of Hilbert mathematics where the physical world appears “ex nihilo” by virtue of an only mathematical necessity or quantum information conservation physically. One does not need the mythical Big Bang which serves to concentrate all the violations (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  11
    Tameness of definably complete locally o‐minimal structures and definable bounded multiplication.Masato Fujita, Tomohiro Kawakami & Wataru Komine - 2022 - Mathematical Logic Quarterly 68 (4):496-515.
    We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o‐minimal structure. This fact together with the results in a previous paper implies a tame dimension theory and a decomposition theorem into good‐shaped definable subsets called quasi‐special submanifolds. Using this fact, we investigate definably complete locally o‐minimal expansions of ordered groups when the restriction of multiplication to an arbitrary bounded open box is definable. Similarly to o‐minimal expansions of ordered (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  46.  6
    Generic automorphisms with prescribed fixed fields.Bijan Afshordel - 2014 - Journal of Symbolic Logic 79 (4):985-1000.
    This article addresses the question which structures occur as fixed structures of stable structures with a generic automorphism. In particular we give a Galois theoretic characterization. Furthermore, we prove that any pseudofinite field is the fixed field of some model ofACFA, any one-free pseudo-differentially closed field of characteristic zero is the fixed field of some model ofDCFA, and that any one-free PAC field of finite degree of imperfection is the fixed field of some model ofSCFA.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  86
    Transitions to a modern cosmology: Meister Eckhart and Nicholas of cusa on the intensive infinite.Elizabeth Brient - 1999 - Journal of the History of Philosophy 37 (4):575-600.
    In lieu of an abstract, here is a brief excerpt of the content:Transitions to a Modern Cosmology: Meister Eckhart and Nicholas of Cusa on the Intensive InfiniteElizabeth BrientThe Epochal Transition from the late medieval to the early modern world has long been thought in terms of the gradual “infinitization” of the cosmos. Traditionally this process has been studied by focusing on the pre-history and the aftermath of the Copernican revolution, that is, by describing the transition from the finite, hierarchically (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  48. The Kochen - Specker theorem in quantum mechanics: a philosophical comment (part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine – (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  50.  7
    Structural Instability and Emergence of the Biodiversity.E. Sanchez-Palencia & J. -P. Françoise - 2013 - Acta Biotheoretica 61 (3):397-412.
    In the framework of population dynamics, we start from the logistic equation describing the evolution of one species with limited food supply. A split device allows us to consider the population as two sub-populations x and y evolving analogously. The dynamical system has a one-parameter family of equilibria which is structurally unstable. Then small perturbations of the system (describing functional or ethological differentiations between the sub-species) lead in general to a new system involving a fast and a slow dynamics with (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000