Results for 'filter‐completeness'

1000+ found
Order:
  1.  48
    A Filter lambda model and the completeness of type assignment.Henk Barendregt, Mario Coppo & Mariangiola Dezani-Ciancaglini - 1983 - Journal of Symbolic Logic 48 (4):931-940.
  2.  19
    Completeness of the Gödel–Löb Provability Logic for the Filter Sequence of Normal Measures.Mohammad Golshani & Reihane Zoghifard - 2024 - Journal of Symbolic Logic 89 (1):163-174.
    Assuming the existence of suitable large cardinals, we show it is consistent that the Provability logic $\mathbf {GL}$ is complete with respect to the filter sequence of normal measures. This result answers a question of Andreas Blass from 1990 and a related question of Beklemishev and Joosten.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  30
    Forcing with filters and complete combinatorics.Claude Laflamme - 1989 - Annals of Pure and Applied Logic 42 (2):125-163.
    We study ultrafilters produced by forcing, obtaining different combinatorics and related Rudin-Keisler ordering; in particular we answer a question of Baumgartner and Taylor regarding tensor products of ultrafilters. Adapting a method of Blass and Mathias, we show that in most cases the combinatorics satisfied by the ultrafilters recapture the forcing notion in the Lévy model.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  4.  39
    Filters on Computable Posets.Steffen Lempp & Carl Mummert - 2006 - Notre Dame Journal of Formal Logic 47 (4):479-485.
    We explore the problem of constructing maximal and unbounded filters on computable posets. We obtain both computability results and reverse mathematics results. A maximal filter is one that does not extend to a larger filter. We show that every computable poset has a \Delta^0_2 maximal filter, and there is a computable poset with no \Pi^0_1 or \Sigma^0_1 maximal filter. There is a computable poset on which every maximal filter is Turing complete. We obtain the reverse mathematics result that the principle (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  10
    Filter pairs and natural extensions of logics.Peter Arndt, Hugo Luiz Mariano & Darllan Conceição Pinto - 2022 - Archive for Mathematical Logic 62 (1):113-145.
    We adjust the notion of finitary filter pair, which was coined for creating and analyzing finitary logics, in such a way that we can treat logics of cardinality $$\kappa $$, where $$\kappa $$ is a regular cardinal. The corresponding new notion is called $$\kappa $$ -filter pair. A filter pair can be seen as a presentation of a logic, and we ask what different $$\kappa $$ -filter pairs give rise to a fixed logic of cardinality $$\kappa $$. To make the (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  6. On the filter of computably enumerable supersets of an r-maximal set.Steffen Lempp, André Nies & D. Reed Solomon - 2001 - Archive for Mathematical Logic 40 (6):415-423.
    We study the filter ℒ*(A) of computably enumerable supersets (modulo finite sets) of an r-maximal set A and show that, for some such set A, the property of being cofinite in ℒ*(A) is still Σ0 3-complete. This implies that for this A, there is no uniformly computably enumerable “tower” of sets exhausting exactly the coinfinite sets in ℒ*(A).
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  7. Breaking the filter bubble: democracy and design.Engin Bozdag & Jeroen van den Hoven - 2015 - Ethics and Information Technology 17 (4):249-265.
    It has been argued that the Internet and social media increase the number of available viewpoints, perspectives, ideas and opinions available, leading to a very diverse pool of information. However, critics have argued that algorithms used by search engines, social networking platforms and other large online intermediaries actually decrease information diversity by forming so-called “filter bubbles”. This may form a serious threat to our democracies. In response to this threat others have developed algorithms and digital tools to combat filter bubbles. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  8.  29
    The constructive completion of the space?Satoru Yoshida - 2005 - Mathematical Logic Quarterly 51 (1):77-82.
    We prove in the framework of Bishop's constructive mathematics that the sequential completion equation image of the space [MATHEMATICAL SCRIPT CAPITAL D] is filter-complete. Then it follows as a corollary that the filter-completeness of [MATHEMATICAL SCRIPT CAPITAL D] is equivalent to the principle BD-ℕ, which can be proved in classical mathematics, Brouwer's intuitionistic mathematics and constructive recursive mathematics of Markov's school, but does not in Bishop's constructive mathematics. We also show that equation image is identical with the filter-completion which was (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  38
    Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
  10.  15
    Review: Andreas Blass, Selective Ultrafilters and Homogeneity; Claude Laflamme, Forcing with Filters and Complete Combinatorics. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
  11.  12
    Games with filters I.Matthew Foreman, Menachem Magidor & Martin Zeman - forthcoming - Journal of Mathematical Logic.
    This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call Welch games. Player II having a winning strategy in the Welch game of length [Formula: see text] on [Formula: see text] is equivalent to weak compactness. Winning the game of length [Formula: see text] is equivalent to [Formula: see text] being measurable. We show that for games of intermediate length [Formula: see text], II winning implies (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  12.  41
    On analytic filters and prefilters.Samy Zafrany - 1990 - Journal of Symbolic Logic 55 (1):315-322.
    We show that every analytic filter is generated by a Π 0 2 prefilter, every Σ 0 2 filter is generated by a Π 0 1 prefilter, and if $P \subseteq \mathscr{P}(\omega)$ is a Σ 0 2 prefilter then the filter generated by it is also Σ 0 2 . The last result is unique for the Borel classes, as there is a Π 0 2 -complete prefilter P such that the filter generated by it is Σ 1 1 -complete. (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  13.  32
    A hierarchy of filters smaller than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $CF_\kappa\lambda-->$\end{document}. [REVIEW]Yoshihiro Abe - 1997 - Archive for Mathematical Logic 36 (6):385-397.
    This research was partially supported by Grant-in-Aid for Scientific Research (No. 06640178 and No. 06640336), Ministry of Education, Science and Culture of Japan Mathematics Subject Classification: 03E05 --> Abstract. Following Carr's study on diagonal operations and normal filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} in [2], several weakenings of normality have been investigated. One of them is to consider normal filters without \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\kappa$\end{document}-completeness, for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  14.  17
    Finding generic filters by playing games.Heike Mildenberger - 2010 - Archive for Mathematical Logic 49 (1):91-118.
    We give some restrictions for the search for a model of the club principle with no Souslin trees. We show that ${\diamondsuit(2^\omega, [\omega]^\omega}$ , is almost constant on) together with CH and “all Aronszajn trees are special” is consistent relative to ZFC. This implies the analogous result for a double weakening of the club principle.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  23
    Prikry forcing and tree Prikry forcing of various filters.Tom Benhamou - 2019 - Archive for Mathematical Logic 58 (7-8):787-817.
    In this paper, we answer a question asked in Koepke et al. regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  16.  12
    A Note on Boolean Algebras with Few Partitions Modulo some Filter.Markus Huberich - 1996 - Mathematical Logic Quarterly 42 (1):172-174.
    We show that for every uncountable regular κ and every κ-complete Boolean algebra B of density ≤ κ there is a filter F ⊆ B such that the number of partitions of length < modulo κF is ≤2<κ. We apply this to Boolean algebras of the form P/I, where I is a κ-complete κ-dense ideal on X.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  25
    Modal Aggregation and the Theory of Paraconsistent Filters.Peter Apostoli - 1996 - Mathematical Logic Quarterly 42 (1):175-190.
    This paper articulates the structure of a two species of weakly aggregative necessity in a common idiom, neighbourhood semantics, using the notion of a k-filter of propositions. A k-filter on a non-empty set I is a collection of subsets of I which contains I, is closed under supersets on I, and contains ∪{Xi ≤ Xj : 0 ≤ i < j ≤ k} whenever it contains the subsets X0,…, Xk. The mathematical content of the proof that weakly aggregative modal logic (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  7
    A novel network-based paragraph filtering technique for legal document similarity analysis.Mayur Makawana & Rupa G. Mehta - forthcoming - Artificial Intelligence and Law:1-23.
    The common law system is a legal system that values precedent, or previous court decisions, in the resolution of current cases. As the availability of legal documents in digital form has increased, it has become more difficult for legal professionals to manually identify relevant past cases due to the vast amount of data. Researchers have developed automated systems for determining the similarity between legal documents to address this issue. Our research explores various representations of a legal document and discusses a (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19.  18
    Dense subtrees in complete Boolean algebras.Bernhard König - 2006 - Mathematical Logic Quarterly 52 (3):283-287.
    We characterize complete Boolean algebras with dense subtrees. The main results show that a complete Boolean algebra contains a dense tree if its generic filter collapses the algebra's density to its distributivity number and the reverse holds for homogeneous algebras.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  39
    The U.S. in the U.S.S.R.: American Literature through the Filter of Recent Soviet Publishing and Criticism.Maurice Friedberg - 1976 - Critical Inquiry 2 (3):519-583.
    The advent of the post-Stalin "thaw," particularly the period after 1956, was marked by a spectacular expansion in the publishing of translated Western writing and also, on occasion, of editions in the original languages: the virtual ban on import of Western books was, as of 1975, never relaxed. The more permissive political atmosphere favored the publication of a vastly larger variety of Western authors and titles and provision for the Soviet public of much larger quantities of such books in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  21.  83
    Nonassociative substructural logics and their semilinear extensions: Axiomatization and completeness properties: Nonassociative substructural logics.Petr Cintula, Rostislav Horčík & Carles Noguera - 2013 - Review of Symbolic Logic 6 (3):394-423.
    Substructural logics extending the full Lambek calculus FL have largely benefited from a systematical algebraic approach based on the study of their algebraic counterparts: residuated lattices. Recently, a nonassociative generalization of FL has been studied by Galatos and Ono as the logic of lattice-ordered residuated unital groupoids. This paper is based on an alternative Hilbert-style presentation for SL which is almost MP -based. This presentation is then used to obtain, in a uniform way applicable to most substructural logics, a form (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22.  9
    A practical definition of character.Raymond O. Filter - 1922 - Psychological Review 29 (4):319-324.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  53
    A psychologist's prayer.Raymond O. Filter - 1944 - Journal of Philosophy 41 (4):97-103.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  24.  17
    Jonathan I. Israel: Democratic Enlightenment: Philosophy, Revolution, and Human Rights 1750-1790. [REVIEW]Patrick Filter - 2014 - Philosophia: International Journal of Philosophy (Philippine e-journal) 15 (1):121-125.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  25. Jonathan I. Israel: Radical Enlightenment: Philosophy and the Making of Modernity, 1650-1750. [REVIEW]Patrick Filter - 2009 - Philosophia 37 (2).
    his is a book to broaden the mind. It brings the reader into a world only vaguely imaginable and richly enlightens it with extraordinary attention to interesting historical details. It is beautifully written and endlessly interesting.
     
    Export citation  
     
    Bookmark  
  26. Siep Stuurman: Francois Poullain de la Barre and the Invention of Modern Equality. [REVIEW]Patrick Filter - 2010 - Philosophia 38 (2).
     
    Export citation  
     
    Bookmark  
  27.  17
    Complete Issue.Complete Issue - 2023 - Architecture Philosophy 6 (1/2).
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  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  
  29.  17
    Complete Issue.Complete Issue - 2022 - Architecture Philosophy 5 (2).
    Direct download  
     
    Export citation  
     
    Bookmark  
  30. Er caianiello1.Completely Solved - 1986 - In G. Palm & A. Aertsen (eds.), Brain Theory. Springer. pp. 147.
    No categories
     
    Export citation  
     
    Bookmark  
  31. Godabarisha Mishra.Complete Works ofSwami Vivekananda - 2007 - In Rekha Jhanji (ed.), The Philosophy of Vivekananda. Aryan Books International.
    No categories
     
    Export citation  
     
    Bookmark  
  32. Table Des matieres editorial preface 3.Jair Minoro Abe, Curry Algebras Pt, Paraconsistent Logic, Newton Ca da Costa, Otavio Bueno, Jacek Pasniczek, Beyond Consistent, Complete Possible Worlds, Vm Popov & Inverse Negation - 1998 - Logique Et Analyse 41:1.
    No categories
     
    Export citation  
     
    Bookmark  
  33.  8
    Many Normal Measures.Shimon Garti - 2014 - Notre Dame Journal of Formal Logic 55 (3):349-357.
    We characterize the situation of having at least $^{+}$-many normal ultrafilters on a measurable cardinal $\kappa$. We also show that if $\kappa$ is a compact cardinal, then $\kappa$ carries $^{+}$-many $\kappa$-complete ultrafilters, each of which extends the club filter on $\kappa$.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  34.  21
    Logische Gültigkeit umgangssprachlicher Argumente Zur Logik der Umgangssprache.Timm Lampert - 2017 - Zeitschrift für Philosophische Forschung 71 (1):117-122.
    This paper discusses a definition of logical validity of arguments that is provided by Christoph Schamberger in his book Logik der Umgangssprache (2016). The paper identifies some problems of the given definition. It argues that any definition reducing the logical validity of ordinary arguments to the logical validity of their formalization does not meet the criteria of non-circularity, unambiguousness, correctness and completeness. Finally, the paper shows that Schamberger’s filter logic brings about that his definition does also not meet the standards (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  35. Preemption effects in visual search: Evidence for low-level grouping.Ronald A. Rensink & James T. Enns - 1995 - Psychological Review 102 (1):101-130.
    Experiments are presented showing that visual search for Mueller-Lyer (ML) stimuli is based on complete configurations, rather than component segments. Segments easily detected in isolation were difficult to detect when embedded in a configuration, indicating preemption by low-level groups. This preemption—which caused stimulus components to become inaccessible to rapid search—was an all-or-nothing effect, and so could serve as a powerful test of grouping. It is shown that these effects are unlikely to be due to blurring by simple spatial filters at (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   33 citations  
  36. A New Negentropic Subject: Reviewing Michel Serres' Biogea.A. Staley Groves - 2012 - Continent 2 (2):155-158.
    continent. 2.2 (2012): 155–158 Michel Serres. Biogea . Trans. Randolph Burks. Minneapolis: Univocal Publishing. 2012. 200 pp. | ISBN 9781937561086 | $22.95 Conveying to potential readers the significance of a book puts me at risk of glad handing. It’s not in my interest to laud the undeserving, especially on the pages of this journal. This is not a sales pitch, but rather an affirmation of a necessary work on very troubled terms: human, earth, nature, and the problematic world we made. (...)
     
    Export citation  
     
    Bookmark  
  37.  28
    Principles of Visual Attention: Linking Mind and Brain.Claus Bundesen & Thomas Habekost - 2008 - Oxford University Press Oxford.
    The nature of attention is one of the oldest and most central problems in psychology. A huge amount of research has been produced on this subject in the last half century, especially on attention in the visual modality, but a general explanation has remained elusive. Many still view attention research as a field that is fundamentally fragmented. This book takes a different perspective and presents a unified theory of visual attention: the TVA model. The TVA model explains the many aspects (...)
    Direct download  
     
    Export citation  
     
    Bookmark   11 citations  
  38.  8
    Restriction in Program Algebra.Marcel Jackson & Tim Stokes - 2023 - Logic Journal of the IGPL 31 (5):926-960.
    We provide complete classifications of algebras of partial maps for a significant swathe of combinations of operations not previously classified. Our focus is the many subsidiary operations that arise in recent considerations of the ‘override’ and ‘update’ operations arising in specification languages. These other operations turn out to have an older pedigree: domain restriction, set subtraction and intersection. All signatures considered include domain restriction, at least as a term. Combinations of the operations are classified and given complete axiomatizations with and (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  7
    Promiscuous knowledge: information, image, and other truth games in history.Kenneth Cmiel - 2020 - Chicago: University of Chicago Press. Edited by John Durham Peters.
    Histories of communication are still relatively rare birds, but this one is distinctive on several grounds. The two authors are/were undisputed giants in the field. Ken Cmiel, the originator of the book, still unfinished when he suddenly died in 2006, was a cultural historian of communication; his best friend, John Peters, is one of the world leaders in the intellectual history of communication. In completing that unfinished manuscript, Peters has performed astonishing prestidigitation here in creating an effective hybrid: he retains (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  40. A hyperintensional approach to positive epistemic possibility.Niccolò Rossi & Aybüke Özgün - 2023 - Synthese 202 (44):1-29.
    The received view says that possibility is the dual of necessity: a proposition is (metaphysically, logically, epistemically etc.) possible iff it is not the case that its negation is (metaphysically, logically, epistemically etc., respectively) necessary. This reading is usually taken for granted by modal logicians and indeed seems plausible when dealing with logical or metaphysical possibility. But what about epistemic possibility? We argue that the dual definition of epistemic possibility in terms of epistemic necessity generates tension when reasoning about non-idealized (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  41.  33
    Pseudomonadic Algebras as Algebraic Models of Doxastic Modal Logic.Nick Bezhanishvili - 2002 - Mathematical Logic Quarterly 48 (4):624-636.
    We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudomonadic algebras serve as algebraic models of doxastic modal system KD45. The main results of the paper are: Characterization of subdirectly irreducible and simple pseudomonadic algebras, as well as Tokarz's proper filter algebras; Ordertopological representation of pseudomonadic algebras; Complete description of the lattice of subvarieties of the variety of pseudomonadic algebras.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  42.  73
    Infinitary combinatorics and modal logic.Andreas Blass - 1990 - Journal of Symbolic Logic 55 (2):761-778.
    We show that the modal propositional logic G, originally introduced to describe the modality "it is provable that", is also sound for various interpretations using filters on ordinal numbers, for example the end-segment filters, the club filters, or the ineffable filters. We also prove that G is complete for the interpretation using end-segment filters. In the case of club filters, we show that G is complete if Jensen's principle □ κ holds for all $\kappa ; on the other hand, it (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  43.  29
    Scientific Method in Ptolemy's Harmonics (review).Heike Sefrin-Weis - 2003 - Journal of the History of Philosophy 41 (1):123-124.
    In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Philosophy 41.1 (2003) 123-124 [Access article in PDF] Andrew Barker. Scientific Method in Ptolemy's Harmonics. New York: Cambridge University Press, 2001. Pp. viii + 281. Cloth, $69.95. Ptolemy's Harmonics is an important source not only for the history of music, but also for the history and philosophy of science. Two recent monographs, by J. Solomon, and A. Barker, now provide a basis for a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  44.  24
    Reverse mathematics of mf spaces.Carl Mummert - 2006 - Journal of Mathematical Logic 6 (2):203-232.
    This paper gives a formalization of general topology in second-order arithmetic using countably based MF spaces. This formalization is used to study the reverse mathematics of general topology. For each poset P we let MF denote the set of maximal filters on P endowed with the topology generated by {Np | p ∈ P}, where Np = {F ∈ MF | p ∈ F}. We define a countably based MF space to be a space of the form MF for some (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  45.  61
    New Philosophy for New Media.Mark B. N. Hansen - 2004 - MIT Press.
    In New Philosophy for New Media, Mark Hansen defines the image in digital art in terms that go beyond the merely visual. Arguing that the "digital image" encompasses the entire process by which information is made perceivable, he places the body in a privileged position -- as the agent that filters information in order to create images. By doing so, he counters prevailing notions of technological transcendence and argues for the indispensability of the human in the digital era.Hansen examines new (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   29 citations  
  46.  53
    Compatibility operators in abstract algebraic logic.Hugo Albuquerque, Josep Maria Font & Ramon Jansana - 2016 - Journal of Symbolic Logic 81 (2):417-462.
    This paper presents a unified framework that explains and extends the already successful applications of the Leibniz operator, the Suszko operator, and the Tarski operator in recent developments in abstract algebraic logic. To this end, we refine Czelakowski’s notion of an S-compatibility operator, and introduce the notion of coherent family of S-compatibility operators, for a sentential logic S. The notion of coherence is a restricted property of commutativity with inverse images by surjective homomorphisms, which is satisfied by both the Leibniz (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  47. 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  
  48.  55
    Dewey: A beginner's guide (review).Raymond D. Boisvert - 2010 - Education and Culture 26 (2):94-98.
    John Dewey's early exposure to Hegel left a "permanent deposit" on his thinking. Dewey's Hegelian side does not emerge in the usual sense of someone predicting the march of Spirit through history. Rather it is as the complete philosopher seeking, above all else, to leave nothing out. Such a philosopher criticized reified abstractions, reinstated the centrality of relations, emphasized the importance of thinking ideas together with their history, and insisted on the interpenetration of individual and social. This Hegelian inheritance, when (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  23
    Uncountable superperfect forcing and minimality.Elizabeth Theta Brown & Marcia J. Groszek - 2006 - Annals of Pure and Applied Logic 144 (1-3):73-82.
    Uncountable superperfect forcing is tree forcing on regular uncountable cardinals κ with κ<κ=κ, using trees in which the heights of nodes that split along any branch in the tree form a club set, and such that any node in the tree with more than one immediate extension has measure-one-many extensions, where the measure is relative to some κ-complete, nonprincipal normal filter F. This forcing adds a generic of minimal degree if and only if F is κ-saturated.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  50. Emotions and Digital Well-being. The rationalistic bias of social media design in online deliberations.Lavinia Marin & Sabine Roeser - 2020 - In Christopher Burr & Luciano Floridi (eds.), Ethics of digital well-being: a multidisciplinary approach. Springer. pp. 139-150.
    In this chapter we argue that emotions are mediated in an incomplete way in online social media because of the heavy reliance on textual messages which fosters a rationalistic bias and an inclination towards less nuanced emotional expressions. This incompleteness can happen either by obscuring emotions, showing less than the original intensity, misinterpreting emotions, or eliciting emotions without feedback and context. Online interactions and deliberations tend to contribute rather than overcome stalemates and informational bubbles, partially due to prevalence of anti-social (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 1000