The Bulletin of Symbolic LogicAssociation for Symbolic Logic, 2000 - Electronic journals |
From inside the book
Results 1-3 of 86
Page 68
... sentences , which will be called a first - order logic . We denote by ( L ) the set of existential second - order sentences whose first - order part belongs to L. Monadic Σ¦ ( L ) is defined similarly . The focus on Σ dates back to ...
... sentences , which will be called a first - order logic . We denote by ( L ) the set of existential second - order sentences whose first - order part belongs to L. Monadic Σ¦ ( L ) is defined similarly . The focus on Σ dates back to ...
Page 171
... sentences that are not true or false . A normative sentence such as ( 1 ) Jane ought to help her brother . cannot be true or false ( or at least , for the sake of argument , let us assume that it cannot ) . Therefore , a formal sentence ...
... sentences that are not true or false . A normative sentence such as ( 1 ) Jane ought to help her brother . cannot be true or false ( or at least , for the sake of argument , let us assume that it cannot ) . Therefore , a formal sentence ...
Page 384
... sentences . It is commitment conditions which provide the basis for evaluating arguments , because asserting , denying , and supposing some sentences will commit a person to asserting , denying , and supposing others . Illocutionary ...
... sentences . It is commitment conditions which provide the basis for evaluating arguments , because asserting , denying , and supposing some sentences will commit a person to asserting , denying , and supposing others . Illocutionary ...
Contents
Towards a reevaluation of Julius Königs contribution to logic by MIRIAM | 45 |
S Shelah Proper and improper forcing Reviewed by Péter Komjáth | 83 |
Kurt Schütte 19091998 by WOLFRAM POHLERS | 101 |
Copyright | |
21 other sections not shown
Other editions - View all
Common terms and phrases
abstract algebra analysis applications arithmetic Association for Symbolic automorphism axiomatic Boolean Brouwer classical Comp complete computable structure Computer Science condition consistency construction continuum countable decision problem definition Department of Mathematics Dept discussion domain E-mail editors elementary equivalent Euler characteristic example existence Feferman finite first-order formal formula Fraenkel functions Gödel Grothendieck ring hierarchy Hilbert infinite integer interpolation interpretation intuitionism intuitionistic isomorphic Journal of Symbolic language large cardinal axioms lemma machine many-sorted Math mathematical logic Mathematical Society mathematicians measurable cardinals method modal logic model theory natural numbers nonstandard notion number theory o-minimal ordinal P.O. Box paper PENELOPE MADDY Philos Philosophy polynomial predicate principle probability probability amplitudes proof theory properties propositional proved quantifiers quantum computer question real numbers recursive relation semantics sentences sequence set theory subsets Symbolic Logic Tarski theorem type theory Univ University variables Woodin Woodin cardinals