Predicate Logic with Definitions
| dc.creator | Makarov, Victor | |
| dc.date | 1999-06-07 | |
| dc.date.accessioned | 2026-07-07T03:24:08Z | |
| dc.date.available | 2026-07-07T03:24:08Z | |
| dc.description | Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition is a definition of variables, a definition of constants, or a composite definition (D-logic has also abbreviation definitions called abbreviations). Definitions can be used inside terms and formulas. This possibility alleviates introducing new quantifier-like names. Composite definitions allow constructing new definitions from existing ones. | |
| dc.description | 15 pages | |
| dc.identifier | https://arxiv.org/abs/cs/9906010 | |
| dc.identifier | http://arxiv.org/abs/cs/9906010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33212 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1; I.2.4 | |
| dc.title | Predicate Logic with Definitions | |
| dc.type | text |