1994
DOI: 10.1007/978-3-662-02962-6
|View full text |Cite
|
Sign up to set email alerts
|

Logic and Structure

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
37
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 80 publications
(37 citation statements)
references
References 0 publications
0
37
0
Order By: Relevance
“…If the type domain Θ contains first-and second-order types only and at least one second-order type, then we shall say that the signature Σ g and the language LpΣ g q have the second order (see [2,Appendix], [4,4]). In this case the notations Σ g 2 and LpΣ g 2 q will be used.…”
Section: Parenthesismentioning
confidence: 99%
See 1 more Smart Citation
“…If the type domain Θ contains first-and second-order types only and at least one second-order type, then we shall say that the signature Σ g and the language LpΣ g q have the second order (see [2,Appendix], [4,4]). In this case the notations Σ g 2 and LpΣ g 2 q will be used.…”
Section: Parenthesismentioning
confidence: 99%
“…The semantics for the language LpΣ g 2 q differs both from the standard semantics (see [2,Appendix], [3, §16]) and from the Henkin semantics (see [2,Appendix], [3, §21], [4,4], and [5,6,7]), which restricts the range of values of the evaluation γpx τ q for a variable x τ of a second-order type τ by some subset of the set Ppτ pAqq of the terminal τ pAq.…”
Section: Introductionmentioning
confidence: 99%
“…where A ⊔ B stands for the logical disjunction of A and B, the double-bracket notation denotes a valuation [2,3], that is, a mapping from the set of atomic propositions, symbolized by P, to the Boolean domain B 2 (the set of truth values, true and false, renamed to 1 and 0, correspondingly), i.e., v :…”
Section: Introductionmentioning
confidence: 99%
“…Now, recall that in accordance with the Kochen-Specker theorem [4], it is impossible to assign truth values to all experimental propositions associated with a quantum system in a consistent manner. In detail, this theorem (usually called the KS theorem) asserts that there always exists a set S of compatible experimental propositions about the quantum system characterized by N -dimensional Hilbert space H, such that all propositions in S cannot have truth values satisfying the rules (1) and (2).…”
Section: Introductionmentioning
confidence: 99%
“…Formal inferencing, in contrast to rational reconstruction, is already treated in the literature extensively. For sociological examples, see for instance~Péli et al1994;Péli 1997;Péli and Masuch 1997;Kamps Pólos 1999!. …”
mentioning
confidence: 99%