Results for ' well-formed formulas'

976 found
Order:
  1.  68
    A Theory of Propositions.Nicholas J. J. Smith - 2016 - Logic and Logical Philosophy 25 (1):83-125.
    In this paper I present a new theory of propositions, according to which propositions are abstract mathematical objects: well-formed formulas together with models. I distinguish the theory from a number of existing views and explain some of its advantages  chief amongst which are the following. On this view, propositions are unified and intrinsically truth-bearing. They are mind- and language-independent and they are governed by logic. The theory of propositions is ontologically innocent. It makes room for an (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  48
    A reduction class containing formulas with one monadic predicate and one binary function symbol.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):45-49.
    A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus. The members of this class are closed prenex formulas of the form ∀ x∀ yC. The matrix C is in conjunctive normal form and has no disjuncts with more than three literals, in fact all but one conjunct is unary. Furthermore C contains but one predicate symbol, that being unary, and one function symbol which symbol is binary.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  3. Logical form.Christopher Menzel - 1996 - In Edward Craig (ed.), Routledge Encyclopedia of Philosophy: Genealogy to Iqbal. New York: Routledge.
    Consider the following argument: All men are mortal; Socrates is a man; therefore, Socrates is mortal. Intuitively, what makes this a valid argument has nothing to do with Socrates, men, or mortality. Rather, each sentence in the argument exhibits a certain logical form, which, together with the forms of the other two, constitute a pattern that, of itself, guarantees the truth of the conclusion given the truth of the premises. More generally, then, the logical form of a sentence of natural (...)
     
    Export citation  
     
    Bookmark   1 citation  
  4.  99
    Many-Valued Logics.Nicholas J. J. Smith - 2011 - In Gillian Russell & Delia Graff Fara (eds.), Routledge Companion to Philosophy of Language. New York, USA: Routledge. pp. 636--51.
    A many-valued (aka multiple- or multi-valued) semantics, in the strict sense, is one which employs more than two truth values; in the loose sense it is one which countenances more than two truth statuses. So if, for example, we say that there are only two truth values—True and False—but allow that as well as possessing the value True and possessing the value False, propositions may also have a third truth status—possessing neither truth value—then we have a many-valued semantics in (...)
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  1
    Operator algebras and quantum logic.Paul Weingartner - 2004 - In Alternative Logics. Do Sciences Need Them? Springer Verlag. pp. 349-360.
    Let K = (p, q...; &, ∨, ~) be a zeroth-order formal language with sentence variables p, q..., two place connectives & (and), ∨ (or) and negation sign ~, and let F be the formula algebra (set of well-formed formulas in K defined in the standard way by induction from the sentence variables). If v is an assignment of truth values 1(true), 0(f alse) to the sentence variables p, q..., then classical propositional logic is characterized by extending (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  15
    Operator algebras and quantum logic.Miklós Rédei - 2004 - In Paul Weingartner (ed.), Alternative Logics. Do Sciences Need Them? Springer Verlag. pp. 349-360.
    Let K = (p, q...; &, ∨, ~) be a zeroth-order formal language with sentence variables p, q..., two place connectives & (and), ∨ (or) and negation sign ~, and let F be the formula algebra (set of well-formed formulas in K defined in the standard way by induction from the sentence variables). If v is an assignment of truth values 1(true), 0(f alse) to the sentence variables p, q..., then classical propositional logic is characterized by extending (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  25
    Strong Generative Capacity and the Empirical Base of Linguistic Theory.Dennis Ott - 2017 - Frontiers in Psychology 8:277323.
    This Perspective traces the evolution of certain central notions in the theory of Generative Grammar (GG). The founding documents of the field suggested a relation between the grammar, construed as recursively enumerating an infinite set of sentences, and the idealized native speaker that was essentially equivalent to the relation between a formal language (a set of well-formed formulas) and an automaton that recognizes strings as belonging to the language or not. But this early view was later abandoned, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  92
    Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
    The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  9.  79
    A pragmatic interpretation of intuitionistic propositional logic.Carlo Dalla Pozza & Claudio Garola - 1995 - Erkenntnis 43 (1):81-109.
    We construct an extension P of the standard language of classical propositional logic by adjoining to the alphabet of a new category of logical-pragmatic signs. The well formed formulas of are calledradical formulas (rfs) of P;rfs preceded by theassertion sign constituteelementary assertive formulas of P, which can be connected together by means of thepragmatic connectives N, K, A, C, E, so as to obtain the set of all theassertive formulas (afs). Everyrf of P is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  10.  56
    An argument against nominalism.Francesco Maria Ferrari - 2022 - Synthese 200 (5):1-23.
    Nominalism in formal ontology is still the thesis that the only acceptable domain of quantification is the first-order domain of particulars. Nominalists may assert that second-order well-formed formulas can be fully and completely interpreted within the first-order domain, thereby avoiding any ontological commitment to second-order entities, by means of an appropriate semantics called “substitutional”. In this paper I argue that the success of this strategy depends on the ability of Nominalists to maintain that identity, and equivalence relations (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  11.  8
    Operator algebras and quantum logic.Miklós Rédei - 2004 - In Paul Weingartner (ed.), Alternative Logics. Do Sciences Need Them? Springer Verlag. pp. 349-360.
    Let K = (p, q...; &, ∨, ~) be a zeroth-order formal language with sentence variables p, q..., two place connectives & (and), ∨ (or) and negation sign ~, and let F be the formula algebra (set of well-formed formulas in K defined in the standard way by induction from the sentence variables). If v is an assignment of truth values 1(true), 0(f alse) to the sentence variables p, q..., then classical propositional logic is characterized by extending (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  39
    Prenex normal form theorems in semi-classical arithmetic.Makoto Fujiwara & Taishi Kurahashi - 2021 - Journal of Symbolic Logic 86 (3):1124-1153.
    Akama et al. [1] systematically studied an arithmetical hierarchy of the law of excluded middle and related principles in the context of first-order arithmetic. In that paper, they first provide a prenex normal form theorem as a justification of their semi-classical principles restricted to prenex formulas. However, there are some errors in their proof. In this paper, we provide a simple counterexample of their prenex normal form theorem [1, Theorem 2.7], then modify it in an appropriate way which still (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  39
    Theory of Semi-Instantiation in Abstract Argumentation.D. M. Gabbay - 2016 - Logica Universalis 10 (4):431-516.
    We study instantiated abstract argumentation frames of the form, where is an abstract argumentation frame and where the arguments x of S are instantiated by I as well formed formulas of a well known logic, for example as Boolean formulas or as predicate logic formulas or as modal logic formulas. We use the method of conceptual analysis to derive the properties of our proposed system. We seek to define the notion of complete extensions (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  14.  11
    Do Sentences Have Identity?Jean-Yves Béziau - 1998 - The Paideia Archive: Twentieth World Congress of Philosophy 8:3-10.
    We study here equiformity, the standard identity criterion for sentences. This notion was put forward by Lesniewski, mentioned by Tarski and defined explicitly by Presburger. At the practical level this criterion seems workable but if the notion of sentence is taken as a fundamental basis for logic and mathematics, it seems that this principle cannot be maintained without vicious circle. It seems also that equiformity has some semantical features ; maybe this is not so clear for individual signs but sentences (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  37
    Two variable implicational calculi of prescribed many-one degrees of unsolvability.Charles E. Hughes - 1976 - Journal of Symbolic Logic 41 (1):39-44.
    A constructive proof is given which shows that every nonrecursive r.e. many-one degree is represented by the family of decision problems for partial implicational propositional calculi whose well-formed formulas contain at most two distinct variable symbols.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  16.  15
    Semantics for first-order superposition logic.Athanassios Tzouvaras - 2019 - Logic Journal of the IGPL 27 (4):570-595.
    We investigate how the sentence choice semantics for propositional superposition logic developed in Tzouvaras could be extended so as to successfully apply to first-order superposition logic. There are two options for such an extension. The apparently more natural one is the formula choice semantics based on choice functions for pairs of arbitrary formulas of the basis language. It is proved however that the universal instantiation scheme of first-order logic, $\varphi \rightarrow \varphi $, is false, as a scheme of tautologies, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  18
    Annotated Natural Deduction for Adaptive Reasoning.Patrick Allo & Giuseppe Primiero - 2019 - In Can Başkent & Thomas Macaulay Ferguson (eds.), Graham Priest on Dialetheism and Paraconsistency. Cham, Switzerland: Springer Verlag. pp. 409-437.
    We present a multi-conclusion natural deduction calculus characterizing the dynamic reasoning typical of Adaptive Logics. The resulting system AdaptiveND is sound and complete with respect to the propositional fragment of adaptive logics based on CLuN. This appears to be the first tree-format presentation of the standard linear dynamic proof system typical of Adaptive Logics. It offers the advantage of full transparency in the formulation of locally derivable rules, a connection between restricted inference-rules and their adaptive counterpart, and the formulation of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  25
    Analysis of Quantifiers in Wittgenstein’s Tractatus: A Critical Survey.Dale Jacquette - 2001 - History of Philosophy & Logical Analysis 4 (1):191-202.
    Analysis of quantifiers in Wittgenstein's Tractatus. A critical survey In the Tractatus Logico-Philosophicus, Wittgenstein distinguishes between what can and cannot be said in any language by the general form of propositions. I explain Wittgenstein's method and discuss Robert J. Fogelin's criticism of what he takes to be the incompleteness of Wittgenstein's general form of propositions in his exposition of the 'Naive Constructivism of the Tractatus.' I argue that Fogelin's objection is mistaken, and that, contrary to Fogelin's claim, Wittgenstein's method when (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  19. 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  
  20.  61
    A topological logic of action.Krister Segerberg - 1984 - Studia Logica 43 (4):415 - 419.
    We consider a quantifier-free language in which there are terms as well as formulas. The proposition-forming propositional operators are the usual ones, and the term-making term operators are the usual lattice theoretical ones. In addition there is a formula-making term operator, does. We study a new logic in which does is claimed to approximate some features of the informal concept the agent performs the action.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  86
    Towards a model theory of diagrams.Hammer Eric & Danner Norman - 1996 - Journal of Philosophical Logic 25 (5):463 - 482.
    A logical system is studied whose well-formed representations consist of diagrams rather than formulas. The system, due to Shin [2, 3], is shown to be complete by an argument concerning maximally consistent sets of diagrams. The argument is complicated by the lack of a straight forward counterpart of atomic formulas for diagrams, and by the lack of a counterpart of negation for most diagrams.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22.  76
    Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
    A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   31 citations  
  23.  76
    A compact representation of proofs.Dale A. Miller - 1987 - Studia Logica 46 (4):347 - 370.
    A structure which generalizes formulas by including substitution terms is used to represent proofs in classical logic. These structures, called expansion trees, can be most easily understood as describing a tautologous substitution instance of a theorem. They also provide a computationally useful representation of classical proofs as first-class values. As values they are compact and can easily be manipulated and transformed. For example, we present an explicit transformations between expansion tree proofs and cut-free sequential proofs. A theorem prover which (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  24. How Common Worship Forms Local Character.Samuel Wells - 2002 - Studies in Christian Ethics 15 (1):66-74.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  25.  21
    Tableaux variants of some modal and relevant systems.P. I. Bystrov - 1988 - Bulletin of the Section of Logic 17 (3/4):92-98.
    The tableaux-constructions have a number of properties which advantageously distinguish them from equivalent axiomatic systems . The proofs in the form of tableaux-constructions have a full accordance with semantic interpretation and subformula property in the sense of Gentzen’s Hauptsatz. Method of tatleaux-construction gives a good substitute of Gentzen’s methods and thus opens a good perspective for the investigations of theoretical as well as applied aspects of logical calculi. It should be noted that application of tableau method in modal, tense, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  26.  17
    Some experiments in motor reproduction of visually perceived forms.George R. Wells - 1917 - Psychological Review 24 (4):322-327.
  27.  7
    Human Well-Being & Natural Environ.Partha Dasgupta - 2004 - Oxford University Press UK.
    In Human Well-Being and the Natural Environment, Partha Dasgupta explores ways to measure the quality of life. In developing quality-of-life indices, he pays particular attention to the natural environment, illustrating how it can be incorporated, more generally, into economic reasoning in a seamless manner. Professor Dasgupta puts the theory that he develops to use in extended commentaries on the economics of population, poverty traps, global warming, structural adjustment programmes, and free trade, particularly in relation to poor countries. The result (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  38
    Decidable and enumerable predicate logics of provability.Giorgie Dzhaparidze - 1990 - Studia Logica 49 (1):7 - 21.
    Predicate modal formulas are considered as schemata of arithmetical formulas, where is interpreted as the standard formula of provability in a fixed sufficiently rich theory T in the language of arithmetic. QL T(T) and QL T are the sets of schemata of T-provable and true formulas, correspondingly. Solovay's well-known result — construction an arithmetical counterinterpretation by Kripke countermodel — is generalized on the predicate modal language; axiomatizations of the restrictions of QL T(T) and QL T by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29. Anticipations of Gadamer's Hermeneutics in Plato, Aristotle and Hegel, and the Anthropological Turn in The Relevance of the Beautiful.Richard Palmer & Junyu Chen - 2008 - Philosophy and Culture 35 (2):85-107.
    Derived from Heidegger's interpretation of attractive force with a high volume of inspired beauty care and a master not only the followers. And in order to maintain this special, he followed the great classical psychologists: Ferdinand learning. He also won in the traditional school psychology professor at the certificate, but his real motive is not subject to the ancient hope臘Heidegger was carried out by the interpretation of the full amount of impact force. Nevertheless, Heidegger's classic is still up to the (...)
     
    Export citation  
     
    Bookmark  
  30.  39
    Logically Unknowable Propositions: a criticism to Tennant's three-partition of Anti-Cartesian propositions.Massimiliano Carrara & Davide Fassio - 2009 - In P. Hanna (ed.), An Anthology of Philosophical Studies, Vol.2. Atiner. pp. 181-194.
    The Knowability Paradox is a logical argument that, starting from the plainly innocent assumption that every true proposition is knowable, reaches the strong conclusion that every true proposition is known; i.e. if there are unknown truths, there are unknowable truths. The paradox has been considered a problem for every theory assuming the Knowability Principle, according to which all truths are knowable and, in particular, for semantic anti-realist theories. A well known criticism to the Knowability Paradox is the so called (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  42
    Theorem Proving in Lean.Jeremy Avigad, Leonardo de Moura & Soonho Kong - unknown
    Formal verification involves the use of logical and computational methods to establish claims that are expressed in precise mathematical terms. These can include ordinary mathematical theorems, as well as claims that pieces of hardware or software, network protocols, and mechanical and hybrid systems meet their specifications. In practice, there is not a sharp distinction between verifying a piece of mathematics and verifying the correctness of a system: formal verification requires describing hardware and software systems in mathematical terms, at which (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  55
    Ross' paradox and well-formed codices.Erik Stenius - 1982 - Theoria 48 (2):49-77.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  33. (1 other version)Expressivity of extensions of dynamic first-order logic.Balder ten Cate & Jan van Eijck - unknown
    Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of formulas-as-programs (...)
     
    Export citation  
     
    Bookmark  
  34.  24
    Benjamin’s Rhetoric: Kairos, Time, and History.Susan Wells - 2022 - Philosophy and Rhetoric 55 (3):252-273.
    ABSTRACT The welcome expansion of kairos beyond its traditional locus in public debate to a broad range of discourse forms and persuasive actions has not been matched by a reevaluation of the temporal logic of kairos, which is still seen as located in teleologic time. This article suggests that Walter Benjamin’s understanding of time could refigure kairos as a nonteleological relationship among past, present, and future. Benjamin provides a theoretical rationale for kairotic action that is distributed in time and space (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  35.  17
    Fact and Responsibility – Approaches towards the Factual in Contemporary Art.Rachel Wells - 2015 - Zeitschrift für Ästhetik Und Allgemeine Kunstwissenschaft 60 (1):39-53.
    Rachel Wells turns to the examination of three recent artistic practices, which integrate facts in their work not as an antagonistic other but as a constitutive element to their efficacy and ethics. She argues, that in introducing news, factual actions, or objects with traces of factual events, Alfredo Jaar, Jeremy Deller and Martin Creed use facts in order to retract from the position of art as an expression of artistic freedom and subjectivity and thus as the opposite of fact. Instead, (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  46
    Turing's Analysis of Computation and Theories of Cognitive Architecture.A. J. Wells - 1998 - Cognitive Science 22 (3):269-294.
    Turing's analysis of computation is a fundamental part of the background of cognitive science. In this paper it is argued that a re‐interpretation of Turing's work is required to underpin theorizing about cognitive architecture. It is claimed that the symbol systems view of the mind, which is the conventional way of understanding how Turing's work impacts on cognitive science, is deeply flawed. There is an alternative interpretation that is more faithful to Turing's original insights, avoids the criticisms made of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  37.  49
    Learning and Teaching Critical Thinking: From a Peircean Perspective.Kelley Wells - 2009 - Educational Philosophy and Theory 41 (2):201-218.
    The article will argue that Charles Sanders Peirce's concepts of the ‘Dynamics of Belief and Doubt’, the ‘Fixation of Belief’ as well as ‘habits of belief’ taken together comprise a theory of learning. The ‘dynamics of belief and doubt’ are Peirce's explanation for the process of changing from one belief to another. Teaching, then, would be an attempt to control that process. Teaching critical thinking represents an attempt to teach the learner to regulate and discipline his or her own (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  38.  16
    Unifiability and Structural Completeness in Relation Algebras and in Products of Modal Logic S5.Wojciech Dzik & Beniamin Wróbel - 2015 - Bulletin of the Section of Logic 44 (1/2):1-14.
    Unifiability of terms (and formulas) and structural completeness in the variety of relation algebras RA and in the products of modal logic S5 is investigated. Nonunifiable terms (formulas) which are satisfiable in varieties (in logics) are exhibited. Consequently, RA and products of S5 as well as representable diagonal-free n-dimensional cylindric algebras, RDfn, are almost structurally complete but not structurally complete. In case of S5n a basis for admissible rules and the form of all passive rules are provided.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  27
    Conical logic and l-groups logic.Marta S. Sagastume - 2005 - Journal of Applied Non-Classical Logics 15 (3):265-283.
    It is well known that there is a categorical equivalence between lattice-ordered Abelian groups (or l-groups) and conical BCK-algebras (see [COR 80]). The aim of this paper is to study this equivalence from the perspective of logic, in particular, to study the relationship between two deductive systems: conical logic Co and a logic of l-groups, Balo. In [GAL 04] the authors introduce a system Bal which models the logic of balance of opposing forces with a single distinguished truth value, (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  40.  11
    Political Philosophy and Ideology: A Critique of Political Essentialism.Hugh P. McDonald - 1997 - Development.
    This book is conceived as part of a systematic philosophy of values. Neither philosophies of value nor systematic philosophies are in fashion. It is hoped that this work will make a contribution toward their reappraisal. Classically, political philosophy was considered a part of philosophic systems, as the basic ideas of the philosophy applied to politics. Its relative neglect by the predominant school of philosophy in America and Britain has meant that certain ideas and issues in philosophy are in danger of (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  48
    First-Degree Entailment and its Relatives.Yaroslav Shramko, Dmitry Zaitsev & Alexander Belikov - 2017 - Studia Logica 105 (6):1291-1317.
    We consider a family of logical systems for representing entailment relations of various kinds. This family has its root in the logic of first-degree entailment formulated as a binary consequence system, i.e. a proof system dealing with the expressions of the form \, where both \ and \ are single formulas. We generalize this approach by constructing consequence systems that allow manipulating with sets of formulas, either to the right or left of the turnstile. In this way, it (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  42.  23
    An Analysis of Knowledge and Valuation. [REVIEW]Rulon S. Wells - 1949 - Review of Metaphysics 2 (7):99-115.
    The expectation is fulfilled, but in an unexpected way. 'The first studies toward this book were addressed to topics in the field of ethics' ; but our author, like Wagner composing 'Der Ring des Nibelungen', found himself becoming preoccupied with prolegomena. To these the present volume is wholly devoted. In order to establish its fundamental thesis that valuation is a form of empirical knowledge, two preparatory discussions are called for. An analysis of empirical knowledge in general is one of these; (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  43.  59
    Discursive Mobility and Double Consciousness in S. Weir Mitchell and W. E. B. Du Bois.Susan Wells - 2002 - Philosophy and Rhetoric 35 (2):120-137.
    In lieu of an abstract, here is a brief excerpt of the content:Philosophy and Rhetoric 35.2 (2002) 120-137 [Access article in PDF] Discursive Mobility and Double Consciousness in S. Weir Mitchell and W.E.B. Du Bois 1 Susan Wells Here are two stories about double consciousness: they will become, eventually, stories about the public sphere: W. E. B. Du Bois formulating the theory of double consciousness, and S. Weir Mitchell presenting Mary Reynolds's case history, an instance of a mental disorder known (...)
    No categories
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44. Lambert on Moral Certainty and the Justification of Induction.Aaron Wells - 2024 - Inquiry: An Interdisciplinary Journal of Philosophy 2024.
    I reconstruct J. H. Lambert’s views on how practical grounds relate to epistemic features, such as certainty. I argue, first, that Lambert’s account of moral certainty does not involve any distinctively practical influence on theoretical belief. However, it does present an interesting form of fallibilism about justification as well as a denial of a tight link between knowledge and action. Second, I argue that for Lambert, the persistence principle that underwrites induction is supported by practical reasons to believe; this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  45.  35
    Peirce's "architecture of theories" and the problem of pragmatism.Kelley J. Wells - 1996 - Metaphilosophy 27 (3):311-323.
    The paper begins as a response to Tom Rockmore's thesis that contemporary pragmatism is a healthy “confusion” of disparate views. While Rockmore sees the need of some of today's pragmatists to provide a motivation for what he calls “epistemic optimism,” I contend that the crucial question of pragmatism, the problem of pragmatism, is the ontological status of pragmatic meaning. Thus rather than a mere “epistemic optimism,” I call upon pragmatists to assert a fallible yet unabashedly metaphysical optimism. The argument supporting (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  46.  27
    (1 other version)Ueber den Einfluss von Optischem oder Akustischem Reiz und Grammatikalischer Form des Reizwortes auf dem Assoziationsvorang. [REVIEW]F. L. Wells - 1920 - Journal of Philosophy, Psychology and Scientific Methods 17 (9):241-245.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  47.  31
    Kant’s Moral Philosophy, an Interpretation of the Categorical Imperative. [REVIEW]L. L. D. - 1980 - Review of Metaphysics 34 (1):158-159.
    A defense of Kant’s moral philosophy. The author seeks to counteract those interpretations of Kant that restrict their focus to the Groundwork of the Metaphysics of Morals. He argues that one must look at the whole of Kant’s writings, the earlier and later ethical writings as well as the theoretical works. This makes it possible for him to challenge the popular misconceptions of Kant’s teaching: the overemphasis on the correct motive of an action, the mistaken impression that consequences are (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  48.  31
    Another Type of Bilingual Advantage? Tense-Mood-Aspect Frequency, Verb-Form Regularity and Context-Governed Choice in Bilingual vs. Monolingual Spanish Speakers with Agrammatism.O'Connor Wells Barbara & Obler Loraine - 2014 - Frontiers in Psychology 5.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  14
    Online Public Access Catalogues and Library Discovery Systems.David Wells - 2022 - Knowledge Organization 48 (6):457-466.
    This article provides an overview of computer based catalogue systems designed for use by library clients, seeing present day ‘discovery systems’ on the same trajectory as the older ‘online public access catalogues’ which they are gradually replacing, both in technical development and their approach to client use scenarios. It traces the history of the OPAC/discovery system from its origins in the library automation of the 1960s through to the present and discusses the main technical standards which have formed its (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  50.  27
    Ecologies of Repair: A Post-human Approach to Other-Than-Human Natures.Gustavo Blanco-Wells - 2021 - Frontiers in Psychology 12.
    This conceptual paper explores the theoretical possibilities of posthumanism and presents ecologies of repair as a heuristic device to explore the association modes of different entities, which, when confronted with the effects of human-induced destructive events, seek to repair the damage and transform the conditions of coexistence of various life forms. The central idea is that severe socio-environmental crisis caused by an intensification of industrial activity are conducive to observing new sociomaterial configurations and affective dispositions that, through the reorganization of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 976