Search results for 'Verification' (try it on Scholar)

727 found
Order:
  1.  7
    Valentin Cheshko & Yulia Kosova (2011). SOCIAL VERIFICATION – HUMAN DIMENSONS OF THEORETICAL SCIENCE AND HIGH-TECH (CASUS BIOETHICS). Part One. Practical Philosophy 1:94-100.
    The new phase of science evolution is characterized by totality of subject and object of cognition and technology (high-hume). As a result, forming of network structure in a disciplinary matrix modern are «human dimensional» natural sciences and two paradigmal «nuclei» (attraktors). As a result, the complication of structure of disciplinary matrix and forming a few paradigm nuclei in modern «human dimensional» natural sciences are observed. In the process of social verification integration of scientific theories into the existent system of (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  2.  7
    Valentin Cheshko & Yulia Kosova (2012). SOCIAL VERIFICATION – HUMAN DIMENSONS OF THEORETICAL SCIENCE AND HIGH-TECH (CASUS BIOETHICS). Part Three. DYNAMICS OF GROWTH OF NEW KNOWLEDGE IN POSTACADEMICAL SCIENCE. Practical Philosophy 1:59-69.
    The new phase of science evolution is characterized by totality of subject and object of cognition and technology (high-hume). As a result, forming of network structure in a disciplinary matrix modern are «human dimensional» natural sciences and two paradigmal «nuclei» (attraktors). As a result, the complication of structure of disciplinary matrix and forming a few paradigm nuclei in modern «human dimensional» natural sciences are observed. In the process of social verification integration of scientific theories into the existent system of (...)
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  3.  19
    Uri Pincas (2011). Program Verification and Functioning of Operative Computing Revisited: How About Mathematics Engineering? [REVIEW] Minds and Machines 21 (2):337-359.
    The issue of proper functioning of operative computing and the utility of program verification, both in general and of specific methods, has been discussed a lot. In many of those discussions, attempts have been made to take mathematics as a model of knowledge and certitude achieving, and accordingly infer about the suitable ways to handle computing. I shortly review three approaches to the subject, and then take a stance by considering social factors which affect the epistemic status of both (...)
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  22
    Joeri Engelfriet, Catholijn M. Jonker & Jan Treur (2002). Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic. Journal of Logic, Language and Information 11 (2):195-225.
    Compositional verification aims at managing the complexity of theverification process by exploiting compositionality of the systemarchitecture. In this paper we explore the use of a temporal epistemiclogic to formalize the process of verification of compositionalmulti-agent systems. The specification of a system, its properties andtheir proofs are of a compositional nature, and are formalized within acompositional temporal logic: Temporal Multi-Epistemic Logic. It isshown that compositional proofs are valid under certain conditions.Moreover, the possibility of incorporating default persistence ofinformation in a (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  5.  31
    Timothy R. Colburn (1991). Program Verification, Defeasible Reasoning, and Two Views of Computer Science. Minds and Machines 1 (1):97-116.
    In this paper I attempt to cast the current program verification debate within a more general perspective on the methodologies and goals of computer science. I show, first, how any method involved in demonstrating the correctness of a physically executing computer program, whether by testing or formal verification, involves reasoning that is defeasible in nature. Then, through a delineation of the senses in which programs can be run as tests, I show that the activities of testing and formal (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  6.  13
    David A. Nelson (1992). Deductive Program Verification (a Practitioner's Commentary). Minds and Machines 2 (3):283-307.
    A proof of ‘correctness’ for a mathematical algorithm cannot be relevant to executions of a program based on that algorithm because both the algorithm and the proof are based on assumptions that do not hold for computations carried out by real-world computers. Thus, proving the ‘correctness’ of an algorithm cannot establish the trustworthiness of programs based on that algorithm. Despite the (deceptive) sameness of the notations used to represent them, the transformation of an algorithm into an executable program is a (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  7.  12
    Martin Kavka (2012). Verification (Bewahrung) in Martin Buber. Journal of Jewish Thought and Philosophy 20 (1):71-98.
    Abstract The work of Martin Buber oscillates between talk in which transcendence is experienced and talk in which transcendence is merely postulated. In order to show and mend this incoherence in Buber's thought, this essay attends to the rhetoric of verification ( Bewährung ), primarily but not solely in I and Thou (1923), both in order to show how it is a symptom of this incoherence, and also to show a broad pragmatic strain in Buber's thought. Given this pragmatic (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  8.  15
    Kathi Fisler (1999). Timing Diagrams: Formalization and Algorithmic Verification. [REVIEW] Journal of Logic, Language and Information 8 (3):323-361.
    Timing diagrams are popular in hardware design. They have been formalized for use in reasoning tasks, such as computer-aided verification. These efforts have largely treated timing diagrams as interfaces to established notations for which verification is decidable; this has restricted timing diagrams to expressing only regular language properties. This paper presents a timing diagram logic capable of expressing certain context-free and context-sensitive properties. It shows that verification is decidable for properties expressible in this logic. More specifically, it (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  9.  1
    Giuseppe De Giacomo, Yves Lespérance, Fabio Patrizi & Stavros Vassos (2016). Progression and Verification of Situation Calculus Agents with Bounded Beliefs. Studia Logica 104 (4):705-739.
    We investigate agents that have incomplete information and make decisions based on their beliefs expressed as situation calculus bounded action theories. Such theories have an infinite object domain, but the number of objects that belong to fluents at each time point is bounded by a given constant. Recently, it has been shown that verifying temporal properties over such theories is decidable. We take a first-person view and use the theory to capture what the agent believes about the domain of interest (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  10.  40
    Rick Dale & Nicholas D. Duran (2011). The Cognitive Dynamics of Negated Sentence Verification. Cognitive Science 35 (5):983-996.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  11.  4
    Valentin Cheshko & Yulia Kosova (2011). SOCIAL VERIFICATION – HUMAN DIMENSONS OF THEORETICAL SCIENCE AND HIGH-TECH (CASUS BIOETHICS). Part Two. Practical Philosophy 2:46-55.
    The new phase of science evolution is characterized by totality of subject and object of cognition and technology (high-hume). As a result, forming of network structure in a disciplinary matrix modern are «human dimensional» natural sciences and two paradigmal «nuclei» (attraktors). As a result, the complication of structure of disciplinary matrix and forming a few paradigm nuclei in modern «human dimensional» natural sciences are observed.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  12.  59
    James H. Fetzer (1991). Philosophical Aspects of Program Verification. Minds and Machines 1 (2):197-216.
    A debate over the theoretical capabilities of formal methods in computer science has raged for more than two years now. The function of this paper is to summarize the key elements of this debate and to respond to important criticisms others have advanced by placing these issues within a broader context of philosophical considerations about the nature of hardware and of software and about the kinds of knowledge that we have the capacity to acquire concerning their performance.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  13.  34
    J. W. Meiland (1966). Analogy, Verification, and Other Minds. Mind 75 (October):564-568.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  14.  8
    Francien Dechesne & Yanjing Wang (2010). To Know or Not to Know: Epistemic Approaches to Security Protocol Verification. Synthese 177 (Supplement-1):51-76.
    Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorpórate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis of security (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  15.  15
    Naomi Oreskes, Kristin Shrader-Frechette & Kenneth Belitz (1994). Verification, Validation, and Confirmation of Numerical Models in the Earth Sciences. Science 263 (5147):641-646.
    Verification and validation of numerical models of natural systems is impossible. This is because natural systems are never closed and because model results are always nonunique. Models can be confirmed by the demonstration of agreement between observation and prediction, but confirmation is inherently partial. Complete confirmation is logically precluded by the fallacy of affirming the consequent and by incomplete access to natural phenomena. Models can only be evaluated in relative terms, and their predictive value is always open to question. (...)
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   25 citations  
  16.  10
    Cheshko Valentin & Yulia Kosova (2015). The Semantics of Transdisciplinary Concepts of Socio-Natural Co-Evolution: A Constructive Utopia, Social Verification and Evolutionary Risk. In Teodor N. Țîrdea (ed.), Strategia supravie uirii din perspectiva bioeticii, filosofiei și medicinei. Culegere de articole științifice. Vol. 21 / Sub redacția prof. univrsitar, dr. hab. în filosofie . – Chișinău: Print-Caro. Print-Caro 112-116.
    The utopian character of modern scientific theories, with the human nature as a subject, is an inevitable consequence of the presence of an imperative component of transdisciplinary human dimensional scientific knowledge. Its social function is the adaptation of the descriptive component of the theory to the given socio-cultural type that simplifies the passage of the process of social verification of the theory. The genesis of bioethics can be seen as one of the basic premises for the actualization of the (...)
    Direct download  
     
    Export citation  
     
    My bibliography  
  17. Harvey Friedman, Adventures in the Verification of Mathematics.
    Mathematical statements arising from program verification are believed to be much easier to deal with than statements coming from serious mathematics. At least this is true for “normal programming”.
     
    Export citation  
     
    My bibliography  
  18.  23
    Nicola Angius (2013). Abstraction and Idealization in the Formal Verification of Software Systems. Minds and Machines 23 (2):211-226.
    Questions concerning the epistemological status of computer science are, in this paper, answered from the point of view of the formal verification framework. State space reduction techniques adopted to simplify computational models in model checking are analysed in terms of Aristotelian abstractions and Galilean idealizations characterizing the inquiry of empirical systems. Methodological considerations drawn here are employed to argue in favour of the scientific understanding of computer science as a discipline. Specifically, reduced models gained by Dataion are acknowledged as (...)
    Direct download (15 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  19.  83
    James H. Fetzer (1988). Program Verification: The Very Idea. Communications of the Acm 31 (9):1048--1063.
    The notion of program verification appears to trade upon an equivocation. Algorithms, as logical structures, are appropriate subjects for deductive verification. Programs, as causal models of those structures, are not. The success of program verification as a generally applicable and completely reliable method for guaranteeing program performance is not even a theoretical possibility.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography   13 citations  
  20.  77
    Mark D. Semon (1982). Experimental Verification of an Aharonov-Bohm Effect in Rotating Reference Frames. Foundations of Physics 12 (1):49-57.
    A thought experiment is reviewed which shows two things. First, in a region of a rotating frame that is not simply connected, the inertial forces can be canceled without completely canceling the inertial vector potential (whose curl determines the Coriolis force); second, the presence of this uncanceled potential can be detected in a quantum interference experiment. It is then argued that the thought experiment was realized in an earlier experiment involving a rotating superconductor, and that the experimental results confirm the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  21. Cora Diamond (1999). How Old Are These Bones? Putnam, Wittgenstein and Verification: Cora Diamond. Aristotelian Society Supplementary Volume 73 (1):99–134.
    Hilary Putnam has argued against philosophical theories which tie the content of truth-claims closely to the available methods of investigation and verification. Such theories, he argues, threaten our idea of human communication, which we take to be possible between people of different cultures and across periods of time during which methods of investigation change dramatically. Putnam rejects any reading of Wittgenstein which takes him to make a close tie between meaning and method of verification. What strands in Wittgenstein's (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  22.  10
    Vitaly Pronskikh, Computer Modeling and Simulation: Towards Epistemic Distinction Between Verification and Validation.
    Verification and validation of computer codes and models used in simulation are two aspects of the scientific practice of high importance and have recently been discussed by philosophers of science. While verification is predominantly associated with the correctness of the way a model is represented by a computer code or algorithm, validation more often refers to model’s relation to the real world and its intended use. It has been argued that because complex simulations are generally not transparent to (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  23.  54
    Alexander Miller (1998). Emotivism and the Verification Principle. Proceedings of the Aristotelian Society 98 (2):103–124.
    In chapter VI of Language, Truth, and Logic, A.J. Ayer argues that ethical statements are not literally significant. Unlike metaphysical statements, however, ethical statements are not nonsensical: even though they are not literally significant, Ayer thinks that they possess some other sort of significance. This raises the question: by what principle or criterion can we distinguish, among the class of statements that are not literally significant, between those which are genuinely meaningless and those which possess some other, non-literal form of (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  24.  1
    Dov Gabbay (2008). A Sound And Complete Deductive System For Ctl* Verification. Logic Journal of the IGPL 16 (6):499-536.
    The paper presents a compositional approach to the verification of CTL* properties over reactive systems. Both symbolic model-checking and deductive verification are considered. Both methods are based on two decomposition principles. A general state formula is decomposed into basic state formulas which are CTL* formulas with no embedded path quantifiers. To deal with arbitrary basic state formulas, we introduce another reduction principle which replaces each basic path formula, i.e., path formulas whose principal operator is temporal and which contain (...)
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  25.  7
    Samuel C. Fletcher, Model Verification and the Likelihood Principle.
    The likelihood principle is typically understood as a constraint on any measure of evidence arising from a statistical experiment. It is not sufficiently often noted, however, that the LP assumes that the probability model giving rise to a particular concrete data set must be statistically adequate—it must “fit” the data sufficiently. In practice, though, scientists must make modeling assumptions whose adequacy can nevertheless then be verified using statistical tests. My present concern is to consider whether the LP applies to these (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  26.  19
    Claudia Wiesemann (2011). Is There a Right Not to Know One's Sex? The Ethics of 'Gender Verification' in Women's Sports Competitions. Journal of Medical Ethics 37 (4):216-220.
    The paper discusses the current medical practice of "gender verification" in sports from an ethical point of view. It takes the recent public discussion about 800-meter runner Caster Semenya as a starting point. At the World Championships in Athletics 2009 in Berlin, Germany, Semenya was challenged by competitors as being a so called "sex impostor". A medical examination to verify her sex ensued. The author analyses whether athletes like Semenya could claim a right not to know that is generally (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  27.  4
    Selmer Bringsjord (2015). A Vindication of Program Verification. History and Philosophy of Logic 36 (3):262-277.
    Fetzer famously claims that program verification is not even a theoretical possibility, and offers a certain argument for this far-reaching claim. Unfortunately for Fetzer, and like-minded thinkers, this position-argument pair, while based on a seminal insight that program verification, despite its Platonic proof-theoretic airs, is plagued by the inevitable unreliability of messy, real-world causation, is demonstrably self-refuting. As I soon show, Fetzer is like the person who claims: ‘My sole claim is that every claim expressed by an English (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  28.  31
    Peter Milne (1991). Verification, Falsification, and the Logic of Enquiry. Erkenntnis 34 (1):23 - 54.
    Our starting point is Michael Luntley's falsificationist semantics for the logical connectives and quantifiers: the details of his account are criticised but we provide an alternative falsificationist semantics that yields intuitionist logic, as Luntley surmises such a semantics ought. Next an account of the logical connectives and quantifiers that combines verificationist and falsificationist perspectives is proposed and evaluated. While the logic is again intuitionist there is, somewhat surprisingly, an unavoidable asymmetry between the verification and falsification conditions for negation, the (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  29.  29
    Andreas Blank (2011). Wittgenstein on Verification and Seeing-As, 1930–1932. Inquiry 54 (6):614 - 632.
    Abstract This article examines the little-explored remarks on verification in Wittgenstein's notebooks during the period between 1930 and 1932. In these remarks, Wittgenstein connects a verificationist theory of meaning with the notion of logical multiplicity, understood as a space of possibilities: a proposition is verified by a fact if and only if the proposition and the fact have the same logical multiplicity. But while in his early philosophy logical multiplicities were analysed as an outcome of the formal properties of (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  30.  15
    Maria Trumpler (1997). Verification and Variation: Patterns of Experimentation in Investigations of Galvanism in Germany, 1790-1800. Philosophy of Science 64 (4):84.
    Based on the historical case of galvanic experimentation in Germany, I identify five types of experimentation which explored and shaped the new phenomenon rather than tested theoretical predictions. Verification evaluated initial reports of Galvani's phenomenon. Simplification reduced the experimental protocol to the fewest and most basic steps. Optimization found experimental conditions that magnified the observed effect. Exploration tested a wide variety of metals, animals or configurations. Application modified the experiment to address unresolved related problems. Attempts to derive laws of (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31.  15
    D. P. Dryer (1966). Kant's Solution for Verification in Metaphysics. Toronto, University of Toronto Press.
    First published in 1966. Professor Dryer has furnished a highly illuminating account of Kant’s _Critique of Pure Reason _by unfolding its central argument. _Kant’s Solution for Verification in Metaphysics _brings out the light which Kant has to throw on central topics of philosophy. It takes its place as an indispensable guide to every student of the _Critique of Pure Reason. _.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  32.  7
    P. H. Esser (1956). B. “Verification” of Statements in Psychiatry. Synthese 10 (1):373-377.
    (1) It remains to be seen if in the field of Psychiatry just as in that of Psychology the verbal output of a subject can be submitted to verification. Many statements of a highly emotional character being merely symptoms of certain dispositions have no direct communicative sense at all.(2) It being one of the characteristics of the mentally ill to loose contact and exchange of ideas with other people, the question naturally suggests itself if this symptom may be at (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  33.  12
    Anna Szabolcsi, Lewis Bott & Brian McElree (2008). The Effect of Negative Polarity Items on Inference Verification. Journal of Semantics 25 (4):411-450.
    The scalar approach to negative polarity item (NPI) licensing assumes that NPIs are allowable in contexts in which the introduction of the NPI leads to proposition strengthening (e.g., Kadmon & Landman 1993, Krifka 1995, Lahiri 1997, Chierchia 2006). A straightforward processing prediction from such a theory is that NPI’s facilitate inference verification from sets to subsets. Three experiments are reported that test this proposal. In each experiment, participants evaluated whether inferences from sets to subsets were valid. Crucially, we manipulated (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  34.  1
    Richard Lassaigne & Sylvain Peyronnet (2008). Probabilistic Verification and Approximation. Annals of Pure and Applied Logic 152 (1):122-131.
    We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification. However, in many applications, specifications can be expressed by monotone formulas or negation of monotone formulas and randomized approximation schemes with absolute error (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  35. D. P. Dryer (2016). Kant's Solution for Verification in Metaphysics. Routledge.
    First published in 1966. Professor Dryer has furnished a highly illuminating account of Kant’s _Critique of Pure Reason _by unfolding its central argument. _Kant’s Solution for Verification in Metaphysics _brings out the light which Kant has to throw on central topics of philosophy. It takes its place as an indispensable guide to every student of the _Critique of Pure Reason. _.
    No categories
     
    Export citation  
     
    My bibliography  
  36. Moshe Y. Vardi (1991). Verification of Concurrent Programs: The Automata-Theoretic Framework. Annals of Pure and Applied Logic 51 (1-2):79-98.
    Vardi, M.Y., Verification of concurrent programs: the automata-theoretic framework, Annals of Pure and Applied Logic 51 79–98. We present an automata-theoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if a program PA, obtained by combining P (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  37. Michael Power (1999). The Audit Society: Rituals of Verification. British Journal of Educational Studies 47 (1):92-94.
     
    Export citation  
     
    My bibliography   71 citations  
  38.  54
    Valentin Cheshko & Yulia Kosova (2012). SOCIAL VERIFICATION – HUMAN DIMENSONS OF THEORETICAL SCIENCE AND HIGH-TECH (CASUS BIOETHICS). Part Three. DYNAMICS OF GROWTH OF NEW KNOWLEDGE IN POSTACADEMICAL SCIENCE. Practical Philosophy 1:59-69.
  39. Bede Rundle (1972). Perception, Sensation, and Verification. Oxford University Press.
  40. Moritz Schlick (1936). Meaning and Verification. Philosophical Review 45 (4):339-369.
  41.  15
    William B. Swann Jr, Peter J. Rentfrow & Jennifer S. Guinn (2003). Self-Verification: The Search for Coherence. In Mark R. Leary & June Price Tangney (eds.), Handbook of Self and Identity. Guilford Press 367.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  42. Alan R. White (1954). A Note on Meaning and Verification. Mind 63 (249):66-69.
  43. Harvey M. Friedman, Decision Procedures for Verification.
    We focus on two formal methods contexts which generate investigations into decision problems for finite strings.
    No categories
    Translate
     
     
    Export citation  
     
    My bibliography  
  44.  85
    Jeremy Avigad (2010). Understanding, Formal Verification, and the Philosophy of Mathematics. Journal of the Indian Council of Philosophical Research 27:161-197.
    The philosophy of mathematics has long been concerned with deter- mining the means that are appropriate for justifying claims of mathemat- ical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosophers have called attention to the fact that a much broader range of normative judgments arise in ordinary math- ematical practice; for example, questions can be interesting, theorems important, proofs explanatory, concepts powerful, and so on. The as- sociated values are often loosely classied as (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  45.  4
    Vicki Bruce, Zoë Henderson, Karen Greenwood, Peter J. B. Hancock, A. Mike Burton & Paul Miller (1999). Verification of Face Identities From Images Captured on Video. Journal of Experimental Psychology: Applied 5 (4):339.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   9 citations  
  46. Alan Donagan (1956). The Verification of Historical Theses. Philosophical Quarterly 6 (24):193-208.
  47. Ernest Nagel (1934). Verifiability, Truth, and Verification. Journal of Philosophy 31 (6):141-148.
  48. Felix Kaufmann (1943). Verification, Meaning, and Truth. Philosophy and Phenomenological Research 4 (2):267-284.
  49. Crispin Wright (1989). The Verification Principle: Another Puncture--Another Patch. Mind 98 (392):611-622.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  50. L. E. Palmieri (1955). Verification and Descriptive Predicates. Philosophy and Phenomenological Research 15 (4):548-550.
1 — 50 / 727