Results for 'Matan Flum'

78 found
Order:
  1.  9
    The ethnocratic shikun: housing discourse in support of nation-building.Matan Flum - forthcoming - Critical Discourse Studies.
    This research critically analyses the Israeli housing block (‘shikun’) discourse, as presented in cultural representations during 1948–1961, and its contribution to the evolution of the Israeli-Palestinian conflict. The study argues that the discursive exclusion of the shikun from Israel's socio-political history of planning and development is a central part of Israel's ethnocracy and has an essential role in exacerbating the conflict. It maintains that the shikun's exclusion is a reduction of its consequences, namely the Mizrahi population's dispersion through the shikun, (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  40
    Developmental changes within the core of artifact concepts.Adee Matan & Susan Carey - 2001 - Cognition 78 (1):1-26.
  3.  7
    Jerome Malitz. Universal classes in infinitary languages. Duke mathematical journal, vol. 36 , pp. 621–630.Jörg Flum - 1974 - Journal of Symbolic Logic 39 (2):336.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  7
    Modernity and Crisis in the Thought of Michel Foucault: The Totality of Reason.Matan Oram - 2016 - New York: Routledge.
    This book addresses Foucault’s characterizations of the Enlightenment, asking whether the developmental history of the modern conception of knowledge--from the Renaissance to the Enlightenment--warrants the conclusion he draws. From the perspective of a critical evaluation of Foucault's thesis on "the crisis of modernity," the book examines whether Foucault, the philosophical and social critic, truly belongs to those intellectual trends known as a "deconstruction" and "post-modernism" that advocate a wholesale rejection of the project of modernity, demonstrating how a classification of this (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  5.  5
    Distinguishing absence of awareness from awareness of absence.Matan Mazor & Stephen M. Fleming - 2020 - Philosophy and the Mind Sciences 1 (II).
    Contrasting brain states when subjects are aware compared to unaware of a presented stimulus has allowed researchers to isolate candidate neural correlates of consciousness. Here we propose that an important next step in this research program is to investigate, perhaps paradoxically, brain states that covary with reports of absences of awareness. Specifically, we propose that in order to distinguish content-specific and content-invariant neural correlates of consciousness, a distinction needs to be made between the neural correlates of awareness of stimulus absence, (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  6.  83
    The Scientific Study of Consciousness Cannot and Should Not Be Morally Neutral.Matan Mazor, Simon Brown, Anna Ciaunica, Athena Demertzi, Johannes Fahrenfort, Nathan Faivre, Jolien C. Francken, Dominique Lamy, Bigna Lenggenhager, Michael Moutoussis, Marie-Christine Nizzi, Roy Salomon, David Soto, Timo Stein & Nitzan Lubianiker - 2023 - Perspectives on Psychological Science 18 (3):535-543.
    A target question for the scientific study of consciousness is how dimensions of consciousness, such as the ability to feel pain and pleasure or reflect on one’s own experience, vary in different states and animal species. Considering the tight link between consciousness and moral status, answers to these questions have implications for law and ethics. Here we point out that given this link, the scientific community studying consciousness may face implicit pressure to carry out certain research programs or interpret results (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7. Descriptive complexity theories.Joerg Flum - 2003 - Theoria 18 (1):47-58.
    In this article we review some of the main results of descriptive complexity theory in order to make the reader familiar with the nature of the investigations in this area. We start by presenting the characterization of automata recognizable languages by monadic second-order logic. Afterwards we explain the characterization of various logics by fIxed-point logics. We assume familiarity with logic but try to keep knowledge of complexity theory to aminimum.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  8.  28
    Pain, Suffering, and Euthanasia in Insects.Matan Shelomi - 2021 - International Journal of Applied Philosophy 35 (1):31-43.
    While unnecessarily killing or injuring an insect is arguably wrong, euthanasia of an accidentally injured insect raises anew issues of whether insects can experience pain. The question takes renewed significance due to increasing insect farming for food and feed and concerns over farmed insect welfare. For euthanasia of a damaged insect to be justifiable, the damage must be sensed as a noxious stimulus (nociception) that the insect consciously experiences as pain. This pain must then lead to suffering or frustrated desire, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  11
    Studying Dynamics of Human Information Gathering Behaviors Using Social Robots.Matan Eshed, Matan Epstein, Ada H. Zohar & Goren Gordon - 2021 - Frontiers in Psychology 12.
    A novel social interaction is a dynamic process, in which participants adapt to, react to and engage with their social partners. To facilitate such interactions, people gather information relating to the social context and structure of the situation. The current study aimed to deepen the understanding of the psychological determinants of behavior in a novel social interaction. Three social robots and the participant interacted non-verbally according to a pre-programmed “relationship matrix” that dictated who favored whom. Participants' gaze was tracked during (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  10.  60
    Pseudo-finite homogeneity and saturation.Jörg Flum & Martin Ziegler - 1999 - Journal of Symbolic Logic 64 (4):1689-1699.
    When analyzing database query languages a roperty, of theories, the pseudo-finite homogeneity property, has been introduced and applied (cf. [3]). We show that a stable theory has the pseudo-finite homogeneity property just in case its expressive power for finite states is bounded. Moreover, we introduce the corresponding pseudo-finite saturation property and show that a theory fails to have the finite cover property if and only if it has the pseudo-finite saturation property.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark  
  11.  61
    Relations between innate endowments, cognitive development, domain specificity, and a taxonomy-creator.Adee Matan & Sidney Strauss - 1998 - Behavioral and Brain Sciences 21 (4):584-584.
    Atran proposes that humans have a unique, innate, domain-specific tendency to create taxonomies of biological kinds. We show that: (1) in ontogenesis, children develop a notion Atran claims to be innate; (2) what Atran claims is unique to biological kinds may be found in artifact kinds; and (3) although Atran proposes a domain-specific mental construct for biological rank, it can be explained in domain- general terms.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12. Mad Scientist: The Unique Case of a Published Delusion.Matan Shelomi - 2013 - Science and Engineering Ethics 19 (2):381-388.
    In 1951, entomologist Jay Traver published in the Proceedings of the Entomological Society of Washington her personal experiences with a mite infestation of her scalp that resisted all treatment and was undetectable to anyone other than herself. Traver is recognized as having suffered from Delusory Parasitosis: her paper shows her to be a textbook case of the condition. The Traver paper is unique in the scientific literature in that its conclusions may be based on data that was unconsciously fabricated by (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  13.  6
    The ethos of the Enlightenment and the discontents of modernity.Matan Oram - 2022 - New York, NY: Routledge.
    This book probes the sources and nature of the 'discontents of modernity'. It proposes a new approach to the philosophic-critical discourse on modernity. The Enlightenment is widely understood to be the foundational moment of modernity. Yet despite its appeal to reason as the ultimate ground of its authority and legitimacy, the Enlightenment has had multiple historical manifestations and, therefore, can hardly be said to be a homogenous phenomenon. The present work seeks to identify a unitive element that allows us to (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  6
    Chit-chat: a series of television talks.Paulias Matane - 1991 - Mount Waverley, Vic.: Dellasta Pacific. Edited by Marjorie Presley.
  15.  8
    Dialogue and Communicative Action – Buber’s Philosophy of Dialogue and Habermas’s Communicative Rationality.Matan Oram - 2012 - Naharaim 6 (2):269-285.
  16. The theopolitical foundations of Strauss's criticism of modernity.Matan Oram - 2007 - Naharaim - Zeitschrift Für Deutsch-Jüdische Literatur Und Kulturgeschichte 1 (1).
     
    Export citation  
     
    Bookmark  
  17.  5
    The Theopolitical Foundations of Strauss's Criticism of Modernity.Matan Oram - 2007 - Naharaim 1 (1):75-94.
    I Philosophers and Prophets The tradition of the Falasifa tends to refute Plato's ideal of the “philosopher-king”, in which the philosopher is distinguished as the highest human type. In contrast to the philosopher, whose knowledge is incomplete and indirect, the prophet, through revelation, attains profound knowledge and truth. According to the Falasifa version of Platonic politics, the prophet, who represents the highest form of human wisdom conditioned by divine providence, is a founder of political community and a lawgiver.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  29
    Mistaking imagination for reality: Congruent mental imagery leads to more liberal perceptual detection.Nadine Dijkstra, Matan Mazor, Peter Kok & Stephen Fleming - 2021 - Cognition 212 (C):104719.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  19.  45
    Quantifiers and congruence closure.Jörg Flum, Matthias Schiehlen & Jouko Väänänen - 1999 - Studia Logica 62 (3):315-340.
    We prove some results about the limitations of the expressive power of quantifiers on finite structures. We define the concept of a bounded quantifier and prove that every relativizing quantifier which is bounded is already first-order definable (Theorem 3.8). We weaken the concept of congruence closed (see [6]) to weakly congruence closed by restricting to congruence relations where all classes have the same size. Adapting the concept of a thin quantifier (Caicedo [1]) to the framework of finite structures, we define (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  20. On topological spaces equivalent to ordinals.Jörg Flum & Juan Carlos Martinez - 1988 - Journal of Symbolic Logic 53 (3):785-795.
    Let L be one of the topological languages L t , (L ∞ω ) t and (L κω ) t . We characterize the topological spaces which are models of the L-theory of the class of ordinals equipped with the order topology. The results show that the role played in classical model theory by the property of being well-ordered is taken over in the topological context by the property of being locally compact and scattered.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  21.  54
    A remark on infinitary languages.Jörg Flum - 1971 - Journal of Symbolic Logic 36 (3):461-462.
  22.  59
    On fixed-point logic with counting.Jörg Flum & Martin Grohe - 2000 - Journal of Symbolic Logic 65 (2):777-787.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  23.  3
    REVIEWS-Parameterized complexity theory.J. Flum, M. Grohe & Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
  24.  24
    Review: R. G. Downey, M. R. Fellows, Parameterized Complexity. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
  25.  45
    Strong isomorphism reductions in complexity theory.Sam Buss, Yijia Chen, Jörg Flum, Sy-David Friedman & Moritz Müller - 2011 - Journal of Symbolic Logic 76 (4):1381-1402.
    We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  6
    The Effects of Reducing Preparation Time on the Execution of Intentionally Curved Trajectories: Optimization and Geometrical Analysis.Dovrat Kohen, Matan Karklinsky, Yaron Meirovitch, Tamar Flash & Lior Shmuelof - 2017 - Frontiers in Human Neuroscience 11.
  27.  15
    Losses as ecological guides: Minor losses lead to maximization and not to avoidance.Eldad Yechiam, Matan Retzer, Ariel Telpaz & Guy Hochman - 2015 - Cognition 139 (C):10-17.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  22
    Safe online ethical code for and by the “net generation”: themes emerging from school students’ wisdom of the crowd.Amit Lavie Dinur, Matan Aharoni & Yuval Karniel - 2021 - Journal of Information, Communication and Ethics in Society 19 (1):129-145.
    Purpose Children are becoming heavy users of communication and information technologies from an early age. These technologies carry risks to which children may be exposed. In collaboration with the Israel Ministry of Education, the authors launched a week-long safe online awareness program for school children in 257 elementary and middle schools in Israel. Each class independently composed a safe and ethical code of online behavior following two classroom debate sessions. The purpose of this study was to analyze these codes and (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  10
    An Extension of the Lemma of Rasiowa and Sikorski.Jörg Flum - 1998 - Mathematical Logic Quarterly 44 (4):509-514.
    We prove an extension of the Lemma of Rasiowa and Sikorski and give some applications. Moreover, we analyze the relationship to corresponding results on the omission of types.
    Direct download  
     
    Export citation  
     
    Bookmark  
  30.  1
    Die Titelbilder der 'Bible historiale'. Zwischen Standardisierung und Personalisierung.Thomas Flum - 2013 - Das Mittelalter 18 (1):62-86.
    In the last decade of the 13th century Guyart Desmoulins composed a French-language version of the Bible, the ‘Bible historiale’, based on the ‘Historia Scholastica’. In the course of the 14th century this was completed to become a full bible, and a pictorial repertoire emerged that corresponded to the work’s novel requirements. Soaring demand and the efficient production on the part of the Paris workshops resulted in a standardization of some of the pictorial elements in the times of John the (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  31.  9
    χ‐Local Operations for Topological Structures.J. Flum & J. C. Martinez - 1985 - Mathematical Logic Quarterly 31 (21‐23):345-349.
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  25
    χ-Local Operations for Topological Structures.J. Flum & J. C. Martinez - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (21-23):345-349.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  33.  31
    L(q)-preservation theorems.Jörg Flum - 1975 - Journal of Symbolic Logic 40 (3):410-418.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  34. Maximale monadische Logiken.Jörg Flum - 1985 - Archive for Mathematical Logic 25 (1):145-152.
    No categories
     
    Export citation  
     
    Bookmark  
  35.  6
    Model Theory of Topological Structures.Jörg Flum - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 297--312.
    Direct download  
     
    Export citation  
     
    Bookmark  
  36.  41
    On the complexity of Gödel's proof predicate.Yijia Chen & Jörg Flum - 2010 - Journal of Symbolic Logic 75 (1):239-254.
    The undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of valid sentences of first-order logic. Some valid sentences can only have quite long proofs. How hard is it to prove such "hard" valid sentences? The polynomial time tractability of this problem would imply the fixed-parameter tractability of the parameterized problem that, given a natural number n in unary as input and a first-order sentence φ as parameter, asks whether φ has a (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  37.  22
    The parameterized complexity of maximality and minimality problems.Yijia Chen & Jörg Flum - 2008 - Annals of Pure and Applied Logic 151 (1):22-61.
    Many parameterized problems ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality problem asking for a solution of size k maximal with respect to set inclusion. As our results show, many maximality problems increase the parameterized complexity, while “in terms of the W-hierarchy” minimality problems do not increase the complexity. We also address the corresponding construction, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38.  51
    Bounded fixed-parameter tractability and reducibility.Rod Downey, Jörg Flum, Martin Grohe & Mark Weyer - 2007 - Annals of Pure and Applied Logic 148 (1):1-19.
    We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some family . For every family of functions, this yields a notion of -fixed-parameter tractability. If is the class of all polynomially bounded functions, then -fixed-parameter tractability coincides with polynomial time decidability and if is the class of all computable functions, -fixed-parameter tractability coincides with the standard notion of fixed-parameter tractability. There are interesting choices (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  39.  86
    An Analysis of the W -Hierarchy.Yijia Chen, Jörg Flum & Martin Grohe - 2007 - Journal of Symbolic Logic 72 (2):513 - 534.
    We observe that the W*-hierarchy, a variant (introduced by Downey, Fellows, and Taylor [7]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wise, but just as a whole hierarchy. More precisely, we prove that W[t] ⊆ W*[t] ⊆ W[2t − 2] for each t ≥ 2. It was known before that W[1] = W*[1] and W[2] = W*[2]. Our second main result is a new logical characterization of the W*-hierarchy in terms of "Fagin-definable problems." As a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  40. Einfuhrung in die mathematische Logik, 3.H. -D. Ebbinghaus, J. Flum & W. Thomas - 1994 - Studia Logica 53 (3):459-459.
  41.  7
    Forbidden Induced Subgraphs and the Łoś–Tarski Theorem.Yijia Chen & Jörg Flum - 2024 - Journal of Symbolic Logic 89 (2):516-548.
    Let $\mathscr {C}$ be a class of finite and infinite graphs that is closed under induced subgraphs. The well-known Łoś–Tarski Theorem from classical model theory implies that $\mathscr {C}$ is definable in first-order logic by a sentence $\varphi $ if and only if $\mathscr {C}$ has a finite set of forbidden induced finite subgraphs. This result provides a powerful tool to show nontrivial characterizations of graphs of small vertex cover, of bounded tree-depth, of bounded shrub-depth, etc. in terms of forbidden (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  16
    On Optimal Inverters.Yijia Chen & Jörg Flum - 2014 - Bulletin of Symbolic Logic 20 (1):1-23.
    Leonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the nonuniform Exponential Time Hypothesis. We present all these applications here. Even though a simple diagonalization yields Levin’s result, we believe that it is worthwhile to be aware of the explicit result. The (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  43.  50
    Consistency, optimality, and incompleteness.Yijia Chen, Jörg Flum & Moritz Müller - 2013 - Annals of Pure and Applied Logic 164 (12):1224-1235.
    Assume that the problem P0 is not solvable in polynomial time. Let T be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT} as the minimal extension of T proving for some algorithm that it decides P0 as fast as any algorithm B with the property that T proves that B decides P0. Here, ConT claims the consistency of T. As a byproduct, we obtain a version of Gödelʼs Second Incompleteness Theorem. Moreover, we characterize problems (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  44.  14
    Hard instances of algorithms and proof systems.Yijia Chen, Jörg Flum & Moritz Müller - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 118--128.
  45.  33
    R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xv + 533 pp. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
  46.  5
    Review: Jerome Malitz, Universal Classes in Infinitary Languages. [REVIEW]Jorg Flum - 1974 - Journal of Symbolic Logic 39 (2):336-336.
  47.  26
    “But not the music”: psychopathic traits and difficulties recognising and resonating with the emotion in music.R. C. Plate, C. Jones, S. Zhao, M. W. Flum, J. Steinberg, G. Daley, N. Corbett, C. Neumann & R. Waller - 2023 - Cognition and Emotion 37 (4):748-762.
    Recognising and responding appropriately to emotions is critical to adaptive psychological functioning. Psychopathic traits (e.g. callous, manipulative, impulsive, antisocial) are related to differences in recognition and response when emotion is conveyed through facial expressions and language. Use of emotional music stimuli represents a promising approach to improve our understanding of the specific emotion processing difficulties underlying psychopathic traits because it decouples recognition of emotion from cues directly conveyed by other people (e.g. facial signals). In Experiment 1, participants listened to clips (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  5
    J. Flum and M. Grohe, Parameterized complexity theory.Thomas Schwentick - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
  49.  42
    Ana Matan, Teorija političke legitimnosti Johna Rawlsa.Nebojša Zelić - 2011 - Prolegomena 10 (2):319-323.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50. Matan Torah min ha-shamayim ke-ʻiḳar ba-Yahadut, u-meḳomo shel ha-ʻiḳar ha-zeh be-tokh sheʻar ʻiḳre ha-Yahadut.Yitsḥaḳ Refaʼel ʻEtsyon - 1976
     
    Export citation  
     
    Bookmark  
1 — 50 / 78