Results for 'Well quasi order'

1000+ found
Order:
  1.  12
    Well quasi orders in a categorical setting.Marco Benini & Roberta Bonacina - 2019 - Archive for Mathematical Logic 58 (3-4):501-526.
    This article describes well quasi orders as a category, focusing on limits and colimits. In particular, while quasi orders with monotone maps form a category which is finitely complete, finitely cocomplete, and with exponentiation, the full subcategory of well quasi orders is finitely complete and cocomplete, but with no exponentiation. It is interesting to notice how finite antichains and finite proper descending chains interact to induce this structure in the category: in fact, the full subcategory (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  11
    Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory.Peter M. Schuster, Monika Seisenberger & Andreas Weiermann (eds.) - 2020 - Cham, Switzerland: Springer Verlag.
    This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  23
    Reverse mathematics, well-quasi-orders, and Noetherian spaces.Emanuele Frittaion, Matthew Hendtlass, Alberto Marcone, Paul Shafer & Jeroen Van der Meeren - 2016 - Archive for Mathematical Logic 55 (3):431-459.
    A quasi-order Q induces two natural quasi-orders on $${\mathcal{P}(Q)}$$, but if Q is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Goubault-Larrecq (Proceedings of the 22nd Annual IEEE Symposium 4 on Logic in Computer Science (LICS’07), pp. 453–462, 2007) showed that moving from a well-quasi-order Q to the quasi-orders on $${\mathcal{P}(Q)}$$ preserves well-quasi-orderedness in a topological sense. Specifically, Goubault-Larrecq proved that the upper (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Definability in well quasi-ordered sets of structures.Charles K. Landraitis - 1977 - Journal of Symbolic Logic 42 (2):289-291.
  5.  11
    The wadge order on the Scott domain is not a well-quasi-order.Jacques Duparc & Louis Vuilleumier - 2020 - Journal of Symbolic Logic 85 (1):300-324.
    We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets$\mathbb{P}_{emb} $equipped with the order induced by homomorphisms is embedded into the Wadge order on the$\Delta _2^0 $-degrees of the Scott domain. We then show that$\mathbb{P}_{emb} $admits both infinite strictly decreasing chains and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Canonical simplification of finite objects, well quasi-ordered by tree embedding.Thomas C. Brown - 1979 - Urbana, Ill.: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
     
    Export citation  
     
    Bookmark  
  7.  9
    Exact unprovability results for compound well-quasi-ordered combinatorial classes.Andrey Bovykin - 2009 - Annals of Pure and Applied Logic 157 (2-3):77-84.
    In this paper we prove general exact unprovability results that show how a threshold between provability and unprovability of a finite well-quasi-orderedness assertion of a combinatorial class is transformed by the sequence-construction, multiset-construction, cycle-construction and labeled-tree-construction. Provability proofs use the asymptotic pigeonhole principle, unprovability proofs use Weiermann-style compression techniques and results from analytic combinatorics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  51
    Well (and better) quasi-ordered transition systems.Parosh Aziz Abdulla - 2010 - Bulletin of Symbolic Logic 16 (4):457-515.
    In this paper, we give a step by step introduction to the theory of well quasi-ordered transition systems. The framework combines two concepts, namely (i) transition systems which are monotonic wrt. a well-quasi ordering ; and (ii) a scheme for symbolic backward reachability analysis. We describe several models with infinite-state spaces, which can be analyzed within the framework, e.g., Petri nets, lossy channel systems, timed automata, timed Petri nets, and multiset rewriting systems. We will also present (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  9.  14
    A quasi-order on continuous functions.Raphaël Carroy - 2013 - Journal of Symbolic Logic 78 (2):633-648.
    We define a quasi-order on Borel functions from a zero-dimensional Polish space into another that both refines the order induced by the Baire hierarchy of functions and generalises the embeddability order on Borel sets. We study the properties of this quasi-order on continuous functions, and we prove that the closed subsets of a zero-dimensional Polish space are well-quasi-ordered by bi-continuous embeddability.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  46
    On the quasi-ordering of borel linear orders under embeddability.Alain Louveau & Jean Saint-Raymond - 1990 - Journal of Symbolic Logic 55 (2):537-560.
    We provide partial answers to the following problem: Is the class of Borel linear orders well-quasi-ordered under embeddability? We show that it is indeed the case for those Borel orders which are embeddable in R ω , with the lexicographic ordering. For Borel orders embeddable in R 2 , our proof works in ZFC, but it uses projective determinacy for Borel orders embeddable in some $\mathbf{R}^n, n , and hyperprojective determinacy for the general case.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  33
    Reverse mathematics and the equivalence of definitions for well and better quasi-orders.Peter Cholak, Alberto Marcone & Reed Solomon - 2004 - Journal of Symbolic Logic 69 (3):683-712.
  12.  9
    The discovery of the future.H. G. Wells - 1913 - New York: B.W. Huebsch.
    Excerpt: IT will lead into my subject most conveniently to contrast and separate two divergent types of mind, types which are to be distinguished chiefly by their attitude toward time, and more particularly by the relative importance they attach and the relative amount of thought they give to the future. The first of these two types of mind, and it is, I think, the predominant type, the type of the majority of living people, is that which seems scarcely to think (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  13.  36
    Beyond the hypothesis: Theory's role in the genesis, opposition, and pursuit of the Higgs boson.James D. Wells - 2018 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 62 (C):36-44.
    The centrally recognized theoretical achievement that enabled the Higgs boson discovery in 2012 was the hypothesis of its existence, made by Peter Higgs in 1964. Nevertheless, there is a significant body of comparably important theoretical work prior to and after the Higgs boson hypothesis. In this article we present an additional perspective of how crucial theory work was to the genesis of the Higgs boson hypothesis, especially emphasizing its roots in Landau's theory of phase transitions and subsequent theoretical work on (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  12
    Improvisation: the drama of Christian ethics.Samuel Wells - 2018 - Grand Rapids, Michigan: Baker Academic. Edited by Wesley Vander Lugt & Benjamin D. Wayman.
    In Improvisation, Samuel Wells defines improvisation in the theater as "a practice through which actors seek to develop trust in themselves and one another in order that they may conduct unscripted dramas without fear." Sounds a lot like life, doesn't it? Building trust, overcoming fear, conducting relationships, and making choices--all without a script. Wells establishes theatrical improvisation as a model for Christian ethics, a matter of "faithfully improvising on the Christian tradition." He views the Bible not as a "script" (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. The Priority of Natural Laws in Kant’s Early Philosophy.Aaron Wells - 2021 - Res Philosophica 98 (3):469-497.
    It is widely held that, in his pre-Critical works, Kant endorsed a necessitation account of laws of nature, where laws are grounded in essences or causal powers. Against this, I argue that the early Kant endorsed the priority of laws in explaining and unifying the natural world, as well as their irreducible role in in grounding natural necessity. Laws are a key constituent of Kant’s explanatory naturalism, rather than undermining it. By laying out neglected distinctions Kant draws among types (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  5
    Fact and Responsibility – Approaches towards the Factual in Contemporary Art.Rachel Wells - 2015 - Zeitschrift für Ästhetik Und Allgemeine Kunstwissenschaft 60 (1):39-53.
    Rachel Wells turns to the examination of three recent artistic practices, which integrate facts in their work not as an antagonistic other but as a constitutive element to their efficacy and ethics. She argues, that in introducing news, factual actions, or objects with traces of factual events, Alfredo Jaar, Jeremy Deller and Martin Creed use facts in order to retract from the position of art as an expression of artistic freedom and subjectivity and thus as the opposite of fact. (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  30
    God's companions: reimagining Christian ethics.Samuel Wells - 2006 - Oxford: Blackwell.
    We are pleased to annouce that God’s Companions by Samuel Wells has been shortlisted for the 2007 Michael Ramsey Prize for theological writing. www.michaelramseyprize.org.uk Grounded in Samuel Wells’ experience of ordinary lives in poorer neighborhoods, this book presents a striking and imaginative approach to Christian ethics. It argues that Christian ethics is founded on God, on the practices of human community, and on worship, and that ethics is fundamentally a reflection of God's abundance. Wells synthesizes dogmatic, liturgical, ethical, scriptural, and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  2
    God the invisible king.H. G. Wells - 1917 - [n. p.]: Createspace Independent Publishing Platform.
    This book covers the author's conception of God aside from any religion. He does not come from a religious view in order to transmit the truest conception of God that he is capable of because any religion, whatever it might be, always claims God for itself in an exclusionary fashion. In other words, you must be a follower of the chosen faith before God will accept you into his kingdom. Wells rejects this view. Any man or woman who accepts (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  16
    When is writing already quotation? A developmental perspective on a postmodern question.Rebecca Wells-Jopling - 2006 - Journal of Aesthetic Education 40 (3):59-74.
    In lieu of an abstract, here is a brief excerpt of the content:When Is Writing Already Quotation?A Developmental Perspective on a Postmodern QuestionRebecca Wells-Jopling (bio)IntroductionPostmodern literary-critical thinking introduced into many disciplines in the 1950s and 1960s the quite peculiar, yet intellectually engaging, idea that what is written is always already-quoted. This idea is a logical derivation from the concurrent idea that writing is "prior to history"1 ; thus, what was written and what is written were simply always there, and someone (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  20.  86
    Christian ethics: an introductory reader.Samuel Wells (ed.) - 2010 - Malden, Mass.: Wiley-Blackwell.
    The story of God -- The story of the church -- The story of ethics -- The story of Christian ethics -- Universal ethics -- Subversive ethics -- Ecclesial ethics -- Good order -- Good life -- Good relationships -- Good beginnings and endings -- Good earth.
    Direct download  
     
    Export citation  
     
    Bookmark  
  21.  37
    Nightmarish Romanticism: The Third Reich and the Appropriation of Romanticism.Bronte Wells - 2018 - Constellations 9 (1):1-10.
    Attempting to trace the intellectual history of any political movement is, at best,problematic. Humans construct political movements and the intellectual, philosophical underpinnings of those movements, and, in general, it is not one person who is doing the creating, but rather a multitude of people are involved; the circumstance of how politics is created is a web, which makes it difficult for researchers to trace the historical roots of movements. Nazi Germany has been the focus of numerous research projects to understand (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  97
    The maximal linear extension theorem in second order arithmetic.Alberto Marcone & Richard A. Shore - 2011 - Archive for Mathematical Logic 50 (5-6):543-564.
    We show that the maximal linear extension theorem for well partial orders is equivalent over RCA0 to ATR0. Analogously, the maximal chain theorem for well partial orders is equivalent to ATR0 over RCA0.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  23.  19
    An Analysis of Knowledge and Valuation. [REVIEW]Rulon S. Wells - 1949 - Review of Metaphysics 2 (7):99-115.
    The expectation is fulfilled, but in an unexpected way. 'The first studies toward this book were addressed to topics in the field of ethics' ; but our author, like Wagner composing 'Der Ring des Nibelungen', found himself becoming preoccupied with prolegomena. To these the present volume is wholly devoted. In order to establish its fundamental thesis that valuation is a form of empirical knowledge, two preparatory discussions are called for. An analysis of empirical knowledge in general is one of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  12
    Finding descending sequences through ill-founded linear orders.Jun le Goh, Arno Pauly & Manlio Valenti - 2021 - Journal of Symbolic Logic 86 (2):817-854.
    In this work we investigate the Weihrauch degree of the problem Decreasing Sequence of finding an infinite descending sequence through a given ill-founded linear order, which is shared by the problem Bad Sequence of finding a bad sequence through a given non-well quasi-order. We show that $\mathsf {DS}$, despite being hard to solve, is rather weak in terms of uniform computational strength. To make the latter precise, we introduce the notion of the deterministic part of a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  12
    The Phenomenon of Quasi-states.Rywkin Michael - 2006 - Diogenes 53 (2):23-28.
    The demise of the two federal communist states, the Soviet Union and Yugoslavia, was the major cause of the appearance of a new kind of state entity, unheard of since the end of feudalism in Europe. While the 15 Union Republics of the Soviet Union became independent from the old center (Moscow) as well as detached from each other, some ethnically different or mixed parts of the newly independent republics, deprived of federal protection, felt uncomfortable within the new framework (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  25
    Worms, gaps, and hydras.Lorenzo Carlucci - 2005 - Mathematical Logic Quarterly 51 (4):342-350.
    We define a direct translation from finite rooted trees to finite natural functions which shows that the Worm Principle introduced by Lev Beklemishev is equivalent to a very slight variant of the well-known Kirby-Paris' Hydra Game. We further show that the elements in a reduction sequence of the Worm Principle determine a bad sequence in the well-quasi-ordering of finite sequences of natural numbers with respect to Friedman's gapembeddability. A characterization of gap-embeddability in terms of provability logic due (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27. Approximating the limit: the interaction between quasi 'almost' and some temporal connectives in Italian.Amaral Patrícia & Del Prete Fabio - 2010 - Linguistics and Philosophy 33 (2):51 - 115.
    This paper focuses on the interpretation of the Italian approximative adverb quasi 'almost' by primarily looking at cases in which it modifies temporal connectives, a domain which, to our knowledge, has been largely unexplored thus far. Consideration of this domain supports the need for a scalar account of the semantics of quasi (close in spirit to Hitzeman's semantic analysis of almost, in: Canakis et al. (eds) Papers from the 28th regional meeting of the Chicago Linguistic Society, 1992). When (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  28.  55
    Weakly higher order cylindric algebras and finite axiomatization of the representables.I. Németi & A. Simon - 2009 - Studia Logica 91 (1):53 - 62.
    We show that the variety of n -dimensional weakly higher order cylindric algebras, introduced in Németi [9], [8], is finitely axiomatizable when n > 2. Our result implies that in certain non-well-founded set theories the finitization problem of algebraic logic admits a positive solution; and it shows that this variety is a good candidate for being the cylindric algebra theoretic counterpart of Tarski’s quasi-projective relation algebras.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  29.  6
    Regulation of Emotions to Optimize Classical Music Performance: A Quasi-Experimental Study of a Cellist-Researcher.Guadalupe López-Íñiguez & Gary E. McPherson - 2021 - Frontiers in Psychology 12.
    The situational context within which an activity takes place, as well as the personality characteristics of individuals shape the types of strategies people choose in order to regulate their emotions, especially when confronted with challenging or undesirable situations. Taking self-regulation as the framework to study emotions in relation to learning and performing chamber music canon repertoire, this quasi-experimental and intra-individual study focused on the self-rated emotional states of a professional classical cellist during long-term sustained practice across 100-weeks. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  75
    Elementary embedding between countable Boolean algebras.Robert Bonnet & Matatyahu Rubin - 1991 - Journal of Symbolic Logic 56 (4):1212-1229.
    For a complete theory of Boolean algebras T, let MT denote the class of countable models of T. For B1, B2 ∈ MT, let B1 ≤ B2 mean that B1 is elementarily embeddable in B2. Theorem 1. For every complete theory of Boolean algebras T, if T ≠ Tω, then $\langle M_T, \leq\rangle$ is well-quasi-ordered. ■ We define Tω. For a Boolean algebra B, let I(B) be the ideal of all elements of the form a + s such (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  31.  11
    Towards An Acronym for Organisational Ethics: Using a Quasi-person Model to Locate Responsible Agents in Collective Groups.David Ardagh - 2017 - Philosophy of Management 16 (2):137-160.
    Organisational Ethics could be more effectively taught if organisational agency could be better distinguished from activity in other group entities, and defended against criticisms. Some criticisms come from the side of what is called “methodological individualism”. These critics argue that, strictly speaking, only individuals really exist and act, and organisations are not individuals, real things, or agents. Other criticisms come from fear of the possible use of alleged “corporate personhood” to argue for a possible radical expansion of corporate rights e.g. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  36
    Computing maximal chains.Alberto Marcone, Antonio Montalbán & Richard A. Shore - 2012 - Archive for Mathematical Logic 51 (5-6):651-660.
    In (Fund Math 60:175–186 1967), Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even hyperarithmetically: No hyperarithmetic set can compute maximal chains in all computable wpos. However, we prove that almost every set, in the sense of category, can compute maximal chains in all computable (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  33.  8
    Return-To-Play Decision Making in Team Sports Athletes. A Quasi-Naturalistic Scenario Study.Jochen Mayer, Stephanie Burgess & Ansgar Thiel - 2020 - Frontiers in Psychology 11:521968.
    Competitive athletes act within cultures of risk in sports and often decide to return to sport despite having acute health problems. The outcomes of such risky return-to-play decisions can not only negatively affect their future health, but also limit their sports performance or even upset their career paths. Following risk-management-decision theory with its focus on active risk defusing, we developed a model for understanding the process of return-to-play decision making from an athlete’s perspective. Based on the method of active information (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  34. Quasi-orderings and population ethics.Charles Blackorby, Walter Bossert & David Donaldson - 1996 - Social Choice and Welfare 13 (2):129--150.
    Population ethics contains several principles that avoid the repugnant conclusion. These rules rank all possible alternatives, leaving no room for moral ambiguity. Building on a suggestion of Parfit, this paper characterizes principles that provide incomplete but ethically attractive rankings of alternatives with different population sizes. All of them rank same-number alternatives with generalized utilitarianism.
     
    Export citation  
     
    Bookmark   10 citations  
  35.  20
    Borel quasi-orderings in subsystems of second-order arithmetic.Alberto Marcone - 1991 - Annals of Pure and Applied Logic 54 (3):265-291.
    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 (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  36.  21
    On poset Boolean algebras of scattered posets with finite width.Robert Bonnet & Matatyahu Rubin - 2004 - Archive for Mathematical Logic 43 (4):467-476.
    We prove that the poset algebra of every scattered poset with finite width is embeddable in the poset algebra of a well ordered poset.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  89
    A completeness theorem for higher order logics.Gábor Sági - 2000 - Journal of Symbolic Logic 65 (2):857-884.
    Here we investigate the classes RCA $^\uparrow_\alpha$ of representable directed cylindric algebras of dimension α introduced by Nemeti[12]. RCA $^\uparrow_\alpha$ can be seen in two different ways: first, as an algebraic counterpart of higher order logics and second, as a cylindric algebraic analogue of Quasi-Projective Relation Algebras. We will give a new, "purely cylindric algebraic" proof for the following theorems of Nemeti: (i) RCA $^\uparrow_\alpha$ is a finitely axiomatizable variety whenever α ≥ 3 is finite and (ii) one (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  38.  27
    The Set of Better Quasi Orderings is ∏21.Alberto Marcone - 1995 - Mathematical Logic Quarterly 41 (3):373-383.
    In this paper we give a proof of the II12-completeness of the set of countable better quasi orderings . This result was conjectured by Clote in [2] and proved by the author in his Ph.d. thesis [6] . Here we prove it using Simpson's definition of better quasi ordering and as little bqo theory as possible.
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  44
    Mixture of Maximal Quasi Orders: a new Approach to Preference Modelling.Jacinto González-Pachón & Sixto Ríos-Insua - 1999 - Theory and Decision 47 (1):73-88.
    Normative theories suggest that inconsistencies be pointed out to the Decision Maker who is thus given the chance to modify his/her judgments. In this paper, we suggest that the inconsistencies problem be transferred from the Decision Maker to the Analyst. With the Mixture of Maximal Quasi Orders, rather than pointing out incoherences for the Decision Maker to change, these inconsistencies may be used as new source of information to model his/her preferences.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40.  20
    Well-partial-orderings and the big Veblen number.Jeroen Van der Meeren, Michael Rathjen & Andreas Weiermann - 2015 - Archive for Mathematical Logic 54 (1-2):193-230.
    In this article we characterize a countable ordinal known as the big Veblen number in terms of natural well-partially ordered tree-like structures. To this end, we consider generalized trees where the immediate subtrees are grouped in pairs with address-like objects. Motivated by natural ordering properties, extracted from the standard notations for the big Veblen number, we investigate different choices for embeddability relations on the generalized trees. We observe that for addresses using one finite sequence only, the embeddability coincides with (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  41.  10
    Universal countable borel quasi-orders.Jay Williams - 2014 - Journal of Symbolic Logic 79 (3):928-954.
  42.  29
    Continuously Representable Paretian Quasi-Orders.Vicki Knoblauch - 2006 - Theory and Decision 60 (1):1-16.
    Two forms of continuity are defined for Pareto representations of preferences. They are designated “continuity” and “coordinate continuity.” Characterizations are given of those Pareto representable preferences that are continuously representable and, in dimension two, of those that are coordinate-continuously representable.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43. The set of better quasi orderings is ii1/2-complete (vol 41, pg 373, 1995).A. Marcone - 1995 - Mathematical Logic Quarterly 41 (4):574-574.
     
    Export citation  
     
    Bookmark  
  44.  6
    Quasi-decisiveness, quasi-ultrafilter, and social quasi-orderings.Susumu Cato - 2013 - Social Choice and Welfare 41:169–202.
    The aim of the present paper is to provide an axiomatic analysis of incomplete social judgments. In particular, we clarify the underlying power structure of Arrovian collective choice rules when social preferences are allowed to be incomplete. We propose the concept of quasi-decisiveness and investigate the properties of the collection of quasi-decisive sets associated with an Arrovian collective choice rule. In the course of this, we offer a series of applications.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  45.  38
    A finite model theorem for the propositional μ-calculus.Dexter Kozen - 1988 - Studia Logica 47 (3):233 - 241.
    We prove a finite model theorem and infinitary completeness result for the propositional -calculus. The construction establishes a link between finite model theorems for propositional program logics and the theory of well-quasi-orders.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  46.  24
    Phase transitions for Gödel incompleteness.Andreas Weiermann - 2009 - Annals of Pure and Applied Logic 157 (2-3):281-296.
    Gödel’s first incompleteness result from 1931 states that there are true assertions about the natural numbers which do not follow from the Peano axioms. Since 1931 many researchers have been looking for natural examples of such assertions and breakthroughs were obtained in the seventies by Jeff Paris [Some independence results for Peano arithmetic. J. Symbolic Logic 43 725–731] , Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977] and Laurie Kirby [L. Kirby, Jeff Paris, Accessible independence results for Peano Arithmetic, Bull. of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  47.  10
    Constructing sequences one step at a time.Henry Towsner - 2020 - Journal of Mathematical Logic 20 (3):2050017.
    We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain–Antichain (CAC) Principle. Using this method, we are able to prove several new separations in the presence of Weak König’s Lemma (WKL), including showing that CAC+WKL does not imply the thin set theorem for pairs, and that the principle “the product of well-quasi-orders is a well-quasi-order” is strictly between CAC and the Ascending/Descending Sequences principle, even in the presence of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  6
    On the existence of large antichains for definable quasi-orders.Benjamin D. Miller & Zoltán Vidnyánszky - 2020 - Journal of Symbolic Logic 85 (1):103-108.
    We simultaneously generalize Silver’s perfect set theorem for co-analytic equivalence relations and Harrington-Marker-Shelah’s Dilworth-style perfect set theorem for Borel quasi-orders, establish the analogous theorem at the next definable cardinal, and give further generalizations under weaker definability conditions.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  13
    Generalizing Kruskal’s theorem to pairs of cohabitating trees.Timothy Carlson - 2016 - Archive for Mathematical Logic 55 (1-2):37-48.
    We investigate the extent to which structures consisting of sequences of forests on the same underlying set are well-quasi-ordered under embeddings.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  50.  18
    Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
    We introduce the appropriate iterated version of the system of ordinal notations from [G1] whose order type is the familiar Howard ordinal. As in [G1], our ordinal notations are partly inspired by the ideas from [P] where certain crucial properties of the traditional Munich' ordinal notations are isolated and used in the cut-elimination proofs. As compared to the corresponding “impredicative” Munich' ordinal notations (see e.g. [B1, B2, J, Sch1, Sch2, BSch]), our ordinal notations arearbitrary terms in the appropriate simple (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 1000