Results for 'logistics, categories, function, relation, set, class, subset, subclass'

1000+ found
Order:
  1. Символічна логіка: повернення до витоків. Стаття ІІІ. Похідні логістичні категорії.Yaroslav Kokhan - 2021 - Multiversum. Philosophical Almanac 2 (2):141-155.
    The paper is Part III of the large research, dedicated to both the revision of the system of basic logical categories and the generalization of modern predicate logic to functional logic. We determinate and contrapose modern Fregean logistics and proposed by the author ultra-Fregean logistics, next we describe values and arguments of functions, arguments of relations, relations themselves, sets (classes), and subsets (subclasses) as derivative categories (concepts) of ultrafregean logistics. Logistics is a part of metalogic, independent of semantics. Fregean logictics (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  20
    A Class of Implicative Expansions of Kleene’s Strong Logic, a Subclass of Which Is Shown Functionally Complete Via the Precompleteness of Łukasiewicz’s 3-Valued Logic Ł3.Gemma Robles & José M. Méndez - 2021 - Journal of Logic, Language and Information 30 (3):533-556.
    The present paper is a sequel to Robles et al. :349–374, 2020. https://doi.org/10.1007/s10849-019-09306-2). A class of implicative expansions of Kleene’s 3-valued logic functionally including Łukasiewicz’s logic Ł3 is defined. Several properties of this class and/or some of its subclasses are investigated. Properties contemplated include functional completeness for the 3-element set of truth-values, presence of natural conditionals, variable-sharing property and vsp-related properties.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  3.  30
    Labelling classes by sets.M. Victoria Marshall & M. Gloria Schwarze - 2005 - Archive for Mathematical Logic 44 (2):219-226.
    Let Q be an equivalence relation whose equivalence classes, denoted Q[x], may be proper classes. A function L defined on Field(Q) is a labelling for Q if and only if for all x,L(x) is a set and L is a labelling by subsets for Q if and only if BG denotes Bernays-Gödel class-set theory with neither the axiom of foundation, AF, nor the class axiom of choice, E. The following are relatively consistent with BG. (1) E is true but there (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4. The category of equivalence relations.Luca San Mauro, Valentino Delle Rose & Andrea Sorbi - 2021 - Algebra and Logic 5 (60):295-307.
    We make some beginning observations about the category Eq of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations R and S is a mapping from the set of R-equivalence classes to that of S-equivalence classes, which is induced by a computable function. We also consider some full subcategories of Eq, such as the category Eq(Σ01) of computably enumerable equivalence relations (called ceers), the category Eq(Π01) of co-computably enumerable equivalence relations, and the category Eq(Dark*) (...)
     
    Export citation  
     
    Bookmark  
  5.  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 complete Σ11 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  6.  44
    Logic by Way of Set Theory. [REVIEW]D. Z. T. - 1969 - Review of Metaphysics 22 (3):568-568.
    This book is designed for an introductory course in logic on the freshman-sophomore level. The approach to logic through set theory is justified by the fundamental importance of set theory in mathematics, and by the fact that most students entering college are acquainted with set theory. The author begins by explaining the basic notions and laws of set theory, and shows how the four standard types of propositions are translated into the notation of set theory. Propositional logic is introduced and (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  2
    Символічна логіка: повернення до витоків. Стаття ІV. Графіки функцій та відношень.Yaroslav Kokhan - 2023 - Multiversum. Philosophical Almanac 2 (2):129-143.
    The paper is the Part IV of the large research, dedicated to both revision of the system of basic logical categories and generalization of modern predicate logic to functional logic. The topic of the paper is consideration of graphs of functions and relations as a derivative and definable category of ultra-Fregean logistics. There are two types of function specification: an operational specification, in which a function is first applied to arguments and then the value of the function is entered as (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8.  3
    The subset relation and 2‐stratified sentences in set theory and class theory.Zachiri McKenzie - 2023 - Mathematical Logic Quarterly 69 (1):77-91.
    Hamkins and Kikuchi (2016, 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. This paper identifies the minimum subsystem of,, that ensures that the definable subset ordering of the universe interprets a complete theory, and classifies the structures that can be realised as the subset relation in a model of this set theory. Extending and refining Hamkins and Kikuchi's result for class theory, a complete extension,, of (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  9.  16
    Relating Topos Theory and Set Theory Via Categories of Classes.Steve Awodey, Alex Simpson & Thomas Streicher - unknown
    We investigate a certain system of intuitionistic set theory from three points of view: an elementary set theory with bounded separation, a topos with distinguished inclusions, and a category of classes with a system of small maps. The three presentations are shown to be equivalent in a strong sense.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  15
    Classifying the Branching Degrees in the Medvedev Lattice of $\Pi^0_1$ Classes.Christopher P. Alfeld - 2008 - Notre Dame Journal of Formal Logic 49 (3):227-243.
    A $\Pi^0_1$ class can be defined as the set of infinite paths through a computable tree. For classes $P$ and $Q$, say that $P$ is Medvedev reducible to $Q$, $P \leq_M Q$, if there is a computably continuous functional mapping $Q$ into $P$. Let $\mathcal{L}_M$ be the lattice of degrees formed by $\Pi^0_1$ subclasses of $2^\omega$ under the Medvedev reducibility. In "Non-branching degrees in the Medvedev lattice of $\Pi \sp{0}\sb{1} classes," I provided a characterization of nonbranching/branching and a classification of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  11.  9
    Infinite Time Decidable Equivalence Relation Theory.Samuel Coskey & Joel David Hamkins - 2011 - Notre Dame Journal of Formal Logic 52 (2):203-228.
    We introduce an analogue of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time generalization of the (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  12.  45
    Strawson on Categories.Charles Sayward - 1978 - Journal of Critical Analysis 7 (3):83-88.
    A type theory constructed with reference to a particular language will associate with each monadic predicate P of that language a class of individuals C(P) of which it is categorically significant to predicate P (or which P spans, for short). The extension of P is a subset of C(P), which is a subset of the language’s universe of discourse. The set C(P) is a category discriminated by the language. The relation 'is spanned by the same predicates as' divides the language’s (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  13.  19
    Relating first-order set theories, toposes and categories of classes.Steve Awodey, Carsten Butz, Alex Simpson & Thomas Streicher - 2014 - Annals of Pure and Applied Logic 165 (2):428-502.
  14.  32
    Ultrafilters, monotone functions and pseudocompactness.M. Hrušák, M. Sanchis & Á Tamariz-Mascarúa - 2005 - Archive for Mathematical Logic 44 (2):131-157.
    In this article we, given a free ultrafilter p on ω, consider the following classes of ultrafilters:(1) T(p) - the set of ultrafilters Rudin-Keisler equivalent to p,(2) S(p)={q ∈ ω*:∃ f ∈ ω ω , strictly increasing, such that q=f β (p)},(3) I(p) - the set of strong Rudin-Blass predecessors of p,(4) R(p) - the set of ultrafilters equivalent to p in the strong Rudin-Blass order,(5) P RB (p) - the set of Rudin-Blass predecessors of p, and(6) P RK (p) (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  81
    Beyond Three Inferential Values.Grzegorz Malinowski - 2009 - Studia Logica 92 (2):203-213.
    The actual introduction of a non-reflexive and non-idempotent q -consequence gave birth to the concept of logical three-valuedness based on the idea of noncomplementary categories of rejection and acceptance. A q -consequence may not have bivalent description, the property claimed by Suszko’s Thesis on logical two-valuedness, ( ST ), of structural logics, i.e. structural consequence operations. Recall that ( ST ) shifts logical values over the set of matrix values and it refers to the division of matrix universe into two (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  50
    Topologies and free constructions.Anna Bucalo & Giuseppe Rosolini - 2013 - Logic and Logical Philosophy 22 (3):327-346.
    The standard presentation of topological spaces relies heavily on (naïve) set theory: a topology consists of a set of subsets of a set (of points). And many of the high-level tools of set theory are required to achieve just the basic results about topological spaces. Concentrating on the mathematical structures, category theory offers the possibility to look synthetically at the structure of continuous transformations between topological spaces addressing specifically how the fundamental notions of point and open come about. As a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  17. Childhood IQ of parents related to characteristics of their offspring: linking the Scottish Mental Survey 1932 to the Midspan Family Study.C. L. Hart, I. J. Deary, G. Davey Smith, M. N. Upton, L. J. Whalley, J. M. Starr, D. J. Hole, V. Wilson & G. C. M. Watt - 2005 - Journal of Biosocial Science 37 (5):623.
    The objective of the study was to investigate the relationship between childhood IQ of parents and characteristics of their adult offspring. It was a prospective family cohort study linked to a mental ability survey of the parents and set in Renfrew and Paisley in Scotland. Participants were 1921-born men and women who took part in the Scottish Mental Survey in 1932 and the Renfrew/Paisley study in the 1970s, and whose offspring took part in the Midspan Family study in 1996. There (...)
    Direct download (12 more)  
     
    Export citation  
     
    Bookmark  
  18.  29
    Grammatical Morphemes and Conceptual Structure in Discourse Processing.Daniel G. Morrow - 1986 - Cognitive Science 10 (4):423-455.
    The present paper analyzes how the semantic and pragmatic functions of closed class categories, or grammatical morphemes (i.e., inflections and function words), organize discourse processing. Grammatical morphemes tend to express a small set of conceptual distinctions that organize a wide range of objects and relations, usually expressed by content or open class words (i.e., nouns and verbs), into situations anchored to a discourse context. Therefore, grammatical morphemes and content words cooperate in guiding the construction of a situation model during discourse (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  25
    Inside the Muchnik degrees II: The degree structures induced by the arithmetical hierarchy of countably continuous functions.K. Higuchi & T. Kihara - 2014 - Annals of Pure and Applied Logic 165 (6):1201-1241.
    It is known that infinitely many Medvedev degrees exist inside the Muchnik degree of any nontrivial Π10 subset of Cantor space. We shed light on the fine structures inside these Muchnik degrees related to learnability and piecewise computability. As for nonempty Π10 subsets of Cantor space, we show the existence of a finite-Δ20-piecewise degree containing infinitely many finite-2-piecewise degrees, and a finite-2-piecewise degree containing infinitely many finite-Δ20-piecewise degrees 2 denotes the difference of two Πn0 sets), whereas the greatest degrees in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  20.  8
    Are Subclasses Parts of Classes?Alex Oliver - 1994 - Analysis 54 (4):215 - 223.
    The fundamental thesis of David Lewis's "Parts of Classes" is that the nonempty subsets of a set are mereological parts of it. This paper shows that Lewis's considerations in favor of this thesis are unpersuasive. First, common speech provides no support. Second, the formal analogy between mereology and the Boolean algebra of sets can be explained without accepting the thesis. Third, it is very doubtful that the thesis is fruitful. Certainly, Lewis's claim that it helps us understand set theory is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  21.  11
    Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space.Qing Zhou - 1996 - Mathematical Logic Quarterly 42 (1):379-409.
    In this paper we study intrinsic notions of “computability” for open and closed subsets of Euclidean space. Here we combine together the two concepts, computability on abstract metric spaces and computability for continuous functions, and delineate the basic properties of computable open and closed sets. The paper concludes with a comprehensive examination of the Effective Riemann Mapping Theorem and related questions.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  22.  9
    Functional dependencies, supervenience, and consequence relations.I. L. Humberstone - 1993 - Journal of Logic, Language and Information 2 (4):309-336.
    An analogy between functional dependencies and implicational formulas of sentential logic has been discussed in the literature. We feel that a somewhat different connexion between dependency theory and sentential logic is suggested by the similarity between Armstrong's axioms for functional dependencies and Tarski's defining conditions for consequence relations, and we pursue aspects of this other analogy here for their theoretical interest. The analogy suggests, for example, a different semantic interpretation of consequence relations: instead of thinking ofB as a consequence of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  23.  24
    Codings of separable compact subsets of the first Baire class.Pandelis Dodos - 2006 - Annals of Pure and Applied Logic 142 (1):425-441.
    Let X be a Polish space and a separable compact subset of the first Baire class on X. For every sequence dense in , the descriptive set-theoretic properties of the set are analyzed. It is shown that if is not first countable, then is -complete. This can also happen even if is a pre-metric compactum of degree at most two, in the sense of S. Todorčević. However, if is of degree exactly two, then is always Borel. A deep result of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  24.  9
    Baire category and nowhere differentiability for feasible functions.J. M. Breutzmann, J. H. Lutz & D. W. Juedes - 2004 - Mathematical Logic Quarterly 50 (4):460.
    A notion of resource-bounded Baire category is developed for the class PC[0,1] of all polynomial-time computable real-valued functions on the unit interval. The meager subsets of PC[0,1] are characterized in terms of resource-bounded Banach-Mazur games. This characterization is used to prove that, in the sense of Baire category, almost every function in PC[0,1] is nowhere differentiable. This is a complexity-theoretic extension of the analogous classical result that Banach proved for the class C[0, 1] in 1931.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  5
    Independence Relations in Abstract Elementary Categories.Mark Kamsma - 2022 - Bulletin of Symbolic Logic 28 (4):531-531.
    In model theory, a branch of mathematical logic, we can classify mathematical structures based on their logical complexity. This yields the so-called stability hierarchy. Independence relations play an important role in this stability hierarchy. An independence relation tells us which subsets of a structure contain information about each other, for example, linear independence in vector spaces yields such a relation.Some important classes in the stability hierarchy are stable, simple, and NSOP $_1$, each being contained in the next. For each of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  3
    Set-Valued Control Approach Applied to a COVID-19 Model with Screening and Saturated Treatment Function.Mohamed Elhia, Lahoucine Boujallal, Meryem Alkama, Omar Balatif & Mostafa Rachik - 2020 - Complexity 2020:1-15.
    The purpose of this paper is modelling and controlling the spread of COVID-19 disease in Morocco. A nonlinear mathematical model with two subclasses of infectious individuals is proposed. The population is divided into five classes, namely, susceptible, exposed, undiagnosed infectious, diagnosed patients, and removed individuals. To reflect the real dynamic of the COVID-19 transmission in Morocco, the real reported data are used for estimating model parameters. Two controls representing screening effort and limited treatment are considered. Based on viability theory and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27. Three overlooked key functional classes for building up minimal synthetic cells.Antoine Danchin - 2021 - Synthetic Biology 6 (1):ysab010.
    Assembly of minimal genomes revealed many genes encoding unknown functions. Three overlooked functional categories account for some of them. Cells are prone to make errors and age. As a first key function, discrimination between proper and changed entities is indispensable. Discrimination requires management of information, an authentic, yet abstract, cur- rency of reality. For example proteins age, sometimes very fast. The cell must identify, then get rid of old proteins without destroying young ones. Implementing discrimination in cells leads to the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28. A taxonomy of cognitive artifacts: Function, information, and categories.Richard Heersmink - 2013 - Review of Philosophy and Psychology 4 (3):465-481.
    The goal of this paper is to develop a systematic taxonomy of cognitive artifacts, i.e., human-made, physical objects that functionally contribute to performing a cognitive task. First, I identify the target domain by conceptualizing the category of cognitive artifacts as a functional kind: a kind of artifact that is defined purely by its function. Next, on the basis of their informational properties, I develop a set of related subcategories in which cognitive artifacts with similar properties can be grouped. In this (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   52 citations  
  29. 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  
  30.  10
    Sets and classes as many.John L. Bell - 2000 - Journal of Philosophical Logic 29 (6):585-601.
    In this paper the view is developed that classes should not be understood as individuals, but, rather, as "classes as many" of individuals. To correlate classes with individuals "labelling" and "colabelling" functions are introduced and sets identified with a certain subdomain of the classes on which the labelling and colabelling functions are mutually inverse. A minimal axiomatization of the resulting system is formulated and some of its extensions are related to various systems of set theory, including nonwellfounded set theories.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  31.  30
    On a Class of Recursively Enumerable Sets.Farzad Didehvar - 1999 - Mathematical Logic Quarterly 45 (4):467-470.
    We define a class of so-called ∑-sets as a natural closure of recursively enumerable sets Wn under the relation “∈” and study its properties.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  8
    The India Face Set: International and Cultural Boundaries Impact Face Impressions and Perceptions of Category Membership.Anjana Lakshmi, Bernd Wittenbrink, Joshua Correll & Debbie S. Ma - 2021 - Frontiers in Psychology 12.
    This paper serves three specific goals. First, it reports the development of an Indian Asian face set, to serve as a free resource for psychological research. Second, it examines whether the use of pre-tested U.S.-specific norms for stimulus selection or weighting may introduce experimental confounds in studies involving non-U.S. face stimuli and/or non-U.S. participants. Specifically, it examines whether subjective impressions of the face stimuli are culturally dependent, and the extent to which these impressions reflect social stereotypes and ingroup favoritism. Third, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  33.  32
    Internal Perception: The Role of Bodily Information in Concepts and Word Mastery.Luigi Pastore & Sara Dellantonio - 2017 - Berlin, Heidelberg: Springer Berlin Heidelberg. Edited by Luigi Pastore.
    Chapter 1 First Person Access to Mental States. Mind Science and Subjective Qualities -/- Abstract. The philosophy of mind as we know it today starts with Ryle. What defines and at the same time differentiates it from the previous tradition of study on mind is the persuasion that any rigorous approach to mental phenomena must conform to the criteria of scientificity applied by the natural sciences, i.e. its investigations and results must be intersubjectively and publicly controllable. In Ryle’s view, philosophy (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  34. Translations between logical systems: a manifesto.Walter A. Carnielli & Itala Ml D'Ottaviano - 1997 - Logique Et Analyse 157:67-81.
    The main objective o f this descriptive paper is to present the general notion of translation between logical systems as studied by the GTAL research group, as well as its main results, questions, problems and indagations. Logical systems here are defined in the most general sense, as sets endowed with consequence relations; translations between logical systems are characterized as maps which preserve consequence relations (that is, as continuous functions between those sets). In this sense, logics together with translations form a (...)
    Direct download  
     
    Export citation  
     
    Bookmark   9 citations  
  35.  15
    New methods in forcing iteration and applications.Rahman Mohammadpour - 2023 - Bulletin of Symbolic Logic 29 (2):300-302.
    The Theme. Strong forcing axioms like Martin’s Maximum give a reasonably satisfactory structural analysis of $H(\omega _2)$. A broad program in modern Set Theory is searching for strong forcing axioms beyond $\omega _1$. In other words, one would like to figure out the structural properties of taller initial segments of the universe. However, the classical techniques of forcing iterations seem unable to bypass the obstacles, as the resulting forcings axioms beyond $\omega _1$ have not thus far been strong enough! However, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36.  50
    On the Modal Logic of Subset and Superset: Tense Logic over Medvedev Frames.Wesley H. Holliday - 2017 - Studia Logica 105 (1):13-35.
    Viewing the language of modal logic as a language for describing directed graphs, a natural type of directed graph to study modally is one where the nodes are sets and the edge relation is the subset or superset relation. A well-known example from the literature on intuitionistic logic is the class of Medvedev frames $\langle W,R\rangle$ where $W$ is the set of nonempty subsets of some nonempty finite set $S$, and $xRy$ iff $x\supseteq y$, or more liberally, where $\langle W,R\rangle$ (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  37. Similar Subclasses.Harvey M. Friedman - unknown
    Reflection, in the sense of [Fr03a] and [Fr03b], is based on the idea that a category of classes has a subclass that is “similar” to the category. Here we present axiomatizations based on the idea that a category of classes that does not form a class has extensionally different subclasses that are “similar”. We present two such similarity principles, which are shown to interpret and be interpretable in certain set theories with large cardinal axioms.
     
    Export citation  
     
    Bookmark   2 citations  
  38.  5
    Modeling Noise-Related Timbre Semantic Categories of Orchestral Instrument Sounds With Audio Features, Pitch Register, and Instrument Family.Lindsey Reymore, Emmanuelle Beauvais-Lacasse, Bennett K. Smith & Stephen McAdams - 2022 - Frontiers in Psychology 13.
    Audio features such as inharmonicity, noisiness, and spectral roll-off have been identified as correlates of “noisy” sounds. However, such features are likely involved in the experience of multiple semantic timbre categories of varied meaning and valence. This paper examines the relationships of stimulus properties and audio features with the semantic timbre categories raspy/grainy/rough, harsh/noisy, and airy/breathy. Participants rated a random subset of 52 stimuli from a set of 156 approximately 2-s orchestral instrument sounds representing varied instrument families, registers, and both (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  24
    Maximal Towers and Ultrafilter Bases in Computability Theory.Steffen Lempp, Joseph S. Miller, André Nies & Mariya I. Soskova - 2023 - Journal of Symbolic Logic 88 (3):1170-1190.
    The tower number ${\mathfrak t}$ and the ultrafilter number $\mathfrak {u}$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $\omega $ and the almost inclusion relation $\subseteq ^*$ between such subsets. We consider analogs of these cardinal characteristics in computability theory.We say that a sequence $(G_n)_{n \in {\mathbb N}}$ of computable sets is a tower if $G_0 = {\mathbb N}$, $G_{n+1} \subseteq ^* G_n$, and $G_n\smallsetminus G_{n+1}$ is infinite for each n. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40.  25
    First-order frames for orthomodular quantum logic.Chrysafis Hartonas - 2016 - Journal of Applied Non-Classical Logics 26 (1):69-80.
    One of the main problems of the orthoframe approach to quantum logic was that orthomodularity could not be captured by any first-order condition. This paper studies an elementary and natural class of orthomodular frames that can work around this limitation. Set-theoretically, the frames we propose form a natural subclass of the orthoframes, where is an irreflexive and symmetric relation on X. More specifically, they are partially-ordered orthoframes with a designated subset. Our frame class contains the canonical orthomodular frame of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  41.  16
    Representation of Functions and Total Antisymmetric Relations in Monadic Third Order Logic.M. Randall Holmes - 2019 - Journal of Philosophical Logic 48 (2):263-278.
    We analyze the representation of binary relations in general, and in particular of functions and of total antisymmetric relations, in monadic third order logic, that is, the simple typed theory of sets with three types. We show that there is no general representation of functions or of total antisymmetric relations in this theory. We present partial representations of functions and of total antisymmetric relations which work for large classes of these relations, and show that there is an adequate representation of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42.  37
    On Transferring Model Theoretic Theorems of $${\mathcal{L}_{{\infty},\omega}}$$ L ∞, ω in the Category of Sets to a Fixed Grothendieck Topos.Nathanael Leedom Ackerman - 2014 - Logica Universalis 8 (3-4):345-391.
    Working in a fixed Grothendieck topos Sh(C, J C ) we generalize \({\mathcal{L}_{{\infty},\omega}}\) to allow our languages and formulas to make explicit reference to Sh(C, J C ). We likewise generalize the notion of model. We then show how to encode these generalized structures by models of a related sentence of \({\mathcal{L}_{{\infty},\omega}}\) in the category of sets and functions. Using this encoding we prove analogs of several results concerning \({\mathcal{L}_{{\infty},\omega}}\) , such as the downward Löwenheim–Skolem theorem, the completeness theorem and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  43. In starvation's shadow: The role of logistics in the strained byzantine-european relations during the first crusade.Gregory D. Bell - 2010 - Byzantion 80:38-71.
    At the time of the First Crusade, numerous factors fed the tension between the Byzantines and those Western Europeans who traveled through imperial lands. However, one of these factors - the supply of food - is often assumed or taken for granted. The purpose of this article is to examine the impact that the acquisition of food had on relations between the purported allies. It seems that during the First Crusade, at a critical juncture in their ongoing social and political (...)
    No categories
     
    Export citation  
     
    Bookmark  
  44.  6
    Finite sets in Quine's new foundations.C. Ward Henson - 1969 - Journal of Symbolic Logic 34 (4):589-596.
    In this paper we consider some axiomatic systems of set theory related to the system NF (New Foundations) of Quine. In particular we discuss the possible relations of cardinality between a finite set x and its subset class SC(x) = {y | y ∩ x} and also between x and its unit set class USC(x) = {{y} | y ε x}. Specker [5] has shown that in NF the cardinal of a finite set x can never be the same as (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  35
    Mathematics is megethology.David K. Lewis - 1993 - Philosophia Mathematica 1 (1):3-23.
    is the second-order theory of the part-whole relation. It can express such hypotheses about the size of Reality as that there are inaccessibly many atoms. Take a non-empty class to have exactly its non-empty subclasses as parts; hence, its singleton subclasses as atomic parts. Then standard set theory becomes the theory of the member-singleton function—better, the theory of all singleton functions—within the framework of megethology. Given inaccessibly many atoms and a specification of which atoms are urelements, a singleton function exists, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   79 citations  
  46.  27
    Computability on Regular Subsets of Euclidean Space.Martin Ziegler - 2002 - Mathematical Logic Quarterly 48 (S1):157-181.
    For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of ‘basic’ ones. They turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ‘weaker/stronger’ relations. This is in contrast to single real numbers and vectors where all ‘reasonable’ notions coincide.
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  40
    Using Hybrid Logic for Coping with Functions in Subset Spaces.Bernhard Heinemann - 2010 - Studia Logica 94 (1):23-45.
    We extend Moss and Parikh’s modal logic for subset spaces by adding, among other things, state-valued and set-valued functions. This is done with the aid of some basic concepts from hybrid logic. We prove the soundness and completeness of the derived logics with regard to the class of all correspondingly enriched subset spaces, and show that these logics are decidable.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  34
    Uniformity, universality, and computability theory.Andrew S. Marks - 2017 - Journal of Mathematical Logic 17 (1):1750003.
    We prove a number of results motivated by global questions of uniformity in computabi- lity theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  49.  14
    Digital simulation of analog computation and church's thesis.Lee A. Rubel - 1989 - Journal of Symbolic Logic 54 (3):1011-1017.
    Church's thesis, that all reasonable definitions of “computability” are equivalent, is not usually thought of in terms of computability by acontinuouscomputer, of which the general-purpose analog computer (GPAC) is a prototype. Here we prove, under a hypothesis of determinism, that the analytic outputs of aC∞GPAC are computable by a digital computer.In [POE, Theorems 5, 6, 7, and 8], Pour-El obtained some related results. (The proof there of Theorem 7 depends on her Theorem 2, for which the proof in [POE] is (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  50. How Category Theory Works.David Ellerman - manuscript
    The purpose of this paper is to show that the dual notions of elements & distinctions are the basic analytical concepts needed to unpack and analyze morphisms, duality, and universal constructions in the Sets, the category of sets and functions. The analysis extends directly to other concrete categories (groups, rings, vector spaces, etc.) where the objects are sets with a certain type of structure and the morphisms are functions that preserve that structure. Then the elements & distinctions-based definitions can be (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000