Results for 'Set union operation'

977 found
Order:
  1.  24
    Computable operators on regular sets.Martin Ziegler - 2004 - Mathematical Logic Quarterly 50 (4-5):392-404.
    For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural operations on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions. It turns out that only few of these notions are suitable in the sense of rendering all those operations uniformly computable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  43
    Łukasiewicz Operations in Fuzzy Set and Many-Valued Representations of Quantum Logics.Jarosław Pykacz - 2000 - Foundations of Physics 30 (9):1503-1524.
    It, is shown that Birkhoff –von Neumann quantum logic (i.e., an orthomodular lattice or poset) possessing an ordering set of probability measures S can be isomorphically represented as a family of fuzzy subsets of S or, equivalently, as a family of propositional functions with arguments ranging over S and belonging to the domain of infinite-valued Łukasiewicz logic. This representation endows BvN quantum logic with a new pair of partially defined binary operations, different from the order-theoretic ones: Łukasiewicz intersection and (...) of fuzzy sets in the first case and Łukasiewicz conjunction and disjunction in the second. Relations between old and new operations are studied and it is shown that although they coincide whenever new operations are defined, they are not identical in general. The hypothesis that quantum-logical conjunction and disjunction should be represented by Łukasiewicz operations, not by order-theoretic join and meet is formulated and some of its possible consequences are considered. (shrink)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  3.  40
    Calculus of Contextual Rough Sets in Contextual Spaces.Edward Bryniarski & Urszula Wybraniec-Skardowska - 1998 - Journal of Applied Non-Classical Logics 8 (1):9-26.
    The work broadens – to a considerable extent – Z. Pawlak’s original method (1982, 1992) of approximation of sets. The approximation of sets included in a universum U goes on in the contextual approximation space CAS which consists of: 1) a sequence of Pawlak’s approximation spaces (U,Ci), where indexes i from set I are linearly ordered degrees of contexts (I, <), and Ci is the universum partition U, 2) a sequence of binary relations on sets included in U, relations called (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4. Plithogenic Set, an Extension of Crisp, Fuzzy, Intuitionistic Fuzzy, and Neutrosophic Sets – Revisited.Florentin Smarandache - 2018 - Neutrosophic Sets and Systems 21:153-166.
    In this paper, we introduce the plithogenic set (as generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets), which is a set whose elements are characterized by many attributes (parameters)’ values. An attribute value v has a corresponding (fuzzy, intuitionistic fuzzy, or neutrosophic) degree of appurtenance d(x,v) of the element x, to the set P, with respect to some given criteria. In order to obtain a better accuracy for the plithogenic aggregation operators in the plithogenic set, and for a more (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  42
    U-Meager sets when the cofinality and the coinitiality of U are uncountable.Bosko Zivaljevic - 1991 - Journal of Symbolic Logic 56 (3):906-914.
    We prove that every countably determined set C is U-meager if and only if every internal subset A of C is U-meager, provided that the cofinality and coinitiality of the cut U are both uncountable. As a consequence we prove that for such cuts a countably determined set C which intersects every U-monad in at most countably many points is U-meager. That complements a similar result in [KL]. We also give some partial solutions to some open problems from [KL]. We (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  6. Introduction to Develop Some Software Programs for Dealing with Neutrosophic Sets.A. Salama, Haitham A. El-Ghareeb, Ayman M. Manie & Florentin Smarandache - 2014 - Neutrosophic Sets and Systems 3:51-52.
    In this paper, we have developed an Excel package to be utilized for calculating neutrosophic data and analyze them. The use of object oriented programming techniques and concepts as they may apply to the design and development a new framework to implement neutrosophic data operations, the c# programming language, NET Framework and Microsoft Visual Studio are used to implement the neutrosophic classes. We have used Excel as it is a powerful tool that is widely accepted and used for statistical analysis. (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7.  41
    Retrieving the Co-operative Value-Based Leadership Model of Terry Thomas.Peter Davis - 2016 - Journal of Business Ethics 135 (3):557-568.
    The paper documents the post-war retrenchment and failure of the post-war British Consumer Co-operative Movement. In contrast to the general failure one CEO, Terry Thomas stands out both for his success in co-operative rebranding and returning to profitability the UK Co-operative Bank and because he alone amongst the top echelons of the Co-operative Groups Management based his strategies on a clearly articulated philosophy based on his understanding of the values and purpose of the co-operative movement rooted in its historical traditions (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  61
    Intuitionistic sets and ordinals.Paul Taylor - 1996 - Journal of Symbolic Logic 61 (3):705-744.
    Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifies the traditional development of successors and unions, making it intuitionistic; even the (classical) proof of trichotomy is made simpler. The definition is, however, recursive, and, as their name suggests, the plump (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  9. New directions in descriptive set theory.Alexander S. Kechris - 1999 - Bulletin of Symbolic Logic 5 (2):161-174.
    §1. I will start with a quick definition of descriptive set theory: It is the study of the structure of definable sets and functions in separable completely metrizable spaces. Such spaces are usually called Polish spaces. Typical examples are ℝn, ℂn, Hilbert space and more generally all separable Banach spaces, the Cantor space 2ℕ, the Baire space ℕℕ, the infinite symmetric group S∞, the unitary group, the group of measure preserving transformations of the unit interval, etc.In this theory sets are (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  10.  54
    The Concept of European Administrative Law and the Background of the Development of the Law on Administrative Procedure of the European Union.Ieva Deviatnikovaitė - 2013 - Jurisprudencija: Mokslo darbu žurnalas 20 (3):1005-1022.
    There are several reasons, according to which it is worth analyzing European administrative law. First, this is a rather new branch of law. Second, the European administrative law is treated in different countries from different legal traditions positions, consequently, any effort to unify the approach to it can provide a basis for a unified European administrative law model. Third, there are no works dedicated to the analysis of the phenomenon of the European administrative law in Lithuania. Therefore, this article deals (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  11. Substructural Logics, Combinatory Logic, and Lambda-Calculus.Katalin Bimbo - 1999 - Dissertation, Indiana University
    The dissertation deals with problems in "logic", more precisely, it deals with particular formal systems aiming at capturing patterns of valid reasoning. Sequent calculi were proposed to characterize logical connectives via introduction rules. These systems customarily also have structural rules which allow one to rearrange the set of premises and conclusions. In the "structurally free logic" of Dunn and Meyer the structural rules are replaced by combinatory rules which allow the same reshuffling of formulae, and additionally introduce an explicit marker (...)
     
    Export citation  
     
    Bookmark  
  12.  22
    A fixed point for the jump operator on structures.Antonio Montalbán - 2013 - Journal of Symbolic Logic 78 (2):425-438.
    Assuming that $0^\#$ exists, we prove that there is a structure that can effectively interpret its own jump. In particular, we get a structure $\mathcal A$ such that \[ \textit{Sp}({\mathcal A}) = \{{\bf x}'\colon {\bf x}\in \textit{Sp}({\mathcal A})\}, \] where $\textit{Sp}({\mathcal A})$ is the set of Turing degrees which compute a copy of $\mathcal A$. More interesting than the result itself is its unexpected complexity. We prove that higher-order arithmetic, which is the union of full $n$th-order arithmetic for all (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13. A New Approach to Multi-Spaces Through the Application of Soft Sets.Mumtaz Ali, Florentin Smarandache, Said Broumi & Muhammad Shabir - 2015 - Neutrosophic Sets and Systems 7:34-39.
    Multi-space is the notion combining different fields in to a unifying field, which is more applicable in our daily life. In this paper, we introduced the notion of multi-soft space which is the approximated collection of the multi-subspaces of a multi-space . Further, we defined some basic operations such as union, intersection, AND, OR etc. We also investigated some properties of multi-soft spaces.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  14.  72
    Defining the Concept of 'Services of General Interest' in Light of the 'Checks and Balances' Set Out in the EU Treaties.Koen Lenaerts* - 2012 - Jurisprudencija: Mokslo darbu žurnalas 19 (4):1247-1267.
    This article aims to shed some light on the concepts embedded in the expressions ‘services of general interest’ (‘SGI’), ‘services of general economic interest’ (‘SGEI’), ‘non-economic services of general interest’ (‘NSGI’) and ‘social services of general interest’ (‘SSGI’). It is submitted that the expression ‘SGI’ conveys a general concept which comprises both SGEI and NSGI. SGEI may be distinguished from NSGI in that only the former involve an economic activity. In contrast to SGI, SGEI and NSGI, the expression ‘SSGI’ is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15. Standard Neutrosophic Soft Theory- Some First Resluts.Bui Cong Cuong, Pham Hong Phong & Florentin Smarandache - 2016 - Neutrosophic Sets and Systems 12:80-91.
    The traditional soft set is a mapping from a parameter set to family of all crisp subsets of a universe. Molodtsov introduced the soft set as a generalized tool for modelling complex systems involving uncertain or not clearly defined objects. In this paper, the notion of neutrosophic soft set is reanalysed. The novel theory is a combination of neutrosophic set theory and soft set theory. The complement, “and”, “or”, intersection and union operations are defined on the neutrosophic soft sets. (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  16.  23
    $$\textsf{ST}$$ and $$\textsf{TS}$$ as Product and Sum.Quentin Blomet & Paul Égré - 2024 - Journal of Philosophical Logic 53 (6):1673-1700.
    The set of $$\textsf{ST}$$ ST -valid inferences is neither the intersection, nor the union of the sets of $$\textsf{K}_3$$ K 3 -valid and $$\textsf{LP}$$ LP -valid inferences, but despite the proximity to both systems, an extensional characterization of $$\textsf{ST}$$ ST in terms of a natural set-theoretic operation on the sets of $$\textsf{K}_3$$ K 3 -valid and $$\textsf{LP}$$ LP -valid inferences is still wanting. In this paper, we show that it is their relational product. Similarly, we prove that the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  27
    Fixed-points of Set-continuous Operators.O. Esser, R. Hinnion & D. Dzierzgowski - 2000 - Mathematical Logic Quarterly 46 (2):183-194.
    In this paper, we study when a set-continuous operator has a fixed-point that is the intersection of a directed family. The framework of our study is the Kelley-Morse theory KMC– and the Gödel-Bernays theory GBC–, both theories including an Axiom of Choice and excluding the Axiom of Foundation. On the one hand, we prove a result concerning monotone operators in KMC– that cannot be proved in GBC–. On the other hand, we study conditions on directed superclasses in GBC– in order (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  19
    Every Borel function is monotone Borel.Boško Živaljević - 1991 - Annals of Pure and Applied Logic 54 (1):87-99.
    Given two internal sets X and Y we prove that every Borel function whose graph is a subset of the product X x Y is a member of the least set containing the class of all internal functions and closed with respect to the operations of monotone countable union and intersection. We also prove that any Souslin function can be extended to a Borel function and obtain, as a corollary, a new proof of the recent result of Henson and (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  27
    Largest fixed points of set continuous operators and Boffa's Anti-Foundation.Hisato Muraki - 2005 - Mathematical Logic Quarterly 51 (4):365.
    In Aczel [1], the existence of largest fixed points of set continuous operators is proved assuming the schema version of dependent choices in Zermelo-Fraenkel set theory without the axiom of Foundation. In the present paper, we study whether the existence of largest fixed points of set continuous operators is provable without the schema version of dependent choices, using Boffa's weak antifoundation axioms.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20. Invariance and Set-Theoretical Operations in First Order Structures.Alexandre Rodrigues, Ricardo Filho & Edelcio de Souza - 2006 - Reports on Mathematical Logic:207-213.
    No categories
     
    Export citation  
     
    Bookmark  
  21.  27
    Logical metatheorems for accretive and (generalized) monotone set-valued operators.Nicholas Pischke - 2023 - Journal of Mathematical Logic 24 (2).
    Accretive and monotone operator theory are central branches of nonlinear functional analysis and constitute the abstract study of certain set-valued mappings between function spaces. This paper deals with the computational properties of these accretive and (generalized) monotone set-valued operators. In particular, we develop (and extend) for this field the theoretical framework of proof mining, a program in mathematical logic that seeks to extract computational information from prima facie “non-computational” proofs from the mainstream literature. To this end, we establish logical metatheorems (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  22.  20
    The linear logic of multisets.A. Tzouvaras - 1998 - Logic Journal of the IGPL 6 (6):901-916.
    We consider finite multisets over some set of urelements equipped only with additive union [uplus ] and show that the {[otimes], -0}-Horn fragment of Intuitionistic Linear Logic has a sound and complete interpretation in them by interpreting [otimes] as [uplus ]. The linear implication is interpreted by ordered pairs of multisets expressing replacement. The operator ! is also defined in an asymptotic way. Soundness, completeness and partial completeness results are proved for the {×, -0, !}-Horn fragment as well.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  49
    What I Know and Don't Know: A Christian Reflects on Buddhist Practice.Mary Frohlich - 2001 - Buddhist-Christian Studies 21 (1):37-41.
    In lieu of an abstract, here is a brief excerpt of the content:Buddhist-Christian Studies 21.1 (2001) 37-41 [Access article in PDF] What I Know and Don't Know: A Christian Reflects on Buddhist Practice Mary Frohlich Catholic Theological Union To reflect and write on spiritual practice for publication in an academic journal requires a delicate balancing act. It is not appropriate simply to recount one's experience; nor is it appropriate merely to theorize. I am assisted in this balancing act by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  24.  19
    Ω-operations over partial enumerated sets.Andrzej Orlicki - 1993 - Mathematical Logic Quarterly 39 (1):551-558.
    In the present paper we concentrate on fundamental problems concerning ω-operations over partial enumerated sets. The notion of “HOM-lifts” seems to be an adequate tool for this kind of investigations. MSC: 03D45, 18A30.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  30
    Callimachus in Context: From Plato to the Augustan Poets by Benjamin Acosta-Hughes, Susan A. Stephens (review).Ivana Petrovic - 2015 - American Journal of Philology 136 (2):365-368.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Callimachus in Context: From Plato to the Augustan Poets by Benjamin Acosta-Hughes, Susan A. StephensIvana PetrovicBenjamin Acosta-Hughes and Susan A. Stephens. Callimachus in Context: From Plato to the Augustan Poets. Cambridge: Cambridge University Press 2012. xvi + 328 pp. 4 maps. Cloth, $99.Callimachus is a scholar’s poet, not just because his poetry is difficult and challenging, but also because we tend to see a reflection of ourselves in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  26.  7
    Language: from meaning to text.Igorʹ A. Melʹčuk - 2016 - Boston: Academic Studies Press. Edited by David Beck.
    This volume presents a sketch of the Meaning-Text linguistic approach, richly illustrated by examples borrowed mainly, but not exclusively, from English. Chapter 1 expounds the basic idea that underlies this approach—that a natural language must be described as a correspondence between linguistic meanings and linguistic texts—and explains the organization of the book. Chapter 2 introduces the notion of linguistic functional model, the three postulates of the Meaning-Text approach (a language is a particular meaning-text correspondence, a language must be described by (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  27. An alternative semantics for quantified relevant logic.Edwin D. Mares & Robert Goldblatt - 2006 - Journal of Symbolic Logic 71 (1):163-187.
    The quantified relevant logic RQ is given a new semantics in which a formula for all xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': for all x(A V (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   56 citations  
  28.  60
    The Talmud meets church history.Daniel Boyarin - 1998 - Diacritics 28 (2):52-80.
    In lieu of an abstract, here is a brief excerpt of the content:The Talmud Meets Church HistoryDaniel Boyarin (bio)Virginia Burrus. Chastity as Autonomy: Women in the Stories of the Apocryphal Acts. New York: Edwin Mellen, 1987.———. ‘“Equipped for Victory’: Ambrose and the Gendering of Orthodoxy.” Journal of Early Christian Studies 4.4 (1996): 461–75.———. The Making Of A Heretic: Gender, Authority, And The Priscillianist Controversy. Berkeley: U of California P, 1995.———. “Reading Agnes: The Rhetoric of Gender in Ambrose and Prudentius.” Journal (...)
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  29.  54
    Algebra and Theory of Order-Deterministic Pomsets.Arend Rensink - 1996 - Notre Dame Journal of Formal Logic 37 (2):283-320.
    This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call order-deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of order-deterministic pomsets are prime algebraic), and it constitutes a reflective subcategory of the category of all pomsets. For the order-deterministic pomsets we develop an algebra with a sound and (-) complete (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  30.  90
    The fine structure of the intuitionistic borel hierarchy.Wim Veldman - 2009 - Review of Symbolic Logic 2 (1):30-101.
    In intuitionistic analysis, a subset of a Polish space like or is called positively Borel if and only if it is an open subset of the space or a closed subset of the space or the result of forming either the countable union or the countable intersection of an infinite sequence of (earlier constructed) positively Borel subsets of the space. The operation of taking the complement is absent from this inductive definition, and, in fact, the complement of a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31. Valuations for the Quantum Propositional Structures and Hidden Variables for Quantum Mechanics.Ariadna Chernavska - 1980 - Dissertation, The University of British Columbia (Canada)
    The final portion of the thesis surveys proposals for the introduction of hidden variables into quantum mechanics, proofs of the impossibility of such hidden-variable proposals, and criticisms of these impossibility proofs. And arguments in favour of the partial-Boolean algebra, rather than the orthomodular lattice, formalization of the quantum propositional structures are reviewed. ;As for , each quantum state-induced expectation-function on a P truth-functionally assigns 1 and 0 values to the elements in a ultrafilter and dual ultraideal of P, where in (...)
     
    Export citation  
     
    Bookmark  
  32.  12
    The nature and tendency of free institutions.Frederick Grimké - 1848 - Cambridge,: Belknap Press of Harvard University Press. Edited by John William Ward.
    First published in 1848, Frederick Grimke's book, in the words of the editor, "deserves comparison with Tocqueville's justly famous work, Democracy in America, and is in certain ways superior. It is the single best book written by an American in the nineteenth century on the meaning of our political way of life." A second edition of Grimke's work was published in 1856, and a third edition appeared posthumously in 1871, but since then this classic in American thought has been almost (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  33. Reviewing Games of Empire: Global Capitalism and Video Games.Simon Ferrari & Ian Bogost - 2013 - Continent 3 (1):50-52.
    Nick Dyer-Witheford and Greig de Peuter. Games of Empire: Global Capitalism and Video Games . Minneapolis: University of Minnesota Press. 2009. 320pp. pbk. $19.95 ISBN-13: 978-0816666119. In Games of Empire , Nick Dyer-Witheford and Greig de Peuter expand an earlier study of “the video game industry as an aspect of an emerging postindustrial, post-Fordist capitalism” (xxix) to argue that videogames are “exemplary media of Empire” (xxix). Their notion of “Empire” is based on Michael Hardt and Antonio Negri’s Empire (2000), which (...)
     
    Export citation  
     
    Bookmark  
  34.  34
    Continental and Feminist Philosophical Pedagogies: Conditions.Sina Kramer - 2012 - philoSOPHIA: A Journal of Continental Feminism 2 (1):68-71.
    In lieu of an abstract, here is a brief excerpt of the content:Continental and Feminist Philosophical PedagogiesConditionsSina KramerIn thinking through what it means to teach continental and feminist philosophy, I keep coming back to a somewhat enigmatic line from Adorno’s essay, “Why Still Philosophy?”: “Because philosophy is good for nothing, it is not yet obsolete” (Adorno 2005, 15). I believe that this dialectical aphorism has everything to do with the conditions under which we as teachers practice philosophy today, and continental (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  46
    Introduction to computability logic.Giorgi Japaridze - 2003 - Annals of Pure and Applied Logic 123 (1-3):1-99.
    This work is an attempt to lay foundations for a theory of interactive computation and bring logic and theory of computing closer together. It semantically introduces a logic of computability and sets a program for studying various aspects of that logic. The intuitive notion of computational problems is formalized as a certain new, procedural-rule-free sort of games between the machine and the environment, and computability is understood as existence of an interactive Turing machine that wins the game against any possible (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  36.  31
    Positive set-operators of low complexity.Athanossios Tzouvaras - 2003 - Mathematical Logic Quarterly 49 (3):284.
    The powerset operator, [MATHEMATICAL SCRIPT CAPITAL P], is compared with other operators of similar type and logical complexity. Namely we examine positive operators whose defining formula has a canonical form containing at most a string of universal quantifiers. We call them ∀-operators. The question we address in this paper is: How is the class of ∀-operators generated ? It is shown that every positive ∀-operator Γ such that Γ ≠ ∅, is finitely generated from [MATHEMATICAL SCRIPT CAPITAL P], the identity (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  70
    Structure theorems for o-minimal expansions of groups.Mario J. Edmundo - 2000 - Annals of Pure and Applied Logic 102 (1-2):159-181.
    Let R be an o-minimal expansion of an ordered group R has no poles, R cannot define a real closed field with domain R and order R is eventually linear and every R -definable set is a finite union of cones. As a corollary we get that Th has quantifier elimination and universal axiomatization in the language with symbols for the ordered group operations, bounded R -definable sets and a symbol for each definable endomorphism of the group.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  38.  35
    On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality.Tarek Sayed Ahmed - 2015 - Mathematical Logic Quarterly 61 (6):418-477.
    We consider countable so‐called rich subsemigroups of ; each such semigroup T gives a variety CPEAT that is axiomatizable by a finite schema of equations taken in a countable subsignature of that of ω‐dimensional cylindric‐polyadic algebras with equality where substitutions are restricted to maps in T. It is shown that for any such T, if and only if is representable as a concrete set algebra of ω‐ary relations. The operations in the signature are set‐theoretically interpreted like in polyadic equality set (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  39.  89
    Instinct of Nature: Natural Law, Synderesis, and the Moral Sense.Robert A. Greene - 1997 - Journal of the History of Ideas 58 (2):173-198.
    In lieu of an abstract, here is a brief excerpt of the content:Instinct of Nature: Natural Law, Synderesis, and the Moral SenseRobert A. Greene“Instinct is a great matter.”—Sir John FalstaffThis essay traces the evolution of the meaning of the expression instinctus naturae in the discussion of the natural law from Justinian’s Digest through its association with synderesis to Francis Hutcheson’s theory of the moral sense. The introduction of instinctus naturae into Ulpian’s definition of the natural law by Isidore of Seville (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  40.  53
    Considerable Sets of Linear Operators in Hilbert Spaces as Operator Generalized Effect Algebras.Jan Paseka & Zdenka Riečanová - 2011 - Foundations of Physics 41 (10):1634-1647.
    We show that considerable sets of positive linear operators namely their extensions as closures, adjoints or Friedrichs positive self-adjoint extensions form operator (generalized) effect algebras. Moreover, in these cases the partial effect algebraic operation of two operators coincides with usual sum of operators in complex Hilbert spaces whenever it is defined. These sets include also unbounded operators which play important role of observables (e.g., momentum and position) in the mathematical formulation of quantum mechanics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  36
    Arto Salomaa. On infinitely generated sets of operations infinite algebras. Annales Universitatis Turkuensis, series A, I, Astronomica-chemica-physica-mathematica, no. 74. Turun Yliopisto, Turku1964, 13 pp. [REVIEW]Atwell R. Turquette - 1966 - Journal of Symbolic Logic 31 (1):119-120.
  42.  3
    Crypto-preorders, topological relations, information and logic.Piero Pagliani International Rough Set Society, Rome & Italy - 2024 - Journal of Applied Non-Classical Logics 34 (2):330-367.
    As is well known, any preorder R on a set U induces an Alexandrov topology on U. In some interesting cases related to data mining an Alexandrov topology can be transformed into different types of logico-algebraic models. In some cases, (pre)topological operators provided by Pointless Topology may define a topological space on U even if R is not a preorder. If this is the case, then we call R a crypto-preorder. The paper studies the conditions under which a relation R (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  27
    Constructive Set Theory with Operations.Andrea Cantini & Laura Crosilla - 2007 - In Alessandro Andretta, Keith Kearnes & Domenico Zambella, Logic Colloquium 2004: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Torino, Italy, July 25-31, 2004. Cambridge: Cambridge University Press.
    We present an extension of constructive Zermelo{Fraenkel set theory [2]. Constructive sets are endowed with an applicative structure, which allows us to express several set theoretic constructs uniformly and explicitly. From the proof theoretic point of view, the addition is shown to be conservative. In particular, we single out a theory of constructive sets with operations which has the same strength as Peano arithmetic.
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  44.  32
    V. I. Amstislavskij. Téorétiko-množéstvénnyé operacii i rékursivnyé iérarhii. Doklady Akadémii Nauk SSSR, vol. 169 , pp. 995–998. - V. I. Amstislavskij. Set-theoretical operations and recursive hierarchies. English translation of the preceding by E. Wesley. Soviet mathematics, vol. 7 no. 4 , pp. 1029–1032. - V. I. Amstislavskij. Rasširénié rékursivnyh iérarhij i R-opéracii. Doklady Akadémii Nauk SSSR, vol. 180 , pp. 1023–1026. - V. I. Amstislavskij. Expansion of recursive hierarchies and R-operations. English translation of the preceding by A. Yablonsky. Soviet mathematics, vol. 9 no. 3 , pp. 703–706. - V. I. Amstislavskij. O razložénii téla množéstv, polučaémyh R-opéraciéj nad rékursivnymi množéstvami. Doklady Akadémii Nauk SSSR, vol. 191 , pp. 743–746. - V. I. Amstislavskij. On the decomposition of a field of sets obtained by an R-operation over recursive sets. English translation of the preceding by S. Shepherd. Soviet mathematics, vol. 11 no. 2 , pp. 419–422. - V. I. Amstislavskij. [REVIEW]Peter G. Hinman - 1972 - Journal of Symbolic Logic 37 (2):409-410.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  15
    Relativizing operational set theory.Gerhard Jäger - 2016 - Bulletin of Symbolic Logic 22 (3):332-352.
    We introduce a way of relativizing operational set theory that also takes care of application. After presenting the basic approach and proving some essential properties of this new form of relativization we turn to the notion of relativized regularity and to the system OST that extends OST by a limit axiom claiming that any set is element of a relativized regular set. Finally we show that OST is proof-theoretically equivalent to the well-known theory KPi for a recursively inaccessible universe.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46. On Husserl's Theory of Wholes and Parts.Ettore Casari - 2000 - History and Philosophy of Logic 21 (1):1-43.
    The strongly innovative theory of whole-parts relations outlined by Husserl in his Third logical Investigation—to which he attributed a basic value for his entire phenomenology—has recently attracted a renewed interest. Although many important issues have been clarified (especially by Kit Fine) the subject seems still worth being revisited. To this aim Husserlian universes are introduced. These are lower bounded distributive lattices endowed with a unary operation of defect and a binary relation of isogeneity. Husserl's contents are identified with nonzero (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  47.  70
    Randomness and Halting Probabilities.VeróNica Becher, Santiago Figueira, Serge Grigorieff & Joseph S. Miller - 2006 - Journal of Symbolic Logic 71 (4):1411 - 1430.
    We consider the question of randomness of the probability ΩU[X] that an optimal Turing machine U halts and outputs a string in a fixed set X. The main results are as follows: ΩU[X] is random whenever X is $\Sigma _{n}^{0}$-complete or $\Pi _{n}^{0}$-complete for some n ≥ 2. However, for n ≥ 2, ΩU[X] is not n-random when X is $\Sigma _{n}^{0}$ or $\Pi _{n}^{0}$ Nevertheless, there exists $\Delta _{n+1}^{0}$ sets such that ΩU[X] is n-random. There are $\Delta _{2}^{0}$ sets (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  31
    Ordinal operations on graph representations of sets.Laurence Kirby - 2013 - Mathematical Logic Quarterly 59 (1-2):19-26.
    Any set x is uniquely specified by the graph of the membership relation on the set obtained by adjoining x to the transitive closure of x. Thus any operation on sets can be looked at as an operation on these graphs. We look at the operations of ordinal arithmetic of sets in this light. This turns out to be simplest for a modified ordinal arithmetic based on the Zermelo ordinals, instead of the usual von Neumann ordinals. In this (...)
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  49.  30
    (1 other version)Butler Jean W.. On complete and independent sets of truth functions in multi-valued logics. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 78–80.Butler Jean W.. On complete and independent sets of operations in finite algebras. Pacific journal of mathematics, vol. 10 , pp. 1169–1179. [REVIEW]Atwell R. Turquette - 1965 - Journal of Symbolic Logic 30 (2):246-246.
  50.  74
    Countable unions of simple sets in the core model.P. D. Welch - 1996 - Journal of Symbolic Logic 61 (1):293-312.
    We follow [8] in asking when a set of ordinals $X \subseteq \alpha$ is a countable union of sets in K, the core model. We show that, analogously to L, and X closed under the canonical Σ 1 Skolem function for K α can be so decomposed provided K is such that no ω-closed filters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erdős-type property.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 977