Results for 'complete Π11 sets'

1000+ found
Order:
  1.  6
    Π11‐Martin‐Löf randomness and Π11‐Solovay completeness.Claude Sureson - 2019 - Mathematical Logic Quarterly 65 (3):265-279.
    Developing an analogue of Solovay reducibility in the higher recursion setting, we show that results from the classical computably enumerable case can be extended to the new context.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  28
    B. Balcar and F. Franek. Independent families in complete Boolean algebras_. _Transactions of the American Mathematical Society_, vol. 274 (1982), pp. 607–618. - Bohuslav Balcar, Jan Pelant, and Petr Simon. _The space of ultrafilters on N covered by nowhere dense sets_. Fundamenta mathematicae, vol. 110 (1980), pp. 11–24. - Boban Velickovic. _OCA and automorphisms of P(ω)/fin. Topology and its applications, vol. 49 (1993), pp. 1–13.Klaas Pieter Hart, B. Balcar, F. Franek, Bohuslav Balcar, Jan Pelant, Petr Simon & Boban Velickovic - 2002 - Bulletin of Symbolic Logic 8 (4):554.
  3.  19
    Gerald E. Sacks. A maximal set which is not complete. Michigan mathematical journal, vol. 11 , pp. 193–205.K. Appel - 1968 - Journal of Symbolic Logic 32 (4):528.
  4.  18
    B. Balcar and F. Franek. Independent families in complete Boolean algebras_. _Transactions of the American Mathematical Society_, vol. 274 (1982), pp. 607–618. - Bohuslav Balcar, Jan Pelant, and Petr Simon. _The space of ultrafilters on N covered by nowhere dense sets_. Fundamenta mathematicae, vol. 110 (1980), pp. 11–24. - Boban Velickovic. _OCA and automorphisms of P(ω)/fin. Topology and its applications, vol. 49 (1993), pp. 1–13. [REVIEW]Klaas Pieter Hart - 2002 - Bulletin of Symbolic Logic 8 (4):554-554.
  5.  23
    Omitting types in logic of metric structures.Ilijas Farah & Menachem Magidor - 2018 - Journal of Mathematical Logic 18 (2):1850006.
    This paper is about omitting types in logic of metric structures introduced by Ben Yaacov, Berenstein, Henson and Usvyatsov. While a complete type is omissible in some model of a countable complete...
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Post Completeness in Congruential Modal Logics.Peter Fritz - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. College Publications. pp. 288-301.
    Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truth-functional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  91
    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 can obtain (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8.  18
    How complicated is the set of stable models of a recursive logic program?W. Marek, A. Nerode & J. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):119-135.
    Gelfond and Lifschitz proposed the notion of a stable model of a logic program. We establish that the set of all stable models in a Herbrand universe of a recursive logic program is, up to recursive renaming, the set of all infinite paths of a recursive, countably branching tree, and conversely. As a consequence, the problem, given a recursive logic program, of determining whether it has at least one stable model, is Σ11-complete. Due to the equivalences established in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  20
    A note on the first‐order logic of complete BL‐chains.Petr Hájek & Franco Montagna - 2008 - Mathematical Logic Quarterly 54 (4):435-446.
    In [10] it is claimed that the set of predicate tautologies of all complete BL-chains and the set of all standard tautologies coincide. As noticed in [11], this claim is wrong. In this paper we show that a complete BL-chain B satisfies all standard BL-tautologies iff for any transfinite sequence of elements of B, the condition ∧i ∈ I = 2 holds in B.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  12
    Development of a core outcome set for informed consent for therapy: An international key stakeholder consensus study.Liam J. Convie, Joshua M. Clements, Scott McCain, Jeffrey Campbell, Stephen J. Kirk & Mike Clarke - 2022 - BMC Medical Ethics 23 (1):1-15.
    Background 300 million operations and procedures are performed annually across the world, all of which require a patient’s informed consent. No standardised measure of the consent process exists in current clinical practice. We aimed to define a core outcome set for informed consent for therapy. Methods The core outcome set was developed in accordance with a predefined research protocol and the Core OutcoMes in Effectiveness Trials methodology comprising systematic review, qualitative semi structured interviews, a modified Delphi process and consensus webinars (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11.  46
    On Σ1 1 equivalence relations over the natural numbers.Ekaterina B. Fokina & Sy-David Friedman - 2012 - Mathematical Logic Quarterly 58 (1-2):113-124.
    We study the structure of Σ11 equivalence relations on hyperarithmetical subsets of ω under reducibilities given by hyperarithmetical or computable functions, called h-reducibility and FF-reducibility, respectively. We show that the structure is rich even when one fixes the number of properly equation imagei.e., Σ11 but not equation image equivalence classes. We also show the existence of incomparable Σ11 equivalence relations that are complete as subsets of ω × ω with respect to the corresponding reducibility on sets. We study (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  12.  2
    Market Movers: the case of bitcoin in the Covid-19 setting.Daniela Penela - 2022 - Human Review. International Humanities Review / Revista Internacional de Humanidades 11 (7):1-11.
    Bitcoin is a virtual currency that provides a completely decentralized secure alternative to the currencies currently used. Nakamoto, the creator of this cryptocurrency, published an article on an encryption mailing list in 2008 with the title “Bitcoin: A Peer-to-Peer Electronic Cash System”, thus giving the creation of this virtual currency. This study aims to analyze the Bitcoin and what factors can influence its price, in the context of a pandemic. This work will focus on the bitcoin price and on five (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  18
    Improving working memory abilities in individuals with Down syndrome: a treatment case study.Hiwet Mariam Costa, Harry Robert McSweeney Purser & Maria Chiara Passolunghi - 2015 - Frontiers in Psychology 6:148881.
    Working Memory (WM) skills of individuals with Down’s syndrome DS tend to be very poor compared to typically developing children of similar mental age. In particular, research has found that in individuals with DS visuo-spatial WM is better preserved than verbal WM. This study investigated whether is possible to train Short-Term Memory (STM) and WM abilities in individuals with DS. The cases of two teenage children are reported: E.H., 17 years and 3 months, and A.S., 15 years and 11 months. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  14.  30
    Projective subsets of separable metric spaces.Arnold W. Miller - 1990 - Annals of Pure and Applied Logic 50 (1):53-69.
    In this paper we will consider two possible definitions of projective subsets of a separable metric space X. A set A subset of or equal to X is Σ11 iff there exists a complete separable metric space Y and Borel set B subset of or equal to X × Y such that A = {x ε X : there existsy ε Y ε B}. Except for the fact that X may not be completely metrizable, this is the classical definition (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  29
    The strength of the Grätzer-Schmidt theorem.Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen & Richard A. Shore - 2016 - Archive for Mathematical Logic 55 (5-6):687-704.
    The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this theorem. We also show thatthe set of indices of computable lattices that are complete is Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^1_1$$\end{document}-complete;the set of indices of computable lattices that are algebraic is Π11\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi ^1_1$$\end{document}-complete;the set of compact elements (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  16.  10
    Exploring Correlates of Loss of Control Eating in a Nonclinical Sample.Eva M. Conceição, Célia S. Moreira, Marta de Lourdes, Sofia Ramalho & Ana Rita Vaz - 2022 - Frontiers in Psychology 12.
    ObjectiveLoss of control eating has been directly related to the core aspects of the psychopathology of eating disorders and to different dimensions of emotion and behavior regulation and self-criticism. This study investigates a model representing the interplay between these dimensions to understand LOC eating among a nonclinical sample.MethodsA total of 341 participants, recruited in a college campus, completed a set of self-report measures assessing LOC eating, weight suppression, psychopathology of eating disorders, depression, negative urgency, emotion regulation difficulties, and self-criticism. Path (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  40
    Unraveling Π11 sets.Itay Neeman - 2000 - Annals of Pure and Applied Logic 106 (1-3):151-205.
    We construct coverings which unravel given Π11 sets. This in turn is used to prove, from optimal large cardinal assumptions, the determinacy of games with payoff and the determinacy of games with payoff in the σ algebra generated by Π11 sets.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  3
    Lie algebra labels,[1,\ A 11 B] I if ABC 11 C.A. L. Completing - 2010 - In Harald Fritzsch & K. K. Phua (eds.), Proceedings of the Conference in Honour of Murray Gell-Mann's 80th Birthday. World Scientific. pp. 74.
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  6
    Summa Theologiae. The Complete Paperback Set: 60 Volumes, Plus One Index Volume.Thomas Aquinas - 1964 - Cambridge University Press.
    The Summa Theologiae ranks among the greatest documents of the Christian Church, and is a landmark of medieval western thought. It is regularly consulted by scholars of theology, philosophy and a range of related academic disciplines. This paperback reissue of the classic Latin/English edition first published by the English Dominicans in the 1960s and 1970s has been undertaken in response to regular requests from around the world. The original text is unchanged, except for the correction of a small number of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  20.  25
    Happy families and completely Ramsey sets.Pierre Matet - 1993 - Archive for Mathematical Logic 32 (3):151-171.
    We use games of Kastanas to obtain a new characterization of the classC ℱ of all sets that are completely Ramsey with respect to a given happy family ℱ. We then combine this with ideas of Plewik to give a uniform proof of various results of Ellentuck, Louveau, Mathias and Milliken concerning the extent ofC ℱ. We also study some cardinals that can be associated with the ideal ℐℱ of nowhere ℱ-Ramsey sets.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  21.  15
    What's the difference?James H. Schmerl - 1998 - Annals of Pure and Applied Logic 93 (1-3):255-261.
    The set of all difference sets of natural numbers is a ∑11-complete set of reals.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  41
    Cores of Π11 sets of reals.Andreas Blass & Douglas Cenzer - 1974 - Journal of Symbolic Logic 39 (4):649 - 654.
  23. Fundamental and Emergent Geometry in Newtonian Physics.David Wallace - 2020 - British Journal for the Philosophy of Science 71 (1):1-32.
    Using as a starting point recent and apparently incompatible conclusions by Saunders and Knox, I revisit the question of the correct spacetime setting for Newtonian physics. I argue that understood correctly, these two versions of Newtonian physics make the same claims both about the background geometry required to define the theory, and about the inertial structure of the theory. In doing so I illustrate and explore in detail the view—espoused by Knox, and also by Brown —that inertial structure is defined (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  24.  25
    A Complete Axiom Set For Hansson's Deontic Logic Dsdl2.Xavier Parent - 2010 - Logic Journal of the IGPL 18 (3):422-429.
    The main contribution of this paper is a completeness result for an axiomatization of Hansson [13]'s deontic system DSDL2, whose semantics involves a non-necessarily transitive betterness relation. Reference is made to a deductive system put forth by Åqvist [2, 3].
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  25.  16
    Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Mathematical Logic Quarterly 34 (2):97-103.
  26.  25
    Constructively Complete Finite Sets.Mark Mandelkern - 1988 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 34 (2):97-103.
  27.  45
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
  28.  22
    Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
  29.  11
    Matrices of completely Ramsey sets with infinitely many rows.Athanasios Tsarpalias - 2014 - Mathematical Logic Quarterly 60 (1-2):54-58.
    The main result of the present article is the following: Let N be an infinite subset of,, and let be a matrix with infinitely many rows of completely Ramsey subsets of such that for every n,. Then there exist, a sequence of nonempty finite subsets of N, and an infinite subset T of such that for every infinite subset I of. We also give an application of this result to partitions of an uncountable analytic subset of a Polish space X (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30.  21
    A Critique of Some Anglo-American Models of Collective Moral Agency in Business.David Ardagh - 2013 - Philosophy of Management 12 (3):5-25.
    The paper completes a trilogy of papers, under the title: “A Quasi-Personal Alternative to Some Anglo-American Pluralist Models of Organisations: Towards an Analysis of Corporate Self-Governance for Virtuous Organisations”. The first two papers of the three are published in Philosophy of Management, Volumes 10,3 and 11,2. This last paper argues that three dominant Anglo-American organisational theories which see themselves as “business ethics-friendly,” are less so than they seem. It will be argued they present obstacles to collective corporate moral agency. They (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  7
    Generalised functional completeness of sets of m‐valued Sheffer functions.Alan Rose - 1984 - Mathematical Logic Quarterly 30 (12):177-182.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  28
    Generalised functional completeness of sets ofm-valued Sheffer functions.Alan Rose - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (12):177-182.
    Direct download  
     
    Export citation  
     
    Bookmark  
  33. Complete sets of logical functions.William Wernick - 1942 - [New York,: New york.
  34.  77
    Breve storia dell'etica.Sergio Cremaschi - 2012 - Roma RM, Italia: Carocci.
    The book reconstructs the history of Western ethics. The approach chosen focuses the endless dialectic of moral codes, or different kinds of ethos, moral doctrines that are preached in order to bring about a reform of existing ethos, and ethical theories that have taken shape in the context of controversies about the ethos and moral doctrines as means of justifying or reforming moral doctrines. Such dialectic is what is meant here by the phrase ‘moral traditions’, taken as a name for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  35.  13
    Compassion Satisfaction, Compassion Fatigue and Hardiness Among Nurses: A Comparison Before and During the COVID-19 Outbreak.Mohammad Ali Zakeri, Elham Rahiminezhad, Farzaneh Salehi, Hamid Ganjeh & Mahlagha Dehghan - 2022 - Frontiers in Psychology 12.
    BackgroundNurses provide the majority of health-care services and face numerous health challenges during an epidemic. During the COVID-19 epidemic, nurses are subjected to physical, mental, and social disorders that impair their quality of life and hardiness. Therefore, it is important to be aware of the situation of nurses. The current study aimed to compare the compassion satisfaction, compassion fatigue and hardiness among nurses before and during the COVID-19 outbreak.Materials and MethodsThis cross-sectional study included 508 clinical nurses from one public hospital (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Hugh J. McCann (ed.), Free will and Classical Theism: The Significance of Freedom in Perfect Being Theology[REVIEW]Garrett Pendergraft - 2017 - Notre Dame Philosophical Reviews 16.
    This volume collects a set of papers that were presented at a conference on “Big Questions in Free Will,” held at the University of Saint Thomas in October of 2014. It is dedicated to its editor, who passed away shortly after completing the manuscript. I will briefly summarize each of the 11 chapters and then offer a few critical comments.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  37.  39
    Generic expansions of ω-categorical structures and semantics of generalized quantifiers.A. A. Ivanov - 1999 - Journal of Symbolic Logic 64 (2):775-789.
    LetMbe a countably infinite ω-categorical structure. Consider Aut(M) as a complete metric space by definingd(g, h) = Ω{2−n:g(xn) ≠h(xn) org−1(xn) ≠h−1(xn)} where {xn:n∈ ω} is an enumeration ofMAn automorphism α ∈ Aut(M) is generic if its conjugacy class is comeagre. J. Truss has shown in [11] that if the set P of all finite partial isomorphisms contains a co-final subset P1closed under conjugacy and having the amalgamation property and the joint embedding property then there is a generic automorphism. In (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  38.  23
    IRBs under the microscope.Jonathan D. Moreno - 1998 - Kennedy Institute of Ethics Journal 8 (3):329-337.
    In lieu of an abstract, here is a brief excerpt of the content:IRBs Under the MicroscopeJonathan D. Moreno (bio)The spring and summer of 1998 were seasons in the sun for institutional review board (IRB) aficionados. Rarely have the arcana of the local human subjects review panels been treated to so much attention in both the executive and the legislative branches of government, not only at the federal but also at the state level. And it looks as if the attention will (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  27
    Some Properties of Thin Π2n+11 Sets.Yutaka Yasuda - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (3):199-200.
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. Higher-order automated theorem proving.Michael Kohlhase - unknown
    The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into (...)
     
    Export citation  
     
    Bookmark   5 citations  
  41.  10
    A sequent calculus for Limit Computable Mathematics.Stefano Berardi & Yoriyuki Yamagata - 2008 - Annals of Pure and Applied Logic 153 (1-3):111-126.
    We introduce an implication-free fragment image of ω-arithmetic, having Exchange rule for sequents dropped. Exchange rule for formulas is, instead, an admissible rule in image. Our main result is that cut-free proofs of image are isomorphic with recursive winning strategies of a set of games called “1-backtracking games” in [S. Berardi, Th. Coquand, S. Hayashi, Games with 1-backtracking, Games for Logic and Programming Languages, Edinburgh, April 2005].We also show that image is a sound and complete formal system for the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  24
    Important Topics for Fostering Research Integrity by Research Performing and Research Funding Organizations: A Delphi Consensus Study.Joeri Tijdink, Lidwine Mokkink, Ana Marušić, Natalie Evans, Guy Widdershoven, Lex Bouter, Rea Roje & Krishma Labib - 2021 - Science and Engineering Ethics 27 (4):1-22.
    To foster research integrity (RI), it is necessary to address the institutional and system-of-science factors that influence researchers’ behavior. Consequently, research performing and research funding organizations (RPOs and RFOs) could develop comprehensive RI policies outlining the concrete steps they will take to foster RI. So far, there is no consensus on which topics are important to address in RI policies. Therefore, we conducted a three round Delphi survey study to explore which RI topics to address in institutional RI policies by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  19
    Hylomorphism, Change, and God's Mutability: A Rejoinder to Ebrahim Azadegan.Amirhossein Zadyousefi - 2023 - Philosophy East and West 73 (1):196-202.
    In lieu of an abstract, here is a brief excerpt of the content:Hylomorphism, Change, and God's Mutability:A Rejoinder to Ebrahim AzadeganAmirhossein Zadyousefi (bio)In "A Long Way to God's Mutability: A Response to Ebrahim Azadegan"1 I tried to challenge what Azadegan says in his "On the Incompatibility of God's Knowledge of Particulars and the Doctrine of Divine Immutability: Towards a Reform in Islamic Theology."2 Then, in his "Necessary Existence, Immutability, and God's Knowledge of Particulars: A Reply to Amirhossein Zadyousefi,"3 Azadegan replies (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  44.  23
    On isomorphism classes of computably enumerable equivalence relations.Uri Andrews & Serikzhan A. Badaev - 2020 - Journal of Symbolic Logic 85 (1):61-86.
    We examine how degrees of computably enumerable equivalence relations under computable reduction break down into isomorphism classes. Two ceers are isomorphic if there is a computable permutation of ω which reduces one to the other. As a method of focusing on nontrivial differences in isomorphism classes, we give special attention to weakly precomplete ceers. For any degree, we consider the number of isomorphism types contained in the degree and the number of isomorphism types of weakly precomplete ceers contained in the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  45. πολλαχῶς ἔστι; Plato’s Neglected Ontology.Mohammad Bagher Ghomi - manuscript
    This paper aims to suggest a new approach to Plato’s theory of being in Republic V and Sophist based on the notion of difference and the being of a copy. To understand Plato’s ontology in these two dialogues we are going to suggest a theory we call Pollachos Esti; a name we took from Aristotle’s pollachos legetai both to remind the similarities of the two structures and to reach a consistent view of Plato’s ontology. Based on this theory, when Plato (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  46. Plato’s Metaphysical Development before Middle Period Dialogues.Mohammad Bagher Ghomi - manuscript
    Regarding the relation of Plato’s early and middle period dialogues, scholars have been divided to two opposing groups: unitarists and developmentalists. While developmentalists try to prove that there are some noticeable and even fundamental differences between Plato’s early and middle period dialogues, the unitarists assert that there is no essential difference in there. The main goal of this article is to suggest that some of Plato’s ontological as well as epistemological principles change, both radically and fundamentally, between the early and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  9
    Sentence logic.Paul Teller - 1989 - Englewood Cliffs, NJ, USA: Prentice-Hall.
    Table of Contents Volume I Preface to Volumes I and II: A Guide to the Primer Chapter 1, Basic Ideas and Tools Chapter 2, Transcription between English and Sentence Logic Chapter 3, Logical Equivalence, Logical Truths, and Contradictions Chapter 4, Validity and Conditionals Chapter 5, Natural Deduction for Sentence Logic: Fundamentals Chapter 6, Natural Deduction for Sentence Logic: Strategies Chapter 7, Natural Deduction for Sentence Logic: Derived Rules and Derivations without Premises Chapter 8, Truth Tree for Sentence Logic: Fundamentals Chapter (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  48.  28
    Bericht über die Autopsie von vier spätmittelalterlichen Wiener Handschriften.Harald Berger - 2011 - Bulletin de Philosophie Medievale 53:333 - 347.
    This article presents for the first time complete descriptions of four codices of the Austrian National Library at Vienna, viz. 1617, 5237, 5248 and 5377. Cod. 1617 is a fragment of Henry Totting of Oyta’s 13 Quaestiones Sententiarum, comprising part of q.7 and qq.8-13 in 198 ff.. The other three manuscripts contain mainly logical texts, e.g., Albert of Saxony’s Sophismata in Cods. 5237 and 5377, his Insolubilia in Cod. 5248, and his Quaestiones Posteriorum in Cod. 5377; 11 of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  49.  29
    Locales, Nuclei, and Dragalin Frames.Guram Bezhanishvili & Wesley Holliday - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. London: College Publications. pp. 177-196.
    It is a classic result in lattice theory that a poset is a complete lattice iff it can be realized as fixpoints of a closure operator on a powerset. Dragalin [9,10] observed that a poset is a locale (complete Heyting algebra) iff it can be realized as fixpoints of a nucleus on the locale of upsets of a poset. He also showed how to generate a nucleus on upsets by adding a structure of “paths” to a poset, forming (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. A splitting theorem for simple π11 sets.James C. Owings - 1971 - Journal of Symbolic Logic 36 (3):433 - 438.
1 — 50 / 1000