This document introduces the formal language of propositional logic. It defines the basic alphabet which includes propositional symbols, logical constants, and connectives. Propositional symbols represent propositions that can be true or false. Connectives like "and", "or", and "not" represent ways to combine propositions. Well-formed formulas are defined as combinations of elements from the alphabet that follow certain syntactic rules, just as natural languages have rules for valid combinations of words. The document notes some limitations of propositional logic in capturing all aspects of meaning in natural language propositions.

1. 3$57(,
/Ï*,$)250$/

2. DStWXOR$/LQJXDJHPGD/yJLFD3URSRVLFLRQDO
2$OIDEHWRGD/yJLFD3URSRVLFLRQDO
(VWDPRV LQLFLDQGR DTXL R HVWXGR GD OyJLFD SURSRVLFLRQDO (VWH HVWXGR SUHWHQGH PRVWUDU
FRPRSRGHPRVDSDUWLUGRVGLVFXUVRVHPLWLGRVHPOLQJXDJHPQDWXUDOUHHVFUHYrORVQXPD
QRWDomR VLPEyOLFD H FRP PpWRGRV DGHTXDGRV GH DQiOLVH SURFHGHU D XPD LQYHVWLJDomR
VLVWHPiWLFDGRVHXFDUiWHUGHYHUGDGHRXIDOVLGDGH
8PWDOHVWXGRHQWUHWDQWRLPSOLFDGHVGHRLQtFLRQDSRVVLELOLGDGHGHWHUPRVSDUDR
kPELWR GD OyJLFD SURSRVLFLRQDO SULPHLUDPHQWH

3. XPD FDSDFLGDGH GH VLPEROL]DomR 2
HOHPHQWREiVLFRTXHQRVIRUQHFHXPDWDOSRVVLELOLGDGHpRDOIDEHWR
$VVLPSUHFLVDPRVFRPHoDUQRVVRHVWXGRDSDUWLUGDGHILQLomREiVLFDGHXPDOIDEHWR
SDUDDOyJLFDSURSRVLFLRQDODOpPGDGHILQLomRGHXPDVLQWD[HRXVHMDGHXPFRQMXQWRGH
UHJUDV TXH GLIHUHQFLH FRQVWUXo}HV EHP IRUPDGDV IHLWDV D SDUWLU GR DOIDEHWR H GH FHUWDV
UHJUDVJUDPDWLFDLVGDVPDOIRUPDGDV
'HILQLomR DOIDEHWR GD OyJLFD SURSRVLFLRQDO

4. 2 DOIDEHWR GD OyJLFD SURSRVLFLRQDO p
FRQVWLWXtGRSRU
D

5. 6tPERORVGHSRQWXDomR³³³

6. ´
E

7. RQVWDQWHVOyJLFDVRXVtPERORVGHYHUGDGH

8. YHUGIDOVR
F