No label defined (Q4789156)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1859180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1859180 |
Statements
19 November 2003
0 references
relevant logic
0 references
completeness
0 references
two-level relational semantics
0 references
0.86196476
0 references
0 references
0 references
0.84795177
0 references
0.8446749
0 references
0.84457827
0 references
0.84221804
0 references
The two-level relational semantics \(S\) was previously defined by the author [e.g. in: A. S. Karpenko et al. (eds.), Logical investigations. 6, 81-108 (1999; Zbl 1003.03520)]. In this paper the propositional calculus NR is defined as well as rules of inference. The completeness theorem is proved for this system: Formula \(B\) is provable in NR if it is valid in \(S\) (for the language of NR). For the entire collection see [Zbl 0989.00031].
0 references