http://glottopedia.org/index.php?action=history&feed=atom&title=ConnectiveConnective - Revision history2026-04-22T20:41:50ZRevision history for this page on the wikiMediaWiki 1.34.2http://glottopedia.org/index.php?title=Connective&diff=6111&oldid=prevLuo: from Utrecht Lexicon of Linguistics2008-05-14T13:02:12Z<p>from Utrecht Lexicon of Linguistics</p>
<p><b>New page</b></p><div>In semantics, '''connective''' is a logical operator which combines with one or more [[formula]]s to form a more complex [[formula]].<br />
<br />
===Examples===<br />
Binary connectives, like &, v, -> and <->, combine with two formulas as in (i), the unary connective Neg combines with one formula as in (ii).<br />
<br />
(i) <br />
Phi & Psi (and)<br />
Phi v Psi (or)<br />
Phi -> Psi (if ... then ...)<br />
Phi <-> Psi (... if and only if ...)<br />
(ii) <br />
Neg Phi (not)<br />
<br />
===Comment===<br />
The truth-value of the complex formula is always a function (a truth-function) of the truth-values of the formulas Phi and Psi, which can be represented in a [[truth table]].<br />
<br />
===Link===<br />
[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Connective&lemmacode=916 Utrecht Lexicon of Linguistics] <br />
<br />
===Reference===<br />
Gamut, L.T.F. 1991. ''Logic, language, and meaning.'' Chicago: University of Chicago Press.<br />
<br />
{{dc}}<br />
[[Category:Semantics]]</div>Luo