Results for 'Weak canonical model'

993 found
Order:
  1.  7
    Weak canonical bases in nsop theories.Byunghan Kim - 2021 - Journal of Symbolic Logic 86 (3):1259-1281.
    We study the notion of weak canonical bases in an NSOP $_{1}$ theory T with existence. Given $p=\operatorname {tp}$ where $B=\operatorname {acl}$ in ${\mathcal M}^{\operatorname {eq}}\models T^{\operatorname {eq}}$, the weak canonical base of p is the smallest algebraically closed subset of B over which p does not Kim-fork. With this aim we firstly show that the transitive closure $\approx $ of collinearity of an indiscernible sequence is type-definable. Secondly, we prove that given a total $\mathop {\smile (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  44
    Finite models constructed from canonical formulas.Lawrence S. Moss - 2007 - Journal of Philosophical Logic 36 (6):605 - 640.
    This paper obtains the weak completeness and decidability results for standard systems of modal logic using models built from formulas themselves. This line of work began with Fine (Notre Dame J. Form. Log. 16:229-237, 1975). There are two ways in which our work advances on that paper: First, the definition of our models is mainly based on the relation Kozen and Parikh used in their proof of the completeness of PDL, see (Theor. Comp. Sci. 113-118, 1981). The point is (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  3.  8
    A note on prime models in weakly o‐minimal structures.Somayyeh Tari - 2017 - Mathematical Logic Quarterly 63 (1-2):109-113.
    Let be a weakly o‐minimal structure with the strong cell decomposition property. In this note, we show that the canonical o‐minimal extension of is the unique prime model of the full first order theory of over any set. We also show that if two weakly o‐minimal structures with the strong cell decomposition property are isomorphic then, their canonical o‐minimal extensions are isomorphic too. Finally, we show the uniqueness of the prime models in a complete weakly o‐minimal theory (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  15
    Canonical functions, non-regular ultrafilters and Ulam’s problem on ω1.Oliver Deiser & Dieter Donder - 2003 - Journal of Symbolic Logic 68 (3):713-739.
    Our main results are:Theorem 1. Con implies Con. [In fact equiconsistency holds.]Theorem 3. Con implies Con.Theorem 5. Con ”) implies Con.We start with a discussion of the canonical functions and look at some combinatorial principles. Assuming the domination property of Theorem 1, we use the Ketonen diagram to show that ω2V is a limit of measurable cardinals in Jensen’s core model KMO for measures of order zero. Using related arguments we show that ω2V is a stationary limit of (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  7
    Local weak presaturation of the strongly non‐stationary ideal.Masahiro Shioya & Naoki Yamaura - 2020 - Mathematical Logic Quarterly 66 (1):99-103.
    We give a model of set theory in which the strongly non‐stationary ideal over is weakly presaturated below some canonical set. Here μ is a regular uncountable cardinal. The model is the forcing extension with the Lévy collapse of a Woodin cardinal to the successor of μ. This improves on results of Goldring and of the first author.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. Weakness of will from Plato to the present (review).Petter Korkman - 2009 - Journal of the History of Philosophy 47 (3):pp. 466-467.
    Weakness of will denotes a phenomenon that many would regard as forming part of everyday human experience. I hate to admit to it, but I do sometimes reprimand my children more harshly than I think I should, and similar situations occur daily. This could be an example of weakness of will or incontinence: I will to be constructive and provide a model of calm interaction, but fail to do so because my will is weak and I end up (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  7.  33
    Weak forms of elimination of imaginaries.Enrique Casanovas & Rafel Farré - 2004 - Mathematical Logic Quarterly 50 (2):126-140.
    We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets B such that A ⊆ B ⊆ acl and closed subgroups of the Galois group Aut/A). We also characterize when the topology of the Galois group is the quotient topology.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  8.  41
    On the completeness of first degree weakly aggregative modal logics.Peter Apostoli - 1997 - Journal of Philosophical Logic 26 (2):169-180.
    This paper extends David Lewis' result that all first degree modal logics are complete to weakly aggregative modal logic by providing a filtration-theoretic version of the canonical model construction of Apostoli and Brown. The completeness and decidability of all first-degree weakly aggregative modal logics is obtained, with Lewis's result for Kripkean logics recovered in the case k = 1.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  27
    Locally finite weakly minimal theories.James Loveys - 1991 - Annals of Pure and Applied Logic 55 (2):153-203.
    Suppose T is a weakly minimal theory and p a strong 1-type having locally finite but nontrivial geometry. That is, for any M [boxvR] T and finite Fp, there is a finite Gp such that acl∩p = gεGacl∩pM; however, we cannot always choose G = F. Then there are formulas θ and E so that θεp and for any M[boxvR]T, E defines an equivalence relation with finite classes on θ/E definably inherits the structure of either a projective or affine space (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  10.  28
    Bounded Martin's Maximum, Weak [image] Cardinals, and [image].David Asperó & Philip D. Welch - 2002 - Journal of Symbolic Logic 67 (3):1141 - 1152.
    We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  16
    Almost Indiscernible Sequences and Convergence of Canonical Bases.Itaï Ben Yaacov, Alexander Berenstein & C. Ward Henson - 2014 - Journal of Symbolic Logic 79 (2):460-484.
    We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,•We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.•We characterise sequences that admit almost indiscernible sub-sequences.•We apply these tools to the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  44
    Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic.Yifeng Ding, Jixin Liu & Yanjing Wang - 2023 - Synthese 201 (2):1-27.
    This paper connects the following four topics: a class of generalized graphs whose relations do not have fixed arities called hypergraphs, a family of non-normal modal logics rejecting the aggregative axiom, an epistemic framework fighting logical omniscience, and the classical group knowledge modality of ‘someone knows’. Through neighborhood frames as their meeting point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  48
    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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14. Completeness and Doxastic Plurality for Topological Operators of Knowledge and Belief.Thomas Mormann - 2023 - Erkenntnis: 1 - 34, ONLINE.
    The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  36
    Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property.Guido Bertolotti, Pierangelo Miglioli & Daniela Silvestrini - 1996 - Mathematical Logic Quarterly 42 (1):501-536.
    We provide results allowing to state, by the simple inspection of suitable classes of posets , that the corresponding intermediate propositional logics are maximal among the ones which satisfy the disjunction property. Starting from these results, we directly exhibit, without using the axiom of choice, the Kripke frames semantics of 2No maximal intermediate propositional logics with the disjunction property. This improves previous evaluations, giving rise to the same conclusion but made with an essential use of the axiom of choice, of (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  70
    General canonical models for graded normal logics (graded modalities IV).C. Cerrato - 1990 - Studia Logica 49 (2):241 - 252.
    We prove the canonical models introduced in [D] do not exist for some graded normal logics with symmetric models, namelyKB°, KBD°, KBT°, so that we define a new kind of canonical models, the general ones, and show they exist and work well in every case.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  17. A topological completeness theorem for a weak version of Stalnaker's logic of knowledge and belief.Thomas Mormann - manuscript
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  27
    A Canonical Model for Constant Domain Basic First-Order Logic.Ben Middleton - 2020 - Studia Logica 108 (6):1307-1323.
    I build a canonical model for constant domain basic first-order logic (BQLCD), the constant domain first-order extension of Visser’s basic propositional logic, and use the canonical model to verify that BQLCD satisfies the disjunction and existence properties.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  20
    Canonical models for ℵ1-combinatorics.Saharon Shelah & Jindr̆ich Zapletal - 1999 - Annals of Pure and Applied Logic 98 (1-3):217-259.
    We define the property of Π2-compactness of a statement Φ of set theory, meaning roughly that the hard core of the impact of Φ on combinatorics of 1 can be isolated in a canonical model for the statement Φ. We show that the following statements are Π2-compact: “dominating NUMBER = 1,” “cofinality of the meager IDEAL = 1”, “cofinality of the null IDEAL = 1”, “bounding NUMBER = 1”, existence of various types of Souslin trees and variations on (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  20. A Canonical Model Construction For Substructural Logics With Strong Negation.N. Kamide - 2002 - Reports on Mathematical Logic:95-116.
    We introduce Kripke models for propositional substructural logics with strong negation, and show the completeness theorems for these logics using an extended Ishihara's canonical model construction method. The framework presented can deal with a broad range of substructural logics with strong negation, including a modified version of Nelson's logic N$^-$, Wansing's logic COSPL, and extended versions of Visser's basic propositional logic, positive relevant logics, Corsi's logics and M\'endez's logics.
     
    Export citation  
     
    Bookmark   9 citations  
  21.  23
    A Canonical Model of the Region Connection Calculus.Jochen Renz - 2002 - Journal of Applied Non-Classical Logics 12 (3-4):469-494.
    Although the computational properties of the Region Connection Calculus RCC-8 are well studied, reasoning with RCC-8 entails several representational problems. This includes the problem of representing arbitrary spatial regions in a computational framework, leading to the problem of generating a realization of a consistent set of RCC-8 constraints. A further problem is that RCC-8 performs reasoning about topological space, which does not have a particular dimension. Most applications of spatial reasoning, however, deal with two- or three-dimensional space. Therefore, a consistent (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  22.  49
    Probabilistic Canonical Models for Partial Logics.François Lepage & Charles Morgan - 2003 - Notre Dame Journal of Formal Logic 44 (3):125-138.
    The aim of the paper is to develop the notion of partial probability distributions as being more realistic models of belief systems than the standard accounts. We formulate the theory of partial probability functions independently of any classical semantic notions. We use the partial probability distributions to develop a formal semantics for partial propositional calculi, with extensions to predicate logic and higher order languages. We give a proof theory for the partial logics and obtain soundness and completeness results.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  23. Canonical models and probabilistic semantics.C. Morgan - 2000 - Poznan Studies in the Philosophy of the Sciences and the Humanities 71:17-35.
  24. Canonical models for temporal deontic logic.Patrice Bailhache - 1995 - Logique Et Analyse 149:3-21.
     
    Export citation  
     
    Bookmark   3 citations  
  25.  8
    A canonical model construction for intuitionistic distributed knowledge.Gerhard Jäger & Michel Marti - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 420-434.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  26. Canonical Models and Probabilistic Semantics: Commentary.F. Lepage - 2000 - Poznan Studies in the Philosophy of the Sciences and the Humanities 71:17-35.
  27. A canonical model for S2.M. J. Cresswell - 1982 - Logique Et Analyse 25 (97):3.
  28.  28
    Graded modalities, II (canonical models).Francesco Caro - 1988 - Studia Logica 47 (1):1 - 10.
    This work intends to be a generalization and a simplification of the techniques employed in [2], by the proposal of a general strategy to prove satisfiability theorems for NLGM-s (= normal logics with graded modalities), analogously to the well known technique of the canonical models by Lemmon and Scott for classical modal logics.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  29.  39
    Action Emulation between Canonical Models.Floor Sietsma & Jan van Eijck - 2013 - Journal of Philosophical Logic 42 (6):905-925.
    In this paper we investigate Kripke models, used to model knowledge or belief in a static situation, and action models, used to model communicative actions that change this knowledge or belief. The appropriate notion for structural equivalence between modal structures such as Kripke models is bisimulation: Kripke models that are bisimilar are modally equivalent. We would like to find a structural relation that can play the same role for the action models that play a prominent role in information (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  30.  14
    Canonical models for fragments of the axiom of choice.Paul Larson & Jindřich Zapletal - 2017 - Journal of Symbolic Logic 82 (2):489-509.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  16
    A Note on the Issue of Cohesiveness in Canonical Models.Matteo Pascucci - 2020 - Journal of Logic, Language and Information 29 (3):331-348.
    In their presentation of canonical models for normal systems of modal logic, Hughes and Cresswell observe that some of these models are based on a frame which can be also thought of as a collection of two or more isolated frames; they call such frames ‘non-cohesive’. The problem of checking whether the canonical model of a given system is cohesive is still rather unexplored and no general decision procedure is available. The main contribution of this article consists (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  10
    Construction of a canonical model for a first-order non-Fregean logic with a connective for reference and a total truth predicate.S. Lewitzka - 2012 - Logic Journal of the IGPL 20 (6):1083-1109.
  33.  27
    A theory of pairs for non-valuational structures.Elitzur Bar-Yehuda, Assaf Hasson & Ya’Acov Peterzil - 2019 - Journal of Symbolic Logic 84 (2):664-683.
    Given a weakly o-minimal structure${\cal M}$and its o-minimal completion$\bar{{\cal M}}$, we first associate to$\bar{{\cal M}}$a canonical language and then prove thatTh$\left$determines$Th\left$. We then investigate the theory of the pair$\left$in the spirit of the theory of dense pairs of o-minimal structures, and prove, among other results, that it is near model complete, and every definable open subset of${\bar{M}^n}$is already definable in$\bar{{\cal M}}$.We give an example of a weakly o-minimal structure interpreting$\bar{{\cal M}}$and show that it is not elementarily equivalent to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  33
    Models & Proofs: LFIs Without a Canonical Interpretations.Eduardo Alejandro Barrio - 2018 - Principia: An International Journal of Epistemology 22 (1):87-112.
    In different papers, Carnielli, W. & Rodrigues, A., Carnielli, W. Coniglio, M. & Rodrigues, A. and Rodrigues & Carnielli, present two logics motivated by the idea of capturing contradictions as conflicting evidence. The first logic is called BLE and the second—that is a conservative extension of BLE—is named LETJ. Roughly, BLE and LETJ are two non-classical logics in which the Laws of Explosion and Excluded Middle are not admissible. LETJ is built on top of BLE. Moreover, LETJ is a Logic (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  35.  22
    The Triumph of the Goddess: The Canonical Models and Theological Visions of the Devi-Bhagavata Purana.David Kinsley & C. MacKenzie Brown - 1991 - Journal of the American Oriental Society 111 (4):850.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  36.  80
    Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties.I. Sharpe & P. D. Welch - 2011 - Annals of Pure and Applied Logic 162 (11):863-902.
    • We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  37.  11
    Confirmatory Composite Analysis.Florian Schuberth, Jörg Henseler & Theo K. Dijkstra - 2018 - Frontiers in Psychology 9:409059.
    This article introduces confirmatory composite analysis (CCA) as a structural equation modeling technique that aims at testing composite models. In doing so, it overcomes a current weakness of structural equation modeling, i.e., the operationalization and assessment of design concepts, so-called artifacts. CCA entails the same steps as confirmatory factor analysis: model specification, model identification, model estimation, and model assessment. Composite models are specified such that they consist of a set of interrelated composites, all of which emerge (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  38. Language, Models, and Reality: Weak existence and a threefold correspondence.Neil Barton & Giorgio Venturi - manuscript
    How does our language relate to reality? This is a question that is especially pertinent in set theory, where we seem to talk of large infinite entities. Based on an analogy with the use of models in the natural sciences, we argue for a threefold correspondence between our language, models, and reality. We argue that so conceived, the existence of models can be underwritten by a weak notion of existence, where weak existence is to be understood as existing (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  39.  12
    N-Berkeley cardinals and weak extender models.Raffaella Cutolo - 2020 - Journal of Symbolic Logic 85 (2):809-816.
    For a given inner model N of ZFC, one can consider the relativized version of Berkeley cardinals in the context of ZFC, and ask if there can exist an “N-Berkeley cardinal.” In this article we provide a positive answer to this question. Indeed, under the assumption of a supercompact cardinal $\delta $, we show that there exists a ZFC inner model N such that there is a cardinal which is N-Berkeley, even in a strong sense. Further, the involved (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  40. Minimal models and canonical neural computations: the distinctness of computational explanation in neuroscience.M. Chirimuuta - 2014 - Synthese 191 (2):127-153.
    In a recent paper, Kaplan (Synthese 183:339–373, 2011) takes up the task of extending Craver’s (Explaining the brain, 2007) mechanistic account of explanation in neuroscience to the new territory of computational neuroscience. He presents the model to mechanism mapping (3M) criterion as a condition for a model’s explanatory adequacy. This mechanistic approach is intended to replace earlier accounts which posited a level of computational analysis conceived as distinct and autonomous from underlying mechanistic details. In this paper I discuss (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   65 citations  
  41.  32
    Second-order non-nonstandard analysis.J. M. Henle - 2003 - Studia Logica 74 (3):399 - 426.
    Following [3], we build higher-order models of analysis resembling the frameworks of nonstandard analysis. The models are entirely canonical, constructed without Choice. Weak transfer principles are developed and the models are applied to topology, graph theory, and measure theory. A Loeb-like measure is constructed.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42.  11
    Horizontal gene transfer in eukaryotes: The weak‐link model.Jinling Huang - 2013 - Bioessays 35 (10):868-875.
    The significance of horizontal gene transfer (HGT) in eukaryotic evolution remains controversial. Although many eukaryotic genes are of bacterial origin, they are often interpreted as being derived from mitochondria or plastids. Because of their fixed gene pool and gene loss, however, mitochondria and plastids alone cannot adequately explain the presence of all, or even the majority, of bacterial genes in eukaryotes. Available data indicate that no insurmountable barrier to HGT exists, even in complex multicellular eukaryotes. In addition, the discovery of (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  43.  25
    Diagonal fixed points in algebraic recursion theory.Jordan Zashev - 2005 - Archive for Mathematical Logic 44 (8):973-994.
    The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  44.  25
    On canonicity and completions of weakly representable relation algebras.Ian Hodkinson & Szabolcs Mikulás - 2012 - Journal of Symbolic Logic 77 (1):245-262.
    We show that the variety of weakly representable relation algebras is neither canonical nor closed under Monk completions.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  45.  37
    A canonical topological model for extensions of K4.Christopher Steinsvold - 2010 - Studia Logica 94 (3):433 - 441.
    Interpreting the diamond of modal logic as the derivative, we present a topological canonical model for extensions of K4 and show completeness for various logics. We also show that if a logic is topologically canonical, then it is relationally canonical.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  46.  11
    Second-order Non-nonstandard Analysis.J. M. Henle - 2003 - Studia Logica 74 (3):399-426.
    Following [3], we build higher-order models of analysis resembling the frameworks of nonstandard analysis. The models are entirely canonical, constructed without Choice. Weak transfer principles are developed and the models are applied to topology, graph theory, and measure theory. A Loeb-like measure is constructed.
    Direct download  
     
    Export citation  
     
    Bookmark  
  47.  48
    The Constitution of Rhetoric's Tradition.Maurice Rene Charland - 2003 - Philosophy and Rhetoric 36 (2):119-134.
    In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 36.2 (2003) 119-134 [Access article in PDF] The Constitution of Rhetoric's Tradition Maurice Charland Rhetoric is not a discipline. That is to say, as a domain of theoretical and practical knowledge, rhetoric is weakly institutionalized, lacking a centralized arbiter and standardized set of procedures for establishing truth claims. It also lacks the basic characteristics that Michel Foucault defines as disciplinary, for while we can identify "groups (...)
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  48.  39
    Imre Lakatos and literary tradition.Suzanne Black - 2003 - Philosophy and Literature 27 (2):363-381.
    In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Literature 27.2 (2003) 363-381 [Access article in PDF] Imre Lakatos and Literary Tradition Suzanne Black ALTHOUGH THE CANON DEBATES have largely subsided, the categories of tradition and canon remain problematic and unhelpfully contentious. Some authors view tradition as weighty and oppressive, while cultural studies scholars criticize the concept itself as elitist and exclusionary. Yet literature, like other creative pursuits, cannot avoid its past; nor should it seek (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  49.  12
    A heuristically useful but empirically weak neuropsychological model of schizophrenia.M. Pisa & J. M. Cleghorn - 1991 - Behavioral and Brain Sciences 14 (1):42-43.
  50.  72
    Agents of Reform?: Children’s Literature and Philosophy.Karen L. McGavock - 2007 - Philosophia 35 (2):129-143.
    Children’s literature was first published in the eighteenth century at a time when the philosophical ideas of Jean-Jacques Rousseau on education and childhood were being discussed. Ironically, however, the first generation of children’s literature (by Maria Edgeworth et al) was incongruous with Rousseau’s ideas since the works were didactic, constraining and demanded passive acceptance from their readers. This instigated a deficit or reductionist model to represent childhood and children’s literature as simple and uncomplicated and led to children’s literature being (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 993