Jump to ContentJump to Main Navigation
Wittgenstein's Notes on Logic$
Users without a subscription are not able to see the full content.

Michael Potter

Print publication date: 2008

Print ISBN-13: 9780199215836

Published to Oxford Scholarship Online: January 2009

DOI: 10.1093/acprof:oso/9780199215836.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 09 April 2020

Truth-operations

Truth-operations

Chapter:
(p.165) Chapter 18 Truth-operations
Source:
Wittgenstein's Notes on Logic
Author(s):

Michael Potter (Contributor Webpage)

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199215836.003.0018

From a single proposition p we form its negation not-p. From two propositions p and q we form various further propositions, e.g., p or q, p and q, etc.; similarly (though less often) with three or more propositions. For each such method of forming propositions it is common to speak of a certain truth-function as corresponding to it. On the one hand, there is a function which takes senses of propositions as inputs and returns the sense of a proposition as output. On the other hand, there is a truth-function, i.e., a function taking some finite number of truth-values as arguments and giving a single truth-value as value, which is representable by a truth-table or truth-diagram. This chapter discusses the relationship between the two.

Keywords:   truth-table, truth-function, propositions, truth-diagram

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .