Geometry.net Online Store

Geometry.Net - the online learning center
Home  - Mathematical_Logic - Set-theoretic Definability
  
Images 
Newsgroups
Page 1     1-57 of 57    1 

1. Logic And Language Links - Set-theoretic Definability
Settheoretic definability is a subtopic of set theory. Set-theoretic definability has currently no subtopics. Long description Not available yet.
http://staff.science.uva.nl/~caterina/LoLaLi/Pages/398.html
Siblings tell me more...
under set theory TOP You have selected the concept set-theoretic definability This concept has currently no gloss. set-theoretic definability is a:
subtopic of set theory
set-theoretic definability has currently no subtopics. Long description: Not available yet.
Search the hierarchy with v7
Caterina Caracciolo home page
Home Search this site with Dowser
Page generated on: 2004:9:7, 15:41 Information about LoLaLi.net Handbook
  • Not available yet
tell me more...

2. Wilfrid Hodges: Set-theoretic Definability Of Constructions - Progress Report On
Settheoretic definability of Constructions - Progress Report on a Disgracefully Old Problem. Wilfrid Hodges Queen Mary, London
http://www.dcs.bbk.ac.uk/~roman/blc/hodges.html
Set-theoretic Definability of Constructions - Progress Report on a Disgracefully Old Problem
Wilfrid Hodges
Queen Mary, London
In 1976 I asked for a proof that there is no formula of the language of ZFC which, provably in every model of ZFC, defines for each field an algebraic closure of that field. After many failed attempts Shelah and I put together a proof in 2001. The field-theoretic part (basically Galois theory) appeared in the Proceedings of the Oviedo DLMPS. The set-theoretic part (due to Shelah) is not yet in definitive form; it proves the result but something cleaner and stronger should also be true. back to BLC 2007 British Logic Colloquium
Roman Kontchakov
, last changed 12 July 2007

3. 91SUB.TEX Renamed Msc.new EDITED FOR SCREEN USE 11-28-90 % 11-29
03C52 Properties of classes of models 03C55 Settheoretic model theory 03C57 and related notions 03E47 Other notions of Set-theoretic definability 03E50
http://www.math.uiuc.edu/documenta/AMS-MSC/MSC91

4. Tree Structure Of LoLaLi Concept Hierarchy Updated On 2004624
398 Settheoretic definability . . . . Not 391 iota operator . . . . 384 determinacy . . . . 387 fuzzy relation . . . . Not 385 filter .
http://remote.science.uva.nl/~caterina/LoLaLi/soft/ch-data/tree.txt
Tree structure of LoLaLi Concept Hierarchy Updated on 2004:6:24, 13:16 In each line the following information is shown (in order from left to right, [OPT] indicates information that can be missing): Type of relation with the parent concept (see below for the legend) [OPT] Id of the node Name of the node Number of children, in parenthesis [OPT] + if the concept is repeated somehwere [OPT] (see file path.txt for the list of repeated nodes) LEGEND: SbC Subclass Par Part-of Not Notion Res Mathematical results His historical view Ins Instance Uns Unspecified top (4) g . 87 computer science (4) g . . 191 logic (1) (31) + g . . . Par 53 automated reasoning (25) + . . . . 35 belief revision . . . . . 76 update . . . . 67 nonmonotonic reasoning . . . . 63 mathematical induction . . . . 71 rewrite system (3) . . . . . 350 termination . . . . . 348 confluence . . . . . 349 critical pair . . . . 70 resolution (7) + . . . . . 339 purity principle . . . . . 342 simplification . . . . . 337 demodulation . . . . . 338 ordering . . . . . 340 removal of tautologies . . . . . 341 resolution refinement (4) . . . . . . 345 lock resolution . . . . . . 344 hyper resolution . . . . . . 347 theory resolution . . . . . . 346 set of support . . . . . 343 subsumption . . . . 68 paramodulation . . . . Not 72 skolemisation . . . . 65 model checking . . . . 55 clause 55 (2) . . . . . 80 horn clause g . . . . . 79 Gentzen clause . . . . 74 uncertainty . . . . 75 unification + . . . . 57 connection graph procedure . . . . 64 metatheory . . . . 61 literal . . . . 58 connection matrix . . . . 81 clause 81 . . . . . SbC 82 relative clause . . . . 69 reason extraction . . . . 59 deduction (7) + . . . . . Not 109 inconsistency . . . . . 106 consequence g . . . . . SbC 494 labelled deductive system . . . . . 111 rule-based deduction . . . . . Not 108 entailment + . . . . . 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . Not 107 consistency + . . . . Res 60 Herbrand's theorem . . . . 56 completion . . . . . 86 Knuth Bendix completion . . . . 73 theorem prover (3) . . . . . 427 Bliksem g . . . . . 428 Boyer-Moore theorem prover . . . . . 429 SPASS g . . . . 66 narrowing . . . . 62 logic programming g . . . . 54 answer extraction . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . Par 198 proof theory (22) g . . . . SbC 503 sequent calculus . . . . . Not 484 structural rules . . . . 289 interpretation . . . . 282 constructive analysis . . . . 295 recursive ordinal . . . . 287 Goedel numbering . . . . 288 higher-order arithmetic . . . . 281 complexity of proofs . . . . 294 recursive analysis . . . . Res 292 normal form theorem . . . . 297 second-order arithmetic . . . . SbC 110 natural deduction (2) + g . . . . . Not 482 hypothetical reasoning + . . . . . Not 483 normalization . . . . 290 intuitionistic mathematics . . . . 286 functionals in proof theory . . . . 298 structure of proofs g . . . . 283 constructive system . . . . 291 metamathematics . . . . 59 deduction (7) + . . . . . Not 109 inconsistency . . . . . 106 consequence g . . . . . SbC 494 labelled deductive system . . . . . 111 rule-based deduction . . . . . Not 108 entailment + . . . . . 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . Not 107 consistency + . . . . 296 relative consistency . . . . Not 284 cut elimination theorem g . . . . 293 ordinal notation . . . . 285 first-order arithmetic . . . . SbC 485 proof nets . . . SbC 475 first order logic (4) g . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . Par 476 first order language g . . . . . Not 477 fragment (3) g . . . . . . SbC 479 finite-variable fragment g . . . . . . SbC 480 guarded fragment g . . . . . . SbC 478 modal fragment g . . . . . . . Not 470 standard translation + g . . . . 511 SPASS g . . . . Par 515 quantification (4) + . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . 193 computability theory . . . SbC 167 temporal logic (2) + g . . . 435 type theory (2) + . . . . 433 type . . . . . 434 type shifting . . . . Not 23 polymorphism + g . . . 495 substructural logic . . . SbC 200 relevance logic + . . . . 108 entailment + . . . Res 180 Lindstroem's theorem + . . . SbC 481 linear logic . . . 526 variable g . . . . SbC 517 free variable + g . . . Res 179 Goedel's 1st incompleteness theorem (1931) + g . . . SbC 125 feature logic + . . . . 75 unification + . . . 197 model theory (29) . . . . 237 set-theoretic model theory . . . . 11 universal algebra + . . . . 225 infinitary logic . . . . 217 admissible set . . . . 234 recursion-theoretic model theory . . . . 239 ultraproduct . . . . 227 logic with extra quantifiers . . . . SbC 457 modal model theory (7) + . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Not 461 generated submodel g . . . . . 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . . Not 459 disjoint union of models g . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . . Not 469 expressive power g . . . . . . Not 470 standard translation + g . . . . . Not 460 bisimulation g . . . . 219 completeness of theories . . . . 235 saturation . . . . 222 equational class . . . . 238 stability . . . . 233 quantifier elimination . . . . 221 denumerable structure . . . . 228 model-theoretic algebra . . . . 236 second-order model theory . . . . 230 model of arithmetic . . . . 218 categoricity g . . . . 220 definability . . . . 226 interpolation . . . . SbC 454 first order model theory . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . 231 nonclassical model (2) . . . . . 246 sheaf model . . . . . 245 boolean valued . . . . 201 set theory (24) + g . . . . . 398 set-theoretic definability . . . . . Not 391 iota operator . . . . . 384 determinacy . . . . . 387 fuzzy relation . . . . . Not 385 filter . . . . . 389 generalized continuum hypothesis . . . . . 386 function (3) g . . . . . . 482 hypothetical reasoning + . . . . . . 509 functional application . . . . . . 508 functional composition . . . . . Not 394 ordinal definability . . . . . Not 107 consistency + . . . . . 397 set algebra . . . . . 399 Suslin scheme . . . . . SbC 383 descriptive set theory g . . . . . 388 fuzzy set g . . . . . 378 borel classification g . . . . . SbC 380 combinatorial set theory . . . . . Not 390 independence . . . . . 381 constructibility . . . . . 396 relation g . . . . . 377 axiom of choice g . . . . . 392 large cardinal . . . . . Not 395 ordinal number . . . . . 393 Martin's axiom . . . . . 382 continuum hypothesis g . . . . . Not 379 cardinal number . . . . 232 preservation . . . . 216 abstract model theory + . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . 229 model-theoretic forcing . . . . 224 higher-order model theory . . . . Par 493 correspondence theory . . . . 223 finite structure . . . Res 182 Loewenheim-Skolem-Tarski theorem + . . . Not 83 completeness (2) + g . . . . SbC 84 axiomatic completeness . . . . SbC 85 functional completeness + . . . SbC 156 modal logic (13) + g . . . . Ins 512 S4 . . . . 488 modes . . . . 486 frame (2) . . . . . SbC 487 frame constraints . . . . Par 210 modal operator (2) + g . . . . . SbC 472 diamond g . . . . . SbC 473 box g . . . . SbC 213 doxastic logic g . . . . Not 489 accessability relation + . . . . Par 471 modal language (2) g . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . 490 boolean operators . . . . SbC 211 alethic logic g . . . . SbC 212 deontic logic (3) g . . . . . SbC 521 standard deontic logic g . . . . . SbC 523 two-sorted deontic logic g . . . . . SbC 522 dyadic deontic logic g . . . . Par 215 Kripke semantics + g . . . . . Not 489 accessability relation + . . . . Par 457 modal model theory (7) + . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Not 461 generated submodel g . . . . . 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . . Not 459 disjoint union of models g . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . . Not 469 expressive power g . . . . . . Not 470 standard translation + g . . . . . Not 460 bisimulation g . . . . SbC 214 epistemic logic g . . . . Not 462 model (4) + . . . . . SbC 464 finite model g . . . . . SbC 466 image finite model . . . . . . Res 467 Hennessy-Milner theorem g . . . . . Par 463 valuation g . . . . . SbC 465 tree model g . . . 194 computational logic (2) . . . Not 183 operator (4) + g . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . SbC 210 modal operator (2) + g . . . . . SbC 472 diamond g . . . . . SbC 473 box g . . . . 518 truth-funcional operator (2) g . . . . . SbC 252 iff g . . . . . SbC 253 negation . . . . Not 525 arity g . . . SbC 192 combinatory logic g . . . Par 199 recursive function theory . . . 361 formal semantics (10) + g . . . . 365 property theory . . . . 240 Montague grammar (4) . . . . . 243 sense 243 (4) g . . . . . . 203 meaning relation (5) . . . . . . . 205 hyponymy g . . . . . . . 204 antonymy g . . . . . . . 207 synonymy g . . . . . . . . 149 intensional isomorphism + . . . . . . . 206 paraphrase g . . . . . . . 108 entailment + . . . . . . 375 metaphor g . . . . . . 376 metonymy g . . . . . . 374 literal meaning . . . . . 244 sense 244 g . . . . . 241 meaning postulate . . . . . 242 ptq g . . . . . . 300 quantifying in . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . 353 truth (4) + . . . . . 431 truth definition g . . . . . 432 truth value . . . . . 372 truth function + g . . . . . 430 truth condition . . . . 362 dynamic semantics . . . . 363 lexical semantics . . . . 366 situation semantics (2) g . . . . . 402 partiality . . . . . 400 situation . . . . . . 401 scene . . . . Not 507 compositionality . . . . 364 natural logic + . . . . Par 515 quantification (4) + . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . SbC 168 lambda calculus (4) g . . . . 170 application . . . . 172 lambda operator . . . . 169 abstraction . . . . 171 conversion . . . 38 knowledge representation (20) + g . . . . 152 frame (1) . . . . 104 database + g . . . . . 105 query g . . . . 165 situation calculus . . . . 167 temporal logic (2) + g . . . . 166 temporal logic (1) g . . . . 93 concept formation . . . . . 90 concept + . . . . . . 91 individual concept . . . . 154 logical omniscience . . . . 162 rule-based representation . . . . 157 predicate logic + g . . . . 159 procedural representation . . . . 161 representation language . . . . 156 modal logic (13) + g . . . . . Ins 512 S4 . . . . . 488 modes . . . . . 486 frame (2) . . . . . . SbC 487 frame constraints . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . SbC 213 doxastic logic g . . . . . Not 489 accessability relation + . . . . . Par 471 modal language (2) g . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . 490 boolean operators . . . . . SbC 211 alethic logic g . . . . . SbC 212 deontic logic (3) g . . . . . . SbC 521 standard deontic logic g . . . . . . SbC 523 two-sorted deontic logic g . . . . . . SbC 522 dyadic deontic logic g . . . . . Par 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Par 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . SbC 214 epistemic logic g . . . . . Not 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . 97 context (2) . . . . . 99 context dependence . . . . . 98 context change . . . . 160 relation system . . . . 153 frame problem g . . . . 92 concept analysis . . . . . 90 concept + . . . . . . 91 individual concept . . . . 163 script . . . . 145 idea g . . . . . 90 concept + . . . . . . 91 individual concept . . . . 164 semantic network g . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . Par 367 semantics 367 (8) g . . . . 371 truth conditional semantics . . . . 373 truth table . . . . SbC 215 Kripke semantics + g . . . . . Not 489 accessability relation + . . . . 85 functional completeness + . . . . 370 satisfaction . . . . 369 material implication g . . . . 368 assignment . . . . Not 372 truth function + g . . . Par 201 set theory (24) + g . . . . 398 set-theoretic definability . . . . Not 391 iota operator . . . . 384 determinacy . . . . 387 fuzzy relation . . . . Not 385 filter . . . . 389 generalized continuum hypothesis . . . . 386 function (3) g . . . . . 482 hypothetical reasoning + . . . . . 509 functional application . . . . . 508 functional composition . . . . Not 394 ordinal definability . . . . Not 107 consistency + . . . . 397 set algebra . . . . 399 Suslin scheme . . . . SbC 383 descriptive set theory g . . . . 388 fuzzy set g . . . . 378 borel classification g . . . . SbC 380 combinatorial set theory . . . . Not 390 independence . . . . 381 constructibility . . . . 396 relation g . . . . 377 axiom of choice g . . . . 392 large cardinal . . . . Not 395 ordinal number . . . . 393 Martin's axiom . . . . 382 continuum hypothesis g . . . . Not 379 cardinal number . . . Par 216 abstract model theory + . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . 178 compactness + . . . His 177 aristotelean logic (2) + g . . . . Par 39 syllogism g . . . . Par 513 Aristotle on quantification + . . . Par 196 foundations of theories . . . 195 constraint programming . . Not 88 software (2) . . . 104 database + g . . . . 105 query g . . . 275 programming language (3) . . . . 190 semantics 190 (8) + g . . . . . 356 denotational semantics . . . . . 119 domain theory g . . . . . . 120 domain . . . . . 360 program analysis . . . . . 359 process model . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . 357 operational semantics . . . . . 358 partial evaluation . . . . . 355 algebraic semantics . . . . 276 syntax 276 . . . . 277 prolog g . . . . . 70 resolution (7) + . . . . . . 339 purity principle . . . . . . 342 simplification . . . . . . 337 demodulation . . . . . . 338 ordering . . . . . . 340 removal of tautologies . . . . . . 341 resolution refinement (4) . . . . . . . 345 lock resolution . . . . . . . 344 hyper resolution . . . . . . . 347 theory resolution . . . . . . . 346 set of support . . . . . . 343 subsumption . . Par 34 artificial intelligence (5) g . . . Par 38 knowledge representation (20) + g . . . . 152 frame (1) . . . . 104 database + g . . . . . 105 query g . . . . 165 situation calculus . . . . 167 temporal logic (2) + g . . . . 166 temporal logic (1) g . . . . 93 concept formation . . . . . 90 concept + . . . . . . 91 individual concept . . . . 154 logical omniscience . . . . 162 rule-based representation . . . . 157 predicate logic + g . . . . 159 procedural representation . . . . 161 representation language . . . . 156 modal logic (13) + g . . . . . Ins 512 S4 . . . . . 488 modes . . . . . 486 frame (2) . . . . . . SbC 487 frame constraints . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . SbC 213 doxastic logic g . . . . . Not 489 accessability relation + . . . . . Par 471 modal language (2) g . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . 490 boolean operators . . . . . SbC 211 alethic logic g . . . . . SbC 212 deontic logic (3) g . . . . . . SbC 521 standard deontic logic g . . . . . . SbC 523 two-sorted deontic logic g . . . . . . SbC 522 dyadic deontic logic g . . . . . Par 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Par 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . SbC 214 epistemic logic g . . . . . Not 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . 97 context (2) . . . . . 99 context dependence . . . . . 98 context change . . . . 160 relation system . . . . 153 frame problem g . . . . 92 concept analysis . . . . . 90 concept + . . . . . . 91 individual concept . . . . 163 script . . . . 145 idea g . . . . . 90 concept + . . . . . . 91 individual concept . . . . 164 semantic network g . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . 191 logic (1) (31) + g . . . . Par 53 automated reasoning (25) + . . . . . 35 belief revision . . . . . . 76 update . . . . . 67 nonmonotonic reasoning . . . . . 63 mathematical induction . . . . . 71 rewrite system (3) . . . . . . 350 termination . . . . . . 348 confluence . . . . . . 349 critical pair . . . . . 70 resolution (7) + . . . . . . 339 purity principle . . . . . . 342 simplification . . . . . . 337 demodulation . . . . . . 338 ordering . . . . . . 340 removal of tautologies . . . . . . 341 resolution refinement (4) . . . . . . . 345 lock resolution . . . . . . . 344 hyper resolution . . . . . . . 347 theory resolution . . . . . . . 346 set of support . . . . . . 343 subsumption . . . . . 68 paramodulation . . . . . Not 72 skolemisation . . . . . 65 model checking . . . . . 55 clause 55 (2) . . . . . . 80 horn clause g . . . . . . 79 Gentzen clause . . . . . 74 uncertainty . . . . . 75 unification + . . . . . 57 connection graph procedure . . . . . 64 metatheory . . . . . 61 literal . . . . . 58 connection matrix . . . . . 81 clause 81 . . . . . . SbC 82 relative clause . . . . . 69 reason extraction . . . . . 59 deduction (7) + . . . . . . Not 109 inconsistency . . . . . . 106 consequence g . . . . . . SbC 494 labelled deductive system . . . . . . 111 rule-based deduction . . . . . . Not 108 entailment + . . . . . . 110 natural deduction (2) + g . . . . . . . Not 482 hypothetical reasoning + . . . . . . . Not 483 normalization . . . . . . Not 107 consistency + . . . . . Res 60 Herbrand's theorem . . . . . 56 completion . . . . . . 86 Knuth Bendix completion . . . . . 73 theorem prover (3) . . . . . . 427 Bliksem g . . . . . . 428 Boyer-Moore theorem prover . . . . . . 429 SPASS g . . . . . 66 narrowing . . . . . 62 logic programming g . . . . . 54 answer extraction . . . . . 247 nonmonotonic logic + g . . . . . . 248 default inference . . . . Par 198 proof theory (22) g . . . . . SbC 503 sequent calculus . . . . . . Not 484 structural rules . . . . . 289 interpretation . . . . . 282 constructive analysis . . . . . 295 recursive ordinal . . . . . 287 Goedel numbering . . . . . 288 higher-order arithmetic . . . . . 281 complexity of proofs . . . . . 294 recursive analysis . . . . . Res 292 normal form theorem . . . . . 297 second-order arithmetic . . . . . SbC 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . 290 intuitionistic mathematics . . . . . 286 functionals in proof theory . . . . . 298 structure of proofs g . . . . . 283 constructive system . . . . . 291 metamathematics . . . . . 59 deduction (7) + . . . . . . Not 109 inconsistency . . . . . . 106 consequence g . . . . . . SbC 494 labelled deductive system . . . . . . 111 rule-based deduction . . . . . . Not 108 entailment + . . . . . . 110 natural deduction (2) + g . . . . . . . Not 482 hypothetical reasoning + . . . . . . . Not 483 normalization . . . . . . Not 107 consistency + . . . . . 296 relative consistency . . . . . Not 284 cut elimination theorem g . . . . . 293 ordinal notation . . . . . 285 first-order arithmetic . . . . . SbC 485 proof nets . . . . SbC 475 first order logic (4) g . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . . Par 476 first order language g . . . . . . Not 477 fragment (3) g . . . . . . . SbC 479 finite-variable fragment g . . . . . . . SbC 480 guarded fragment g . . . . . . . SbC 478 modal fragment g . . . . . . . . Not 470 standard translation + g . . . . . 511 SPASS g . . . . . Par 515 quantification (4) + . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . 193 computability theory . . . . SbC 167 temporal logic (2) + g . . . . 435 type theory (2) + . . . . . 433 type . . . . . . 434 type shifting . . . . . Not 23 polymorphism + g . . . . 495 substructural logic . . . . SbC 200 relevance logic + . . . . . 108 entailment + . . . . Res 180 Lindstroem's theorem + . . . . SbC 481 linear logic . . . . 526 variable g . . . . . SbC 517 free variable + g . . . . Res 179 Goedel's 1st incompleteness theorem (1931) + g . . . . SbC 125 feature logic + . . . . . 75 unification + . . . . 197 model theory (29) . . . . . 237 set-theoretic model theory . . . . . 11 universal algebra + . . . . . 225 infinitary logic . . . . . 217 admissible set . . . . . 234 recursion-theoretic model theory . . . . . 239 ultraproduct . . . . . 227 logic with extra quantifiers . . . . . SbC 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . 219 completeness of theories . . . . . 235 saturation . . . . . 222 equational class . . . . . 238 stability . . . . . 233 quantifier elimination . . . . . 221 denumerable structure . . . . . 228 model-theoretic algebra . . . . . 236 second-order model theory . . . . . 230 model of arithmetic . . . . . 218 categoricity g . . . . . 220 definability . . . . . 226 interpolation . . . . . SbC 454 first order model theory . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . 231 nonclassical model (2) . . . . . . 246 sheaf model . . . . . . 245 boolean valued . . . . . 201 set theory (24) + g . . . . . . 398 set-theoretic definability . . . . . . Not 391 iota operator . . . . . . 384 determinacy . . . . . . 387 fuzzy relation . . . . . . Not 385 filter . . . . . . 389 generalized continuum hypothesis . . . . . . 386 function (3) g . . . . . . . 482 hypothetical reasoning + . . . . . . . 509 functional application . . . . . . . 508 functional composition . . . . . . Not 394 ordinal definability . . . . . . Not 107 consistency + . . . . . . 397 set algebra . . . . . . 399 Suslin scheme . . . . . . SbC 383 descriptive set theory g . . . . . . 388 fuzzy set g . . . . . . 378 borel classification g . . . . . . SbC 380 combinatorial set theory . . . . . . Not 390 independence . . . . . . 381 constructibility . . . . . . 396 relation g . . . . . . 377 axiom of choice g . . . . . . 392 large cardinal . . . . . . Not 395 ordinal number . . . . . . 393 Martin's axiom . . . . . . 382 continuum hypothesis g . . . . . . Not 379 cardinal number . . . . . 232 preservation . . . . . 216 abstract model theory + . . . . . . 254 quantifier (5) + g . . . . . . . Not 516 bound variable + g . . . . . . . His 514 Frege on quantification + g . . . . . . . Not 517 free variable + g . . . . . . . His 513 Aristotle on quantification + . . . . . . . Not 301 scope . . . . . . . . 351 scoping algorithm . . . . . 229 model-theoretic forcing . . . . . 224 higher-order model theory . . . . . Par 493 correspondence theory . . . . . 223 finite structure . . . . Res 182 Loewenheim-Skolem-Tarski theorem + . . . . Not 83 completeness (2) + g . . . . . SbC 84 axiomatic completeness . . . . . SbC 85 functional completeness + . . . . SbC 156 modal logic (13) + g . . . . . Ins 512 S4 . . . . . 488 modes . . . . . 486 frame (2) . . . . . . SbC 487 frame constraints . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . SbC 213 doxastic logic g . . . . . Not 489 accessability relation + . . . . . Par 471 modal language (2) g . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . 490 boolean operators . . . . . SbC 211 alethic logic g . . . . . SbC 212 deontic logic (3) g . . . . . . SbC 521 standard deontic logic g . . . . . . SbC 523 two-sorted deontic logic g . . . . . . SbC 522 dyadic deontic logic g . . . . . Par 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Par 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . SbC 214 epistemic logic g . . . . . Not 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . 194 computational logic (2) . . . . Not 183 operator (4) + g . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . . SbC 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . 518 truth-funcional operator (2) g . . . . . . SbC 252 iff g . . . . . . SbC 253 negation . . . . . Not 525 arity g . . . . SbC 192 combinatory logic g . . . . Par 199 recursive function theory . . . . 361 formal semantics (10) + g . . . . . 365 property theory . . . . . 240 Montague grammar (4) . . . . . . 243 sense 243 (4) g . . . . . . . 203 meaning relation (5) . . . . . . . . 205 hyponymy g . . . . . . . . 204 antonymy g . . . . . . . . 207 synonymy g . . . . . . . . . 149 intensional isomorphism + . . . . . . . . 206 paraphrase g . . . . . . . . 108 entailment + . . . . . . . 375 metaphor g . . . . . . . 376 metonymy g . . . . . . . 374 literal meaning . . . . . . 244 sense 244 g . . . . . . 241 meaning postulate . . . . . . 242 ptq g . . . . . . . 300 quantifying in . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . . 353 truth (4) + . . . . . . 431 truth definition g . . . . . . 432 truth value . . . . . . 372 truth function + g . . . . . . 430 truth condition . . . . . 362 dynamic semantics . . . . . 363 lexical semantics . . . . . 366 situation semantics (2) g . . . . . . 402 partiality . . . . . . 400 situation . . . . . . . 401 scene . . . . . Not 507 compositionality . . . . . 364 natural logic + . . . . . Par 515 quantification (4) + . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . SbC 168 lambda calculus (4) g . . . . . 170 application . . . . . 172 lambda operator . . . . . 169 abstraction . . . . . 171 conversion . . . . 38 knowledge representation (20) + g . . . . . 152 frame (1) . . . . . 104 database + g . . . . . . 105 query g . . . . . 165 situation calculus . . . . . 167 temporal logic (2) + g . . . . . 166 temporal logic (1) g . . . . . 93 concept formation . . . . . . 90 concept + . . . . . . . 91 individual concept . . . . . 154 logical omniscience . . . . . 162 rule-based representation . . . . . 157 predicate logic + g . . . . . 159 procedural representation . . . . . 161 representation language . . . . . 156 modal logic (13) + g . . . . . . Ins 512 S4 . . . . . . 488 modes . . . . . . 486 frame (2) . . . . . . . SbC 487 frame constraints . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . SbC 213 doxastic logic g . . . . . . Not 489 accessability relation + . . . . . . Par 471 modal language (2) g . . . . . . . Par 210 modal operator (2) + g . . . . . . . . SbC 472 diamond g . . . . . . . . SbC 473 box g . . . . . . . 490 boolean operators . . . . . . SbC 211 alethic logic g . . . . . . SbC 212 deontic logic (3) g . . . . . . . SbC 521 standard deontic logic g . . . . . . . SbC 523 two-sorted deontic logic g . . . . . . . SbC 522 dyadic deontic logic g . . . . . . Par 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Par 457 modal model theory (7) + . . . . . . . SbC 215 Kripke semantics + g . . . . . . . . Not 489 accessability relation + . . . . . . . Not 461 generated submodel g . . . . . . . 462 model (4) + . . . . . . . . SbC 464 finite model g . . . . . . . . SbC 466 image finite model . . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . . Par 463 valuation g . . . . . . . . SbC 465 tree model g . . . . . . . Not 459 disjoint union of models g . . . . . . . 455 homomorphism (2) + g . . . . . . . . SbC 456 bounded homomorphism g . . . . . . . . SbC 468 bounded morphism . . . . . . . Not 469 expressive power g . . . . . . . . Not 470 standard translation + g . . . . . . . Not 460 bisimulation g . . . . . . SbC 214 epistemic logic g . . . . . . Not 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . 97 context (2) . . . . . . 99 context dependence . . . . . . 98 context change . . . . . 160 relation system . . . . . 153 frame problem g . . . . . 92 concept analysis . . . . . . 90 concept + . . . . . . . 91 individual concept . . . . . 163 script . . . . . 145 idea g . . . . . . 90 concept + . . . . . . . 91 individual concept . . . . . 164 semantic network g . . . . . 247 nonmonotonic logic + g . . . . . . 248 default inference . . . . Par 367 semantics 367 (8) g . . . . . 371 truth conditional semantics . . . . . 373 truth table . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . 85 functional completeness + . . . . . 370 satisfaction . . . . . 369 material implication g . . . . . 368 assignment . . . . . Not 372 truth function + g . . . . Par 201 set theory (24) + g . . . . . 398 set-theoretic definability . . . . . Not 391 iota operator . . . . . 384 determinacy . . . . . 387 fuzzy relation . . . . . Not 385 filter . . . . . 389 generalized continuum hypothesis . . . . . 386 function (3) g . . . . . . 482 hypothetical reasoning + . . . . . . 509 functional application . . . . . . 508 functional composition . . . . . Not 394 ordinal definability . . . . . Not 107 consistency + . . . . . 397 set algebra . . . . . 399 Suslin scheme . . . . . SbC 383 descriptive set theory g . . . . . 388 fuzzy set g . . . . . 378 borel classification g . . . . . SbC 380 combinatorial set theory . . . . . Not 390 independence . . . . . 381 constructibility . . . . . 396 relation g . . . . . 377 axiom of choice g . . . . . 392 large cardinal . . . . . Not 395 ordinal number . . . . . 393 Martin's axiom . . . . . 382 continuum hypothesis g . . . . . Not 379 cardinal number . . . . Par 216 abstract model theory + . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . 178 compactness + . . . . His 177 aristotelean logic (2) + g . . . . . Par 39 syllogism g . . . . . Par 513 Aristotle on quantification + . . . . Par 196 foundations of theories . . . . 195 constraint programming . . . 40 planning . . . Not 36 classification . . . Not 37 heuristic g . . Par 89 theory of computation (4) g . . . Par 127 formal language theory (10) g . . . . 128 categorial grammar + . . . . . SbC 528 combinatorial categorial grammar . . . . 131 context free language g . . . . 130 Chomsky hierarchy g . . . . 134 phrase structure grammar . . . . 129 category . . . . 135 recursive language + g . . . . 137 unrestricted language g . . . . 136 regular language . . . . 132 context sensitive language g . . . . 133 feature constraint . . . Par 302 recursion theory (31) g . . . . 306 complexity of computation . . . . 330 undecidability . . . . 328 theory of numerations . . . . 309 effectively presented structure . . . . 314 isol . . . . 307 decidability (2) g . . . . . 474 tree model property g . . . . . 504 subformula property . . . . 322 recursively enumerable degree . . . . 331 word problem . . . . 327 subrecursive hierarchy . . . . 315 post system . . . . 324 recursively enumerable set . . . . 320 recursive function . . . . 318 recursive axiomatizability . . . . 329 thue system . . . . 325 reducibility . . . . 304 automaton . . . . 310 formal grammar . . . . 326 set recursion theory . . . . 303 abstract recursion theory . . . . 323 recursively enumerable language . . . . 305 axiomatic recursion theory . . . . 135 recursive language + g . . . . 313 inductive definability . . . . 316 recursion theory on admissible sets . . . . Not 52 Turing machine + . . . . 308 degrees of sets of sentences . . . . 319 recursive equivalence type . . . . 312 higher type recursion theory . . . . 317 recursion theory on ordinals . . . . 321 recursive relation . . . . 311 hierarchy . . . Par 185 computational logic (1) (8) g . . . . 190 semantics 190 (8) + g . . . . . 356 denotational semantics . . . . . 119 domain theory g . . . . . . 120 domain . . . . . 360 program analysis . . . . . 359 process model . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . 357 operational semantics . . . . . 358 partial evaluation . . . . . 355 algebraic semantics . . . . 189 reasoning about programs . . . . 53 automated reasoning (25) + . . . . . 35 belief revision . . . . . . 76 update . . . . . 67 nonmonotonic reasoning . . . . . 63 mathematical induction . . . . . 71 rewrite system (3) . . . . . . 350 termination . . . . . . 348 confluence . . . . . . 349 critical pair . . . . . 70 resolution (7) + . . . . . . 339 purity principle . . . . . . 342 simplification . . . . . . 337 demodulation . . . . . . 338 ordering . . . . . . 340 removal of tautologies . . . . . . 341 resolution refinement (4) . . . . . . . 345 lock resolution . . . . . . . 344 hyper resolution . . . . . . . 347 theory resolution . . . . . . . 346 set of support . . . . . . 343 subsumption . . . . . 68 paramodulation . . . . . Not 72 skolemisation . . . . . 65 model checking . . . . . 55 clause 55 (2) . . . . . . 80 horn clause g . . . . . . 79 Gentzen clause . . . . . 74 uncertainty . . . . . 75 unification + . . . . . 57 connection graph procedure . . . . . 64 metatheory . . . . . 61 literal . . . . . 58 connection matrix . . . . . 81 clause 81 . . . . . . SbC 82 relative clause . . . . . 69 reason extraction . . . . . 59 deduction (7) + . . . . . . Not 109 inconsistency . . . . . . 106 consequence g . . . . . . SbC 494 labelled deductive system . . . . . . 111 rule-based deduction . . . . . . Not 108 entailment + . . . . . . 110 natural deduction (2) + g . . . . . . . Not 482 hypothetical reasoning + . . . . . . . Not 483 normalization . . . . . . Not 107 consistency + . . . . . Res 60 Herbrand's theorem . . . . . 56 completion . . . . . . 86 Knuth Bendix completion . . . . . 73 theorem prover (3) . . . . . . 427 Bliksem g . . . . . . 428 Boyer-Moore theorem prover . . . . . . 429 SPASS g . . . . . 66 narrowing . . . . . 62 logic programming g . . . . . 54 answer extraction . . . . . 247 nonmonotonic logic + g . . . . . . 248 default inference . . . . Not 83 completeness (2) + g . . . . . SbC 84 axiomatic completeness . . . . . SbC 85 functional completeness + . . . . 188 program verification (4) . . . . . 274 mechanical verification . . . . . 269 invariant + . . . . . 273 logic of programs . . . . . 43 assertion (2) + . . . . . . 45 imperative assertion . . . . . . 44 declarative assertion . . . . 435 type theory (2) + . . . . . 433 type . . . . . . 434 type shifting . . . . . Not 23 polymorphism + g . . . . 186 program construct (5) . . . . . 265 functional construct . . . . . 267 program scheme . . . . . 266 object oriented construct . . . . . 264 control primitive . . . . . 268 type structure . . . . 187 program specification (5) . . . . . 271 pre-condition . . . . . 269 invariant + . . . . . 272 specification technique . . . . . 43 assertion (2) + . . . . . . 45 imperative assertion . . . . . . 44 declarative assertion . . . . . 270 post-condition . . . Par 48 automata theory (4) . . . . Not 52 Turing machine + . . . . 50 linear bounded automaton . . . . 49 finite state machine g . . . . 51 push down automaton . 173 linguistics (13) g . . Par 446 descriptive linguistics g . . . 142 grammar (5) g . . . . Not 519 derivation g . . . . 452 grammatical constituent g . . . . . 121 ellipsis g . . . . . . 122 antecedent of ellipsis . . . . 444 linguistic unit (3) g . . . . . SbC 440 word (5) g . . . . . . 28 anaphor (2) g . . . . . . . 30 antecedent of an anaphor . . . . . . . 29 anaphora resolution . . . . . . 278 pronoun (2) g . . . . . . . 280 pronoun resolution . . . . . . . 279 demonstrative g . . . . . . 138 function word (2) g . . . . . . . SbC 139 determiner g . . . . . . . SbC 441 modifier g . . . . . . . . 445 adjective (4) g . . . . . . . . . 4 predicative position . . . . . . . . . 1 adverbial modification g . . . . . . . . . 3 intersective adjective . . . . . . . . . 2 graded adjective . . . . . . 442 content word g . . . . . . 425 term (2) g . . . . . . . 426 singular term g . . . . . . . 260 plural term (2) g . . . . . . . . 261 collective reading . . . . . . . . 262 distributive reading . . . . . SbC 500 quantified phrases + . . . . . SbC 115 discourse (3) g . . . . . . 116 discourse particle . . . . . . 118 discourse representation theory g . . . . . . 117 discourse referent . . . . 144 syntax 144 (2) g . . . . . 453 logical syntax g . . . . . . 12 algebraic logic (10) + . . . . . . . 6 boolean algebra + . . . . . . . . SbC 7 boolean algebra with operators . . . . . . . 17 post algebra . . . . . . . 15 Lukasiewicz algebra . . . . . . . 14 cylindric algebra g . . . . . . . 8 lattice + g . . . . . . . 18 quantum logic . . . . . . . 10 relation algebra + . . . . . . . 13 categorical logic . . . . . . . 16 polyadic algebra . . . . . . . 19 topos . . . . . 423 syntactic category (3) g . . . . . . 447 part of speech g . . . . . . SbC 249 noun (2) g . . . . . . . SbC 251 proper name . . . . . . . SbC 250 mass noun g . . . . . . SbC 438 verb g . . . . . . . SbC 439 perception verb . . . . 143 sentence g . . 443 linguistic geography g . . Not 502 discontinuity . . Par 361 formal semantics (10) + g . . . 365 property theory . . . 240 Montague grammar (4) . . . . 243 sense 243 (4) g . . . . . 203 meaning relation (5) . . . . . . 205 hyponymy g . . . . . . 204 antonymy g . . . . . . 207 synonymy g . . . . . . . 149 intensional isomorphism + . . . . . . 206 paraphrase g . . . . . . 108 entailment + . . . . . 375 metaphor g . . . . . 376 metonymy g . . . . . 374 literal meaning . . . . 244 sense 244 g . . . . 241 meaning postulate . . . . 242 ptq g . . . . . 300 quantifying in . . . 254 quantifier (5) + g . . . . Not 516 bound variable + g . . . . His 514 Frege on quantification + g . . . . Not 517 free variable + g . . . . His 513 Aristotle on quantification + . . . . Not 301 scope . . . . . 351 scoping algorithm . . . 353 truth (4) + . . . . 431 truth definition g . . . . 432 truth value . . . . 372 truth function + g . . . . 430 truth condition . . . 362 dynamic semantics . . . 363 lexical semantics . . . 366 situation semantics (2) g . . . . 402 partiality . . . . 400 situation . . . . . 401 scene . . . Not 507 compositionality . . . 364 natural logic + . . . Par 515 quantification (4) + . . . . Not 516 bound variable + g . . . . His 514 Frege on quantification + g . . . . Not 517 free variable + g . . . . His 513 Aristotle on quantification + . . Not 20 ambiguity (7) g . . . SbC 27 syntactic ambiguity . . . SbC 25 semantic ambiguity + g . . . SbC 22 lexical ambiguity g . . . SbC 21 derivational ambiguity . . . SbC 24 pragmatic ambiguity . . . SbC 26 structural ambiguity . . . 23 polymorphism + g . . 510 frameworks (7) . . . 535 LFG . . . 128 categorial grammar + . . . . SbC 528 combinatorial categorial grammar . . . 530 TAG . . . 532 DRT . . . 529 GB . . . 534 HPSG . . . 531 dynamic syntax . . 506 linguistic phenomena . . Not 174 language acquisition g . . Par 450 pragmatics (2) g . . . 403 speech act (5) g . . . . 408 statement (2) g . . . . . 112 description (2) g . . . . . . SbC 114 indefinite description . . . . . . SbC 113 definite description . . . . . 409 indicative statement . . . . 405 indirect speech act . . . . 406 performative . . . . 407 performative hypothesis . . . . 404 illocutionary force . . . 100 conversational maxim (3) g . . . . 103 implicature + g . . . . 102 cooperative principle . . . . 101 conversational implicature g . . 499 syntax and semantic interface + . . Par 175 semantics 175 (16) g . . . 25 semantic ambiguity + g . . . Not 123 extension g . . . . 124 extensionality g . . . 334 referent g . . . Not 332 reference (2) g . . . . 333 identity puzzle . . . . 335 referential term . . . . . SbC 336 anchor . . . Not 263 presupposition g . . . . 103 implicature + g . . . Not 146 indexicality . . . . 147 indexical expression g . . . Par 41 aspect . . . . 42 aspectual classification . . . SbC 361 formal semantics (10) + g . . . . 365 property theory . . . . 240 Montague grammar (4) . . . . . 243 sense 243 (4) g . . . . . . 203 meaning relation (5) . . . . . . . 205 hyponymy g . . . . . . . 204 antonymy g . . . . . . . 207 synonymy g . . . . . . . . 149 intensional isomorphism + . . . . . . . 206 paraphrase g . . . . . . . 108 entailment + . . . . . . 375 metaphor g . . . . . . 376 metonymy g . . . . . . 374 literal meaning . . . . . 244 sense 244 g . . . . . 241 meaning postulate . . . . . 242 ptq g . . . . . . 300 quantifying in . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . 353 truth (4) + . . . . . 431 truth definition g . . . . . 432 truth value . . . . . 372 truth function + g . . . . . 430 truth condition . . . . 362 dynamic semantics . . . . 363 lexical semantics . . . . 366 situation semantics (2) g . . . . . 402 partiality . . . . . 400 situation . . . . . . 401 scene . . . . Not 507 compositionality . . . . 364 natural logic + . . . . Par 515 quantification (4) + . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . Not 501 coordination . . . Not 353 truth (4) + . . . . 431 truth definition g . . . . 432 truth value . . . . 372 truth function + g . . . . 430 truth condition . . . Not 354 underspecification (2) . . . . 437 quasi-logical form . . . . 436 monotonic semantics . . . 499 syntax and semantic interface + . . . Par 46 attitude . . . . SbC 47 propositional attitude . . . . . Not 299 belief . . . Not 500 quantified phrases + . . . Not 148 intension (3) g . . . . 149 intensional isomorphism + . . . . 151 intensionality . . . . 150 intensional verb . . . 31 animal (3) g . . . . SbC 33 unicorn . . . . SbC 32 donkey . . . . SbC 352 rabbit . . Par 496 syntax 496 (2) g . . . Par 498 word order . . . Par 497 movement . . Par 140 language generation . . . 141 reversibility . 202 mathematics (5) g . . Not 527 algebra 2 g . . 191 logic (1) (31) + g . . . Par 53 automated reasoning (25) + . . . . 35 belief revision . . . . . 76 update . . . . 67 nonmonotonic reasoning . . . . 63 mathematical induction . . . . 71 rewrite system (3) . . . . . 350 termination . . . . . 348 confluence . . . . . 349 critical pair . . . . 70 resolution (7) + . . . . . 339 purity principle . . . . . 342 simplification . . . . . 337 demodulation . . . . . 338 ordering . . . . . 340 removal of tautologies . . . . . 341 resolution refinement (4) . . . . . . 345 lock resolution . . . . . . 344 hyper resolution . . . . . . 347 theory resolution . . . . . . 346 set of support . . . . . 343 subsumption . . . . 68 paramodulation . . . . Not 72 skolemisation . . . . 65 model checking . . . . 55 clause 55 (2) . . . . . 80 horn clause g . . . . . 79 Gentzen clause . . . . 74 uncertainty . . . . 75 unification + . . . . 57 connection graph procedure . . . . 64 metatheory . . . . 61 literal . . . . 58 connection matrix . . . . 81 clause 81 . . . . . SbC 82 relative clause . . . . 69 reason extraction . . . . 59 deduction (7) + . . . . . Not 109 inconsistency . . . . . 106 consequence g . . . . . SbC 494 labelled deductive system . . . . . 111 rule-based deduction . . . . . Not 108 entailment + . . . . . 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . Not 107 consistency + . . . . Res 60 Herbrand's theorem . . . . 56 completion . . . . . 86 Knuth Bendix completion . . . . 73 theorem prover (3) . . . . . 427 Bliksem g . . . . . 428 Boyer-Moore theorem prover . . . . . 429 SPASS g . . . . 66 narrowing . . . . 62 logic programming g . . . . 54 answer extraction . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . Par 198 proof theory (22) g . . . . SbC 503 sequent calculus . . . . . Not 484 structural rules . . . . 289 interpretation . . . . 282 constructive analysis . . . . 295 recursive ordinal . . . . 287 Goedel numbering . . . . 288 higher-order arithmetic . . . . 281 complexity of proofs . . . . 294 recursive analysis . . . . Res 292 normal form theorem . . . . 297 second-order arithmetic . . . . SbC 110 natural deduction (2) + g . . . . . Not 482 hypothetical reasoning + . . . . . Not 483 normalization . . . . 290 intuitionistic mathematics . . . . 286 functionals in proof theory . . . . 298 structure of proofs g . . . . 283 constructive system . . . . 291 metamathematics . . . . 59 deduction (7) + . . . . . Not 109 inconsistency . . . . . 106 consequence g . . . . . SbC 494 labelled deductive system . . . . . 111 rule-based deduction . . . . . Not 108 entailment + . . . . . 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . Not 107 consistency + . . . . 296 relative consistency . . . . Not 284 cut elimination theorem g . . . . 293 ordinal notation . . . . 285 first-order arithmetic . . . . SbC 485 proof nets . . . SbC 475 first order logic (4) g . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . Par 476 first order language g . . . . . Not 477 fragment (3) g . . . . . . SbC 479 finite-variable fragment g . . . . . . SbC 480 guarded fragment g . . . . . . SbC 478 modal fragment g . . . . . . . Not 470 standard translation + g . . . . 511 SPASS g . . . . Par 515 quantification (4) + . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . 193 computability theory . . . SbC 167 temporal logic (2) + g . . . 435 type theory (2) + . . . . 433 type . . . . . 434 type shifting . . . . Not 23 polymorphism + g . . . 495 substructural logic . . . SbC 200 relevance logic + . . . . 108 entailment + . . . Res 180 Lindstroem's theorem + . . . SbC 481 linear logic . . . 526 variable g . . . . SbC 517 free variable + g . . . Res 179 Goedel's 1st incompleteness theorem (1931) + g . . . SbC 125 feature logic + . . . . 75 unification + . . . 197 model theory (29) . . . . 237 set-theoretic model theory . . . . 11 universal algebra + . . . . 225 infinitary logic . . . . 217 admissible set . . . . 234 recursion-theoretic model theory . . . . 239 ultraproduct . . . . 227 logic with extra quantifiers . . . . SbC 457 modal model theory (7) + . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Not 461 generated submodel g . . . . . 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . . Not 459 disjoint union of models g . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . . Not 469 expressive power g . . . . . . Not 470 standard translation + g . . . . . Not 460 bisimulation g . . . . 219 completeness of theories . . . . 235 saturation . . . . 222 equational class . . . . 238 stability . . . . 233 quantifier elimination . . . . 221 denumerable structure . . . . 228 model-theoretic algebra . . . . 236 second-order model theory . . . . 230 model of arithmetic . . . . 218 categoricity g . . . . 220 definability . . . . 226 interpolation . . . . SbC 454 first order model theory . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . 231 nonclassical model (2) . . . . . 246 sheaf model . . . . . 245 boolean valued . . . . 201 set theory (24) + g . . . . . 398 set-theoretic definability . . . . . Not 391 iota operator . . . . . 384 determinacy . . . . . 387 fuzzy relation . . . . . Not 385 filter . . . . . 389 generalized continuum hypothesis . . . . . 386 function (3) g . . . . . . 482 hypothetical reasoning + . . . . . . 509 functional application . . . . . . 508 functional composition . . . . . Not 394 ordinal definability . . . . . Not 107 consistency + . . . . . 397 set algebra . . . . . 399 Suslin scheme . . . . . SbC 383 descriptive set theory g . . . . . 388 fuzzy set g . . . . . 378 borel classification g . . . . . SbC 380 combinatorial set theory . . . . . Not 390 independence . . . . . 381 constructibility . . . . . 396 relation g . . . . . 377 axiom of choice g . . . . . 392 large cardinal . . . . . Not 395 ordinal number . . . . . 393 Martin's axiom . . . . . 382 continuum hypothesis g . . . . . Not 379 cardinal number . . . . 232 preservation . . . . 216 abstract model theory + . . . . . 254 quantifier (5) + g . . . . . . Not 516 bound variable + g . . . . . . His 514 Frege on quantification + g . . . . . . Not 517 free variable + g . . . . . . His 513 Aristotle on quantification + . . . . . . Not 301 scope . . . . . . . 351 scoping algorithm . . . . 229 model-theoretic forcing . . . . 224 higher-order model theory . . . . Par 493 correspondence theory . . . . 223 finite structure . . . Res 182 Loewenheim-Skolem-Tarski theorem + . . . Not 83 completeness (2) + g . . . . SbC 84 axiomatic completeness . . . . SbC 85 functional completeness + . . . SbC 156 modal logic (13) + g . . . . Ins 512 S4 . . . . 488 modes . . . . 486 frame (2) . . . . . SbC 487 frame constraints . . . . Par 210 modal operator (2) + g . . . . . SbC 472 diamond g . . . . . SbC 473 box g . . . . SbC 213 doxastic logic g . . . . Not 489 accessability relation + . . . . Par 471 modal language (2) g . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . 490 boolean operators . . . . SbC 211 alethic logic g . . . . SbC 212 deontic logic (3) g . . . . . SbC 521 standard deontic logic g . . . . . SbC 523 two-sorted deontic logic g . . . . . SbC 522 dyadic deontic logic g . . . . Par 215 Kripke semantics + g . . . . . Not 489 accessability relation + . . . . Par 457 modal model theory (7) + . . . . . SbC 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Not 461 generated submodel g . . . . . 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . . Not 459 disjoint union of models g . . . . . 455 homomorphism (2) + g . . . . . . SbC 456 bounded homomorphism g . . . . . . SbC 468 bounded morphism . . . . . Not 469 expressive power g . . . . . . Not 470 standard translation + g . . . . . Not 460 bisimulation g . . . . SbC 214 epistemic logic g . . . . Not 462 model (4) + . . . . . SbC 464 finite model g . . . . . SbC 466 image finite model . . . . . . Res 467 Hennessy-Milner theorem g . . . . . Par 463 valuation g . . . . . SbC 465 tree model g . . . 194 computational logic (2) . . . Not 183 operator (4) + g . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . SbC 210 modal operator (2) + g . . . . . SbC 472 diamond g . . . . . SbC 473 box g . . . . 518 truth-funcional operator (2) g . . . . . SbC 252 iff g . . . . . SbC 253 negation . . . . Not 525 arity g . . . SbC 192 combinatory logic g . . . Par 199 recursive function theory . . . 361 formal semantics (10) + g . . . . 365 property theory . . . . 240 Montague grammar (4) . . . . . 243 sense 243 (4) g . . . . . . 203 meaning relation (5) . . . . . . . 205 hyponymy g . . . . . . . 204 antonymy g . . . . . . . 207 synonymy g . . . . . . . . 149 intensional isomorphism + . . . . . . . 206 paraphrase g . . . . . . . 108 entailment + . . . . . . 375 metaphor g . . . . . . 376 metonymy g . . . . . . 374 literal meaning . . . . . 244 sense 244 g . . . . . 241 meaning postulate . . . . . 242 ptq g . . . . . . 300 quantifying in . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . 353 truth (4) + . . . . . 431 truth definition g . . . . . 432 truth value . . . . . 372 truth function + g . . . . . 430 truth condition . . . . 362 dynamic semantics . . . . 363 lexical semantics . . . . 366 situation semantics (2) g . . . . . 402 partiality . . . . . 400 situation . . . . . . 401 scene . . . . Not 507 compositionality . . . . 364 natural logic + . . . . Par 515 quantification (4) + . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . SbC 168 lambda calculus (4) g . . . . 170 application . . . . 172 lambda operator . . . . 169 abstraction . . . . 171 conversion . . . 38 knowledge representation (20) + g . . . . 152 frame (1) . . . . 104 database + g . . . . . 105 query g . . . . 165 situation calculus . . . . 167 temporal logic (2) + g . . . . 166 temporal logic (1) g . . . . 93 concept formation . . . . . 90 concept + . . . . . . 91 individual concept . . . . 154 logical omniscience . . . . 162 rule-based representation . . . . 157 predicate logic + g . . . . 159 procedural representation . . . . 161 representation language . . . . 156 modal logic (13) + g . . . . . Ins 512 S4 . . . . . 488 modes . . . . . 486 frame (2) . . . . . . SbC 487 frame constraints . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . SbC 213 doxastic logic g . . . . . Not 489 accessability relation + . . . . . Par 471 modal language (2) g . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . 490 boolean operators . . . . . SbC 211 alethic logic g . . . . . SbC 212 deontic logic (3) g . . . . . . SbC 521 standard deontic logic g . . . . . . SbC 523 two-sorted deontic logic g . . . . . . SbC 522 dyadic deontic logic g . . . . . Par 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Par 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . SbC 214 epistemic logic g . . . . . Not 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . 97 context (2) . . . . . 99 context dependence . . . . . 98 context change . . . . 160 relation system . . . . 153 frame problem g . . . . 92 concept analysis . . . . . 90 concept + . . . . . . 91 individual concept . . . . 163 script . . . . 145 idea g . . . . . 90 concept + . . . . . . 91 individual concept . . . . 164 semantic network g . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . Par 367 semantics 367 (8) g . . . . 371 truth conditional semantics . . . . 373 truth table . . . . SbC 215 Kripke semantics + g . . . . . Not 489 accessability relation + . . . . 85 functional completeness + . . . . 370 satisfaction . . . . 369 material implication g . . . . 368 assignment . . . . Not 372 truth function + g . . . Par 201 set theory (24) + g . . . . 398 set-theoretic definability . . . . Not 391 iota operator . . . . 384 determinacy . . . . 387 fuzzy relation . . . . Not 385 filter . . . . 389 generalized continuum hypothesis . . . . 386 function (3) g . . . . . 482 hypothetical reasoning + . . . . . 509 functional application . . . . . 508 functional composition . . . . Not 394 ordinal definability . . . . Not 107 consistency + . . . . 397 set algebra . . . . 399 Suslin scheme . . . . SbC 383 descriptive set theory g . . . . 388 fuzzy set g . . . . 378 borel classification g . . . . SbC 380 combinatorial set theory . . . . Not 390 independence . . . . 381 constructibility . . . . 396 relation g . . . . 377 axiom of choice g . . . . 392 large cardinal . . . . Not 395 ordinal number . . . . 393 Martin's axiom . . . . 382 continuum hypothesis g . . . . Not 379 cardinal number . . . Par 216 abstract model theory + . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . 178 compactness + . . . His 177 aristotelean logic (2) + g . . . . Par 39 syllogism g . . . . Par 513 Aristotle on quantification + . . . Par 196 foundations of theories . . . 195 constraint programming . . 424 system g . . Par 5 algebra 1 (8) g . . . 8 lattice + g . . . SbC 6 boolean algebra + . . . . SbC 7 boolean algebra with operators . . . 11 universal algebra + . . . 77 category theory + g . . . . 78 bottom . . . SbC 9 Lindenbaum algebra . . . 10 relation algebra + . . . 12 algebraic logic (10) + . . . . 6 boolean algebra + . . . . . SbC 7 boolean algebra with operators . . . . 17 post algebra . . . . 15 Lukasiewicz algebra . . . . 14 cylindric algebra g . . . . 8 lattice + g . . . . 18 quantum logic . . . . 10 relation algebra + . . . . 13 categorical logic . . . . 16 polyadic algebra . . . . 19 topos . . . Par 491 algebraic principles . . . . SbC 492 residuation . . 176 mathematical logic (12) g . . . Res 180 Lindstroem's theorem + . . . 77 category theory + g . . . . 78 bottom . . . 53 automated reasoning (25) + . . . . 35 belief revision . . . . . 76 update . . . . 67 nonmonotonic reasoning . . . . 63 mathematical induction . . . . 71 rewrite system (3) . . . . . 350 termination . . . . . 348 confluence . . . . . 349 critical pair . . . . 70 resolution (7) + . . . . . 339 purity principle . . . . . 342 simplification . . . . . 337 demodulation . . . . . 338 ordering . . . . . 340 removal of tautologies . . . . . 341 resolution refinement (4) . . . . . . 345 lock resolution . . . . . . 344 hyper resolution . . . . . . 347 theory resolution . . . . . . 346 set of support . . . . . 343 subsumption . . . . 68 paramodulation . . . . Not 72 skolemisation . . . . 65 model checking . . . . 55 clause 55 (2) . . . . . 80 horn clause g . . . . . 79 Gentzen clause . . . . 74 uncertainty . . . . 75 unification + . . . . 57 connection graph procedure . . . . 64 metatheory . . . . 61 literal . . . . 58 connection matrix . . . . 81 clause 81 . . . . . SbC 82 relative clause . . . . 69 reason extraction . . . . 59 deduction (7) + . . . . . Not 109 inconsistency . . . . . 106 consequence g . . . . . SbC 494 labelled deductive system . . . . . 111 rule-based deduction . . . . . Not 108 entailment + . . . . . 110 natural deduction (2) + g . . . . . . Not 482 hypothetical reasoning + . . . . . . Not 483 normalization . . . . . Not 107 consistency + . . . . Res 60 Herbrand's theorem . . . . 56 completion . . . . . 86 Knuth Bendix completion . . . . 73 theorem prover (3) . . . . . 427 Bliksem g . . . . . 428 Boyer-Moore theorem prover . . . . . 429 SPASS g . . . . 66 narrowing . . . . 62 logic programming g . . . . 54 answer extraction . . . . 247 nonmonotonic logic + g . . . . . 248 default inference . . . Res 182 Loewenheim-Skolem-Tarski theorem + . . . 181 logical constants . . . Not 83 completeness (2) + g . . . . SbC 84 axiomatic completeness . . . . SbC 85 functional completeness + . . . Res 179 Goedel's 1st incompleteness theorem (1931) + g . . . Not 183 operator (4) + g . . . . 254 quantifier (5) + g . . . . . Not 516 bound variable + g . . . . . His 514 Frege on quantification + g . . . . . Not 517 free variable + g . . . . . His 513 Aristotle on quantification + . . . . . Not 301 scope . . . . . . 351 scoping algorithm . . . . SbC 210 modal operator (2) + g . . . . . SbC 472 diamond g . . . . . SbC 473 box g . . . . 518 truth-funcional operator (2) g . . . . . SbC 252 iff g . . . . . SbC 253 negation . . . . Not 525 arity g . . . Not 178 compactness + . . . Res 520 Goedel's 2nd incompleteness theorem (1931) g . . . 435 type theory (2) + . . . . 433 type . . . . . 434 type shifting . . . . Not 23 polymorphism + g . . . 184 symbolic logic (18) g . . . . SbC 412 dynamic logic . . . . 420 partial logic . . . . SbC 413 fuzzy logic g . . . . 200 relevance logic + . . . . . 108 entailment + . . . . SbC 419 paraconsistent logic . . . . 416 intermediate logic . . . . 125 feature logic + . . . . . 75 unification + . . . . 157 predicate logic + g . . . . 364 natural logic + . . . . SbC 422 propositional logic g . . . . SbC 410 boolean logic g . . . . SbC 156 modal logic (13) + g . . . . . Ins 512 S4 . . . . . 488 modes . . . . . 486 frame (2) . . . . . . SbC 487 frame constraints . . . . . Par 210 modal operator (2) + g . . . . . . SbC 472 diamond g . . . . . . SbC 473 box g . . . . . SbC 213 doxastic logic g . . . . . Not 489 accessability relation + . . . . . Par 471 modal language (2) g . . . . . . Par 210 modal operator (2) + g . . . . . . . SbC 472 diamond g . . . . . . . SbC 473 box g . . . . . . 490 boolean operators . . . . . SbC 211 alethic logic g . . . . . SbC 212 deontic logic (3) g . . . . . . SbC 521 standard deontic logic g . . . . . . SbC 523 two-sorted deontic logic g . . . . . . SbC 522 dyadic deontic logic g . . . . . Par 215 Kripke semantics + g . . . . . . Not 489 accessability relation + . . . . . Par 457 modal model theory (7) + . . . . . . SbC 215 Kripke semantics + g . . . . . . . Not 489 accessability relation + . . . . . . Not 461 generated submodel g . . . . . . 462 model (4) + . . . . . . . SbC 464 finite model g . . . . . . . SbC 466 image finite model . . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . . Par 463 valuation g . . . . . . . SbC 465 tree model g . . . . . . Not 459 disjoint union of models g . . . . . . 455 homomorphism (2) + g . . . . . . . SbC 456 bounded homomorphism g . . . . . . . SbC 468 bounded morphism . . . . . . Not 469 expressive power g . . . . . . . Not 470 standard translation + g . . . . . . Not 460 bisimulation g . . . . . SbC 214 epistemic logic g . . . . . Not 462 model (4) + . . . . . . SbC 464 finite model g . . . . . . SbC 466 image finite model . . . . . . . Res 467 Hennessy-Milner theorem g . . . . . . Par 463 valuation g . . . . . . SbC 465 tree model g . . . . SbC 418 many-valued logic g . . . . SbC 417 intuitionistic logic g . . . . SbC 421 probability logic . . . . 411 conditional logic . . . . SbC 414 higher-order logic . . . . 415 inductive logic . 258 philosophy (3) g . . Par 524 philosophy of language g . . Par 259 logic 259 (2) g . . . His 177 aristotelean logic (2) + g . . . . Par 39 syllogism g . . . . Par 513 Aristotle on quantification + . . . 449 proposition (2) g . . . . 448 contradiction g . . . . . 255 paradox (2) g . . . . . . 256 liar paradox g . . . . . . 257 semantic paradox . . . . 94 conditional statement (2) . . . . . 95 antecedent . . . . . 96 counterfactual g . . Par 208 metaphysics g . . . 209 common sense world g

5. MathGuide - OPAC Subject Catalog
03C52 Properties of classes of models; 03C55 Settheoretic model theory and core models; 03E47 Other notions of Set-theoretic definability
http://www.mathguide.de/cgi-bin/ssgfi/navigator2.pl/db=math/type=gok/pattern=all
Browse the GBV OPAC by MSC 2000
This is a browse interface to the union catalogue of the Common Library Network GBV based on the MSC 2000 classification.
You can browse down to the individual notation, the links available will direct you to the appropriate place in the GBV OPAC, which uses a notation related to, but different from MSC.
Note: Not all books available are contained in the online catalogue. Please use the Goettingen State University Library's Alphabetical Catalogue to search for monographs, dissertations and journals missing in the OPAC. Open all categories Close all categories
  • Foundations
    • 00-XX General
      • Instructional exposition (textbooks, tutorial papers, etc.)
      • Research exposition (monographs, survey articles)
      • General mathematics
      • General and miscellaneous specific topics
        • General mathematics
        • Mathematics for nonmathematicians (engineering, social sciences, etc.)
        • Problem books
        • Recreational mathematics
        • Bibliographies
        • External book reviews
        • Dictionaries and other general reference works
        • Formularies
        • Philosophy of mathematics
        • Methodology of mathematics, didactics

6. CWI LIBRARY CLASSIFICATION SCHEME
03E45, Inner models, including constructibility, ordinal definability, and core models. 03E47, Other notions of Settheoretic definability
http://www.cwi.nl/library/services/class/wwwclass.html
Instructional exposition (textbooks, tutorial papers, etc.) Research exposition (monographs, survey articles) 00-XX General General mathematics Mathematics for nonmathematicians (engineering, social sciences, etc.) Problem books Recreational mathematics [See also 97A20] Bibliographies External book reviews Dictionaries and other general reference works Formularies Philosophy of mathematics [See also 03A05] Methodology of mathematics, didactics [See also 97Cxx, 97Dxx] Theory of mathematical modeling General methods of simulation Dimensional analysis Physics (use more specific entries from Sections 70 through 86 when possible) Miscellaneous topics General and miscellaneous specific topics Collections of abstracts of lectures Collections of articles of general interest Collections of articles of miscellaneous specific content Proceedings of conferences of general interest Proceedings of conferences of miscellaneous specific interest Festschriften Volumes of selected translations Miscellaneous volumes of translations Collections of reprinted articles [See also 01A75] Conference proceedings and collections of papers General reference works (handbooks, dictionaries, bibliographies, etc.)

7. SUB Göttingen - Systematische Recherche Im Katalog Der SUB
EADE 450, Inner models, including constructibility, ordinal definability, and core models. EADE 470, Other notions of Settheoretic definability
http://www.sub.uni-goettingen.de/scripts/gok/browse.php?gok=E&lang=de

8. 00-01 Textbooks (general Mathematics) 00-02 Research Monographs
03D65 Other generalized recursion theory 03D70 Inductive definability 03D75 and related notions 03E47 Other notions of Settheoretic definability 03E50
http://www.mathematik.tu-chemnitz.de/metadata/mscliste.txt
00-01 Textbooks (general mathematics) 00-02 Research monographs (general mathematics) 00-99 General mathematics 00-XX General mathematics 00A05 General mathematics 00A06 Mathematics for non-mathematicians 00A07 Problem books 00A08 Mathematical recreation 00A15 Bibliographies 00A20 Dictionaries and other general reference works 00A22 Formularies 00A30 Philosophy of mathematics 00A35 Methodology of mathematics, didactics 00A69 General applied mathematics 00A71 Theory of mathematical modeling 00A72 General methods of simulation 00A73 Dimensional analysis 00A79 Physics 00A99 Miscellaneous topics in general mathematics 00Axx Topics in general mathematics 00B05 Collections of abstracts of lectures 00B10 Collections of articles of general interest 00B15 Collections of articles of miscellaneous specific interest 00B20 Proceedings of conferences of general interest 00B25 Proceedings of conferences of miscellaneous specific interest 00B30 Festschriften 00B50 Volumes of selected translations 00B55 Miscellaneous volumes of translations 00B60 Collections of reprinted articles 00Bxx Conference proceedings and collections of papers 01-00 Reference works (history) 01-01 Textbooks (history) 01-02 Research monographs (history) 01-06 Proceedings of conferences, etc. (history) 01-99 History of mathematics and biography 01-XX History and biography 01A05 General histories, source books 01A07 Ethnomathematics 01A10 Paleolithic or Neolithic mathematics, etc. 01A12 Native American mathematics 01A13 Native African mathematics 01A15 Pre-Greek mathematics of Europe 01A16 Egyptian mathematics 01A17 Babylonian mathematics 01A20 Greek or Roman mathematics 01A25 Chinese mathematics 01A27 Japanese mathematics 01A29 Southeast Asian mathematics 01A30 Mathematics of Islam (Medieval) 01A32 Indian mathematics 01A35 Mathematics in the medieval 01A40 Mathematics in the 15th and 16th centuries, Renaissance 01A45 Mathematics in the 17th century 01A50 Mathematics in the 18th century 01A55 Mathematics in the 19th century 01A60 Mathematics in the 20th century 01A65 Development of contemporary mathematics 01A67 Future prospectives in mathematics 01A70 Biographies, obituaries, personalia, bibliographies 01A72 Schools of mathematics 01A73 History of mathematics at universities 01A74 History of mathematics at institutions and academies (nonuniversity) 01A75 Collected or selected works 01A80 Sociology (and profession) of mathematics 01A99 Miscellaneous topics in history of mathematics 03-00 Reference works (mathematical logic) 03-01 Textbooks (mathematical logic) 03-02 Research monographs (mathematical logic) 03-03 Historical (mathematical logic) 03-04 Machine computation, programs (mathematical logic) 03-06 Proceedings of conferences (mathematical logic) 03-99 Mathematical logic and foundations 03-XX Mathematical logic 03A05 Philosophical and critical 03B05 Classical propositional logic 03B10 First-order logic 03B15 Higher-order logic 03B20 Subsystems of classical logic 03B22 Abstract deductive systems 03B25 Decidability of theories and sets of sentences 03B30 Foundations of classical theories 03B35 Mechanical theorem proving 03B40 Combinatory logic 03B45 Modal logic, etc. 03B46 Relevance logic, etc. 03B48 Probability logic, etc. 03B50 Many-valued logic 03B52 Fuzzy logic 03B53 Paraconsistent logic 03B55 Intermediate logics 03B60 Other nonclassical logic 03B65 Logic of natural languages 03B70 Logic of programming 03B80 Appl. of logic 03B99 General logic 03Bxx General logic 03C05 Universal algebra (model theory) 03C07 Basic properties of first-order languages and structures 03C10 Quantifier elimination and related topics 03C13 Finite models 03C15 Countable models 03C20 Ultraproducts and related constructions 03C25 Model-theoretic forcing 03C30 Other model constructions 03C35 Categoricity, etc. 03C40 Interpolation, etc. (model theory) 03C45 Stability (model theory) 03C50 Models with special properties 03C52 Properties of classes of models 03C55 Set-theoretic model theory 03C57 Recursion-theoretic model theory 03C60 Model-theoretic algebra 03C62 Models of arithmetic and set theory 03C65 Models of other mathematical theories 03C68 Other classical first-order model theory 03C70 Logic on admissible sets 03C75 Other infinitary logic 03C80 Logic with extra quantifiers and operators 03C85 Higher-order model theory 03C90 Nonclassical models 03C95 Abstract model theory 03C99 Model theory (logic) 03Cxx Model theory (logic) 03D03 Rewriting systems 03D05 Automata theory in connection with logical questions 03D10 Turing machines and related notions 03D15 Complexity of computation 03D20 Recursive functions 03D25 Recursively enumerable sets 03D30 Degrees, other than r.e. 03D35 Undecidability 03D40 Word problems, etc. (logic) 03D45 Effectively presented structures, etc. 03D50 Recursive equivalence types 03D55 Hierarchies 03D60 Recursion theory on ordinals, admissible sets, etc. 03D65 Other generalized recursion theory 03D70 Inductive definability 03D75 Abstract and axiomatic recursion theory 03D80 Appl. of recursion theory 03D99 Recursion theory 03Dxx Recursion theory 03E05 Combinatorial set theory (logic) 03E10 Ordinal and cardinal arithmetic 03E15 Descriptive set theory (logic) 03E20 Other classical set theory (logic) 03E25 Axiom of choice and related propositions (logic) 03E30 Axiomatics of classical set theory and its fragments 03E35 Consistency and independence results (set theory) 03E40 Other aspects of forcing (set theory) 03E45 Constructibility, ordinal definability, and related notions 03E47 Other notions of set-theoretic definability 03E50 Continuum hypothesis and generalizations (logic) 03E55 Large cardinals 03E60 Axiom of determinacy, etc. 03E65 Other hypotheses and axioms (set theory) 03E70 Nonclassical set theories 03E72 Fuzzy sets (logic) 03E75 Appl. of set theory 03E99 Set theory (logic) 03Exx Set theory (logic) 03F03 General aspects of proof theory 03F05 Cut-elimination, etc. 03F07 Structure of proofs 03F10 Functionals in proof theory 03F15 Recursive ordinals and ordinal notations 03F20 Complexity of proofs 03F25 Relative consistency and interpretations 03F30 First-order arithmetic and fragments 03F35 Higher-order arithmetic and fragments 03F40 Goedel numberings in proof theory 03F50 Metamathematics of constructive systems 03F55 Intuitionistic mathematics 03F60 Constructive and recursive analysis 03F65 Other constructive mathematics 03F99 Metamathematics, etc. 03Fxx Metamathematics, etc. 03G05 Boolean algebras in algebraic logic 03G10 Lattices and related structures (algebraic logic) 03G12 Quantum logic 03G15 Cylindric and polyadic algebras, etc. 03G20 Post and Lukasiewicz algebras (algebraic logic) 03G25 Other algebras related to logic 03G30 Categorical logic 03G99 Algebraic logic 03Gxx Algebraic logic 03H05 Nonstandard models in mathematics 03H10 Appl. of nonstandard models to other sciences 03H15 Nonstandard models of arithmetic 03H99 Nonstandard models 03Hxx Nonstandard models 04-00 Reference works (set theory) 04-01 Textbooks (set theory) 04-02 Research monographs (set theory) 04-03 Historical (set theory) 04-04 Machine computation, programs (set theory) 04-06 Proceedings of conferences (set theory) 04-99 Set theory 04-XX Set theory 04A03 Set algebra 04A05 Relations, functions 04A10 Ordinal and cardinal numbers; generalizations 04A15 Descriptive set theory 04A20 Combinatorial set theory 04A25 Axiom of choice and equivalent propositions 04A30 Continuum hypothesis and generalizations 04A72 Fuzzy sets 04A99 Miscellaneous topics in set theory 05-01 Textbooks (combinatorics) 05-02 Research monographs (combinatorics) 05-03 Historical (combinatorics) 05-04 Machine computation, programs (combinatorics) 05-06 Proceedings of conferences (combinatorics) 05-99 Combinatorics 05-XX Combinatorics 05A05 Combinatorial choice problems 05A10 Combinatorial functions 05A15 Combinatorial enumeration problems 05A16 Asymptotic enumeration 05A17 Partitions of integres (combinatorics) 05A18 Partitions of sets 05A19 Combinatorial identities 05A20 Combinatorial inequalities 05A30 q-calculus and related topics 05A40 Umbral calculus 05A99 Classical combinatorial problems 05Axx Classical combinatorial problems 05B05 Block designs (combinatorics) 05B07 Triple systems 05B10 Difference sets 05B15 Orthogonal arrays, etc. 05B20 (0,1)-matrices (combinatorics) 05B25 Finite geometries (combinatorics) 05B30 Other designs, configurations 05B35 Matroids (combinatorics) 05B40 Packing and covering (combinatorics) 05B45 Tessellation and tiling problems 05B50 Polyominoes 05B99 Designs and configurations 05Bxx Designs and configurations 05C05 Trees 05C10 Topological graph theory 05C12 Distance in graphs 05C15 Chromatic theory of graphs and maps 05C20 Directed graphs (digraphs) 05C25 Graphs and groups 05C30 Enumeration of graphs and maps 05C35 Extremal problems (graph theory) 05C38 Paths and cycles 05C40 Connectivity 05C45 Eulerian and Hamiltonian graphs 05C50 Graphs and matrices 05C55 Generalized Ramsey theory 05C60 Isomorphism problems (graph theory) 05C65 Hypergraphs 05C70 Factorization, etc. 05C75 Structural characterization of types of graphs 05C78 Graph labelling 05C80 Random graphs 05C85 Graph algorithms 05C90 Appl. of graph theory 05C99 Graph theory 05Cxx Graph theory 05D05 Extremal set theory 05D10 Ramsey theory 05D15 Transversal (matching) theory 05D99 Extremal combinatorics 05Dxx Extremal combinatorics 05E05 Symmetric functions 05E10 Tableaux, etc. 05E15 Combinatorial problems concerning the classical groups 05E20 Group actions on designs, etc. 05E25 Group actions on posets, etc. 05E30 Association schemes, etc. 05E35 Orthogonal polynomials (combinatorics) 05E99 Algebraic combinatorics 05Exx Algebraic combinatorics 06-00 Reference works (ordered structures) 06-01 Textbooks (ordered structures) 06-02 Research monographs (ordered structures) 06-03 Historical (ordered structures) 06-04 Machine computation, programs (ordered structures) 06-06 Proceedings of conferences (ordered structures) 06-99 Order, lattices, ordered algebraic structures 06-XX Ordered structures 06A05 Total order 06A06 Partial order 06A07 Combinatorics of partially ordered sets 06A08 Shellable posets, etc. 06A09 Cohomology of posets 06A12 Semilattices 06A15 Galois correspondences (ordered structures) 06A23 Completions of lattices 06A99 Ordered sets 06Axx Ordered sets 06B05 Structure theory of lattices 06B10 Ideals, etc. (lattices) 06B15 Representation theory of lattices 06B20 Varieties of lattices 06B25 Free lattices, etc. 06B30 Topological lattices 06B35 Continuous lattices 06B99 Lattices 06Bxx Lattices 06C05 Modular lattices 06C10 Geometric lattices 06C15 Complemented lattices 06C20 Complemented modular lattices, etc. 06C99 Lattices (modular and complemented) 06Cxx Lattices (modular and complemented) 06D05 Structure and representation theory of distributive lattices 06D10 Complete distributivity of lattices 06D15 Pseudocomplemented lattices 06D20 Heyting algebras 06D25 Post algebras 06D30 De Morgan algebras and generalizations 06D99 Distributive lattices 06Dxx Distributive lattices 06E05 Structure theory of Boolean algebras 06E10 Complete Boolean algebras 06E15 Stone space and related constructions 06E20 Ring theoretic properties (Boolean algebras) 06E25 Boolean algebras with additional operations 06E30 Boolean functions 06E99 Boolean algebras 06Exx Boolean algebras 06F05 Ordered semigroups 06F10 Noether lattices 06F15 Ordered groups 06F20 Ordered abelian groups, etc. 06F25 Ordered algebraic structures 06F30 Order topologies (order-theoretic aspects) 06F35 BCK-algebras, etc. 06F99 Ordered structures (connections with other sections) 06Fxx Ordered structures (connections with other sections) 08-00 Reference works (general algebraic systems) 08-01 Textbooks (general algebraic systems) 08-02 Research monographs (general algebraic systems) 08-03 Historical (general algebraic systems) 08-04 Machine computation, programs (general algebraic systems) 08-06 Proceedings of conferences (general algebraic systems) 08-99 General algebraic systems 08-XX General algebraic systems 08A02 General relational systems 08A05 Structure theory of general algebraic systems 08A30 Subalgebras of general algebraic systems 08A35 Endomorphisms on general algebraic systems 08A40 Operations on general algebraic systems 08A45 Equational compactness 08A50 Word problems (universal algebra) 08A55 Partial algebras 08A60 Unary algebras 08A62 Finitary algebras 08A65 Infinitary algebras 08A70 Appl. of universal algebra in computer science 08A99 Universal algebra 08Axx Universal algebra 08B05 Equational logic in varieties of algebras 08B10 Congruence modularity and generalizations in varieties of algebras 08B15 Lattices of varieties of algebras 08B20 Free algebras in varieties of algebras 08B25 Limits in varieties of algebras 08B26 Subdirect products in varieties of algebras 08B30 Injectives or projectives in varieties of algebras 08B99 Varieties of algebras 08Bxx Varieties of algebras 08C05 Categories of algebras 08C10 Axiomatic model classes 08C15 Quasivarieties 08C99 Classes of algebras 08Cxx Other classes of algebras 11-00 Reference works (number theory) 11-01 Textbooks (number theory) 11-02 Research monographs (number theory) 11-03 Historical (number theory) 11-04 Machine computation, programs (number theory) 11-06 Proceedings of conferences (number theory) 11-99 Number theory 11-XX Number theory 11A05 Multiplicative structure of the integers 11A07 Congruences, etc. 11A15 Power residues, etc. 11A25 Arithmetic functions, etc. 11A41 Elemementary prime number theory 11A51 Factorization of numbers 11A55 Continued fractions (number-theoretic results) 11A63 Radix representation 11A67 Representation systems for integers and rationals 11A99 Elementary number theory 11Axx Elementary number theory 11B05 Topology etc. of sets of numbers 11B13 Additive bases 11B25 Arithmetic progressions 11B34 Representation functions 11B37 Recurrences 11B39 Special numbers, etc. 11B50 Sequences (mod m) 11B57 Farey sequences; the sequences 11B65 Binomial coefficients, etc. 11B68 Bernoulli numbers, etc. 11B73 Bell and Stirling numbers 11B75 Combinatorial number theory 11B83 Special sequences of integers and polynomials 11B85 Automata sequences 11B99 Sequences and sets 11Bxx Sequences and sets of numbers 11C08 Polynomials 11C20 Matrices, determinants 11C99 Polynomials and matrices 11Cxx Polynomials and matrices 11D04 Linear diophantine equations 11D09 Quadratic and bilinear diophantine equations 11D25 Cubic and quartic diophantine equations 11D41 Higher degree diophantine equations 11D57 Multiplicative and norm form diophantine equations 11D61 Exponential diophantine equations 11D68 Rational numbers as sums of fractions 11D72 Equations in many variables 11D75 Diophantine inequalities 11D79 Congruences in many variables 11D85 Representation problems of integers 11D88 p-adic and power series fields 11D99 Diophantine equations 11Dxx Diophantine equations 11E04 Quadratic forms over general fields 11E08 Quadratic forms over local rings and fields 11E10 Forms over real fields 11E12 Quadratic forms over global rings and fields 11E16 General binary quadratic forms 11E20 General ternary and quaternary quadratic forms 11E25 Sums of squares, etc 11E39 Bilinear and Hermitian forms 11E41 Class numbers of quadratic and Hermitian forms 11E45 Analytic theory of forms 11E57 Arithmetic properties of classical groups 11E70 K-theory of quadratic and Hermitian forms 11E72 Galois cohomology of linear algebraic groups 11E76 Forms of degree higher than two 11E81 Algebraic theory of quadratic forms 11E88 Quadratic spaces; Clifford algebras 11E95 p-adic theory of forms 11E99 Forms and linear algebraic groups 11Exx Forms and linear algebraic groups 11F03 Modular and automorphic functions 11F06 Structure of modular groups and generalizations 11F11 Modular forms, one variable 11F12 Automorphic forms, one variable 11F20 Dedekind eta function, Dedekind sums 11F22 Relationship of automorphic forms to Lie algebras, etc. 11F25 Hecke-Petersson operators, differential operators (one variable) 11F27 Theta series; Weil representation 11F30 Fourier coefficients of automorphic forms 11F32 Modular correspondences, etc. 11F33 Congruences for (p-adic) modular forms 11F37 Forms of half-integer weight, etc. 11F41 Hilbert modular forms and surfaces 11F46 Siegel modular groups and their modular and automorphic forms 11F55 Groups and their modular and automorphic forms (several variables) 11F60 Differential operators, etc. (several variables) 11F66 Dirichlet series and functional equations related to modular forms 11F67 Special values of automorphic L-series, etc 11F70 Representation-theoretic methods in automorphic theory 11F72 Spectral theory 11F75 Cohomology of arithmetic groups 11F80 Galois properties 11F85 p-adic theory, local fields 11F99 Discontinuous groups and automorphic forms 11Fxx Discontinuous groups and automorphic forms 11G05 Elliptic curves over global fields 11G07 Elliptic curves over local fields 11G09 Drinfel'd modules, etc. 11G10 Abelian varieties of dimension >1 11G15 Complex multiplication and moduli of abelian varieties 11G16 Elliptic and modular units 11G18 Arithmetic aspects of modular and Shimura varieties 11G20 Curves over finite and local fields 11G25 Varieties over finite and local fields 11G30 Curves of arbitrary genus 11G35 Varieties over global fields 11G40 L-functions of varieties over global fields 11G45 Geometric class field theory 11G99 Arithmetic algebraic geometry 11Gxx Arithmetic algebraic geometry (Diophantine geometry) 11H06 Lattices and convex bodies (number theoretic results) 11H16 Nonconvex bodies 11H31 Lattice packing and covering (number-theoretic results) 11H46 Products of linear forms 11H50 Minima of forms 11H55 Quadratic forms 11H56 Automorphism groups of lattices 11H60 Mean value and transfer theorems 11H99 Geometry of numbers 11Hxx Geometry of numbers 11J04 Homogeneous approximation to one number 11J06 Markov and Lagrange spectra and generalizations 11J13 Simultaneous homogeneous approximation, linear forms 11J17 Approximation by numbers from a fixed field 11J20 Inhomogeneous linear forms 11J25 Diophantine inequalities 11J54 Small fractional parts of polynomials and generalizations 11J61 Approximation in non-Archimedean valuations 11J68 Approximation to algebraic numbers 11J70 Continued fractions and generalizations 11J71 Distribution modulo one 11J72 Irrationality 11J81 Transcendence (general theory) 11J82 Measures of irrationality and of transcendence 11J83 Metric theory 11J85 Algebraic independence results 11J86 Linear forms in logarithms; Baker's method 11J89 Transcendence theory of elliptic and abelian functions 11J91 Transcendence theory of other special functions 11J99 Diophantine approximation 11Jxx Diophantine approximation 11K06 General theory of distribution modulo 1 11K16 Normal numbers, etc. 11K31 Special sequences 11K36 Well-distributed sequences and other variations 11K38 Irregularities of distribution 11K41 Continuous, p-adic and abstract analogues 11K45 Pseudo-random numbers, etc. 11K50 Metric theory of continued fractions 11K55 Metric theory of other number-theoretic algorithms and expansions 11K60 Diophantine approximation (probabilistic number theory) 11K65 Arithmetic functions (probabilistic number theory) 11K70 Harmonic analysis and almost periodicity 11K99 Probabilistic theory 11Kxx Probabilistic number theory 11L03 Trigonometric and exponential sums, general 11L05 Gauss and Kloosterman sums 11L07 Estimates on exponential sums 11L10 Complete character sums 11L15 Weyl sums 11L20 Sums over primes 11L26 Sums over arbitrary intervals 11L40 Estimates on character sums 11L99 Exponential sums and character sums 11Lxx Exponential sums and character sums 11M06 Riemannian zeta-function and Dirichlet L-function 11M20 Real zeros of L(s,chi) 11M26 Nonreal zeros of zeta(s) and L(s,chi) 11M35 Other zeta functions 11M36 Selberg zeta functions and regularized determinants 11M41 Other Dirichlet series and zeta functions 11M45 Tauberian theorems 11M99 Analytic theory of zeta and L-functions 11Mxx Analytic theory of zeta and L-functions 11N05 Distribution of primes 11N13 Primes in progressions 11N25 Distribution of integers with specified multiplicative constraints 11N30 Turan theory 11N32 Primes represented by polynomials 11N35 Sieves 11N36 Appl. of sieve methods 11N37 Asymptotic results on arithmetic functions 11N45 Asymptotic results on counting functions for other structures 11N56 Rate of growth of arithmetic functions 11N60 Distribution functions (additive and positive multipl. functions) 11N64 Characterization of arithmetic functions 11N69 Distribution of integers in special residue classes 11N75 Appl. of automorphic theory to multiplicative problems 11N80 Generalized primes and integers 11N99 Multiplicative number theory 11Nxx Multiplicative number theory 11P05 Waring's problem and variants 11P21 Lattice points in specified regions 11P32 Additive questions involving primes 11P55 Appl. of the Hardy-Littlewood method 11P81 Elementary theory of partitions 11P82 Analytic theory of partitions 11P83 Partitions: congruences and congruential restrictions 11P99 Additive number theory 11Pxx Additive number theory 11R04 Algebraic numbers 11R06 Special algebraic numbers 11R09 Polynomials over global fields 11R11 Quadratic extensions 11R16 Cubic and quartic extensions 11R18 Cyclotomic extensions 11R20 Other abelian and metabelian extensions 11R21 Other number fields 11R23 Iwasawa theory 11R27 Units and factorization 11R29 Class numbers, class groups, discriminants 11R32 Galois theory for global fields 11R33 Integral representations related to algebraic numbers 11R34 Galois cohomology for global fields 11R37 Class field theory for global fields 11R39 Langlands-Weil conjectures, nonabelian class field theory 11R42 Zeta functions and L-functions of global number fields 11R44 Distribution of prime ideals 11R45 Density theorems 11R47 Other analytic theory 11R52 Quaternion and other division algebras: arithmetic, zeta functions 11R54 Other algebras and orders, and their zeta and L-functions 11R56 Adele rings and groups 11R58 Arithmetic theory of algebraic function fields 11R65 Class groups and Picard groups of orders 11R70 K-theory of global fields 11R80 Totally real fields, etc. 11R99 Algebraic number theory over global fields 11Rxx Algebraic number theory: global fields 11S05 Polynomials over local fields 11S15 Ramification and extension theory 11S20 Galois theory for local fields 11S23 Integral representations for local fields 11S25 Galois cohomology for local fields 11S31 Class field theory for local fields 11S37 Langlands-Weil conjectures, nonabelian class field theory 11S40 Zeta functions and L-functions of local number fields 11S45 Algebras and orders, and their zeta functions 11S70 K-theory of local fields 11S80 Other analytic theory of local fields 11S85 Other nonanalytic theory of local fields 11S99 Algebraic number theory over local and p-adic fields 11Sxx Algebraic number theory: local and p-adic fields 11T06 Polynomials over finite fields or rings 11T22 Cyclotomy 11T23 Exponential sums 11T24 Other character sums and Gauss sums 11T30 Structure theory of finite fields 11T55 Arithmetic theory of polynomial rings over finite fields 11T71 Algebraic coding theory 11T99 Finite fields and commutative rings (number-theoretic aspects) 11Txx Finite fields and finite commutative rings (number-theoretic) 11U05 Decidability related to number theory 11U07 Ultraproducts in number theory 11U09 Connections of number theory with model theory 11U10 Nonstandard arithmetic in number theory 11U99 Connections of number theory with logic 11Uxx Connections of number theory with logic 11Y05 Factorization 11Y11 Primality 11Y16 Algorithms 11Y35 Analytic computations 11Y40 Algebraic number theory computations 11Y50 Computer solution of Diophantine equations 11Y55 Calculation of integer sequences 11Y60 Evaluation of constants 11Y65 Continued fraction calculations 11Y70 Values of arithmetic functions 11Y99 Computational number theory 11Yxx Computational number theory 11Z05 Miscellaneous appl. of number theory 12-00 Reference works (field theory) 12-01 Textbooks (field theory) 12-02 Research monographs (field theory) 12-03 Historical (field theory) 12-04 Machine computation, programs (field theory) 12-06 Proceedings of conferences (field theory) 12-99 Field theory and polynomials 12-XX Field theory and polynomials 12D05 Factorization of real or complex polynomials 12D10 Algebraic theorems of location of zeros of polynomials over R or C 12D15 Formally real fields 12D99 Real and complex fields 12Dxx Real and complex fields 12E05 Polynomials over general fields 12E10 Special polynomials over general fields 12E12 Algebraic equations 12E15 Skew fields over special fields 12E20 Finite fields (field-theoretic aspects) 12E25 Hilbertian fields; Hilbert's irreducibility theorem 12E99 General field theory 12Exx General field theory 12F05 Algebraic extensions 12F10 Galois theory 12F12 Inverse Galois theory 12F15 Inseparable extensions 12F20 Transcendental extensions 12F99 Field extensions 12Fxx Field extensions 12G05 Galois cohomology 12G10 Cohomological dimension 12G99 Homological methods in field theory 12Gxx Homological methods in field theory 12H05 Differential algebra 12H10 Difference algebra 12H20 Abstract differential equations 12H25 p-adic differential equations 12H99 Differential algebra 12Hxx Differential algebra, etc. 12J05 Normed fields 12J10 Valued fields 12J12 Formally p-adic fields 12J15 Ordered fields 12J17 Topological semi-fields 12J20 General valuation theory 12J25 Non-Archimedean valued fields 12J27 Krasner-Tate algebras 12J99 Topological fields 12Jxx Topological fields 12K05 Near-fields 12K10 Semi-fields 12K99 Generalizations of fields 12Kxx Generalizations of fields 12L05 Decidability related to field theory 12L10 Ultraproducts in field theory 12L12 Model theory for fields 12L15 Nonstandard arithmetic for fields 12L99 Connections of field theory with logic 12Lxx Connections of field theory with logic 12Y05 Computational aspects of field theory and polynomials 13-00 Reference works (commutative rings and algebras) 13-01 Textbooks (commutative rings and algebras) 13-02 Research monographs (commutative rings and algebras) 13-03 Historical (commutative rings and algebras) 13-04 Machine computation, programs (commutative rings and algebras) 13-06 Proceedings of conferences (commutative rings and algebras) 13-99 Commutative rings and algebras 13-XX Commutative rings and algebras 13A02 Graded rings 13A05 Divisibility 13A10 Radical theory on commutative rings 13A15 Ideals; multiplicative ideal theory 13A18 Valuations and their generalizations 13A20 Brauer group 13A30 Associated graded rings of ideals and related topics 13A35 Characteristic p methods 13A50 Invariant theory 13A99 General commutative ring theory 13Axx General commutative ring theory 13B02 Extension theory (commutative rings) 13B05 Galois theory (commutative rings) 13B10 Automorphisms, etc. (commutative rings) 13B15 Ramification theory 13B21 Integral dependence 13B22 Integral closure; integrally closed rings, related rings 13B24 Going up; going down; going between 13B25 Polynomials over commutative rings 13B30 Localization 13B35 Completion of rings 13B40 Etale extensions, etc. 13B99 Ring extensions 13Bxx Ring extensions and related topics 13C05 Structure of modules (commutative rings) 13C10 Projective modules, etc. 13C11 Injective modules etc. 13C12 Torsion modules 13C13 Other special types of modules (commutative rings) 13C14 Cohen-Macaulay modules 13C15 Dimension theory, etc. (commutative rings) 13C20 Class groups 13C40 Linkage, complete intersections and determinantal ideals 13C99 Theory of modules and ideals 13Cxx Theory of modules (commutative rings) 13D02 Syzygies 13D03 (Co)homology of commutative rings and algebras 13D05 Homological dimension (commutative rings) 13D10 Infinitesimal methods, etc. 13D15 K-theory (commutative rings) 13D25 Complexes 13D30 Torsion theories (commutative rings) 13D40 Hilbert-Samuel functions and Poincare series 13D45 Local cohomology 13D99 Homological methods (commutative rings) 13Dxx Homological methods (commutative rings) 13E05 Noetherian rings and modules 13E10 Artinian rings and modules 13E15 Rings and modules of finite generation 13E99 Chain conditions, finiteness conditions 13Exx Chain conditions, finiteness conditions 13F05 Dedekind and Pruefer rings and their generalizations 13F07 Euclidean rings and generalizations 13F10 Principal ideal rings 13F15 Factorial rings, unique factorization domains 13F20 Polynomial rings 13F25 Formal power series rings 13F30 Valuation rings 13F40 Excellent rings 13F45 Seminormal rings 13F50 Rings with straightening laws, Hodge algebras 13F99 Arithmetic rings 13Fxx Arithmetic rings 13G05 Integral domains 13H05 Regular local rings 13H10 Special types of local rings 13H15 Multiplicity theory and related topics 13H99 Local rings 13Hxx Local rings and generalizations 13J05 Power series rings 13J07 Analytic algebras and rings 13J10 Complete rings, completion 13J15 Henselian rings 13J20 Global topological rings 13J25 Commutative ordered rings 13J99 Topological rings 13Jxx Topological rings 13K05 Witt vectors and related rings 13L05 Appl. of logic to commutative algebra 13M05 Structure of finite commutative rings 13M10 Polynomials over finite commutative rings 13M99 Finite commutative rings 13Mxx Finite commutative rings 13N05 Differential algebra (commutative algebra) 13N10 Rings of differential operators 13N99 Differential algebra 13Nxx Differential algebra 13P05 Polynomials, factorization 13P10 Polynomial ideals, Groebner bases 13P99 Computational aspects of commutative algebra 13Pxx Computational aspects of commutative algebra 14-00 Reference works (algebraic geometry) 14-01 Textbooks (algebraic geometry) 14-02 Research monographs (algebraic geometry) 14-03 Historical (algebraic geometry) 14-04 Machine computation, programs (algebraic geometry) 14-06 Proceedings of conferences (algebraic geometry) 14-99 Algebraic geometry 14-XX Algebraic geometry 14A05 Relevant commutative algebra 14A10 Varieties 14A15 Schemes 14A20 Generalizations (algebraic spaces, etc.) 14A22 Noncommutative algebraic geometry, etc. 14A25 Elementary questions of algebraic geometry 14A99 Foundations of algebraic geometry 14Axx Foundations of algebraic geometry 14B05 Singularities (algebraic geometry) 14B07 Deformations of singularities (local theory) 14B10 Infinitesimal methods 14B12 Local deformation theory 14B15 Local cohomology 14B20 Formal neighborhoods 14B99 Local algebraic geometry 14Bxx Local algebraic geometry 14C05 Parametrization 14C10 Equivalence relations (cycles) 14C15 Rational equivalence rings 14C17 Intersection theory 14C20 Divisors, linear systems, invertible sheaves 14C21 Webs, nets 14C22 Picard groups 14C25 Algebraic cycles 14C30 Transcendental methods 14C34 Torelli problem 14C35 Appl. of methods of algebraic K-theory 14C40 Riemann-Roch theorems 14C99 Cycles and subschemes 14Cxx Cycles and subschemes 14D05 Structure of families 14D07 Variation of Hodge structures 14D10 Arithmetic ground fields 14D15 (Formal) deformations 14D20 Algebraic moduli problems 14D22 Fine and coarse moduli spaces 14D25 Geometric invariants 14D99 Families, fibrations 14Dxx Families, fibrations 14E05 Birational correspondences 14E07 Birational automorphisms, Cremona group and generalizations 14E09 Automorphisms 14E10 General correspondences 14E15 Global theory of singularities 14E20 Coverings, fundamental group (mappings) 14E22 Ramification problems 14E25 Embeddings (algebraic varieties) 14E30 Minimal models 14E35 Results in dimension <=1 54F55 Unicoherence, multicoherence 54F65 Topological characterizations of particular spaces 54F99 Special properties of topological spaces 54Fxx Special properties of topological spaces 54G05 Extremally disconnected spaces, etc. 54G10 P-spaces 54G12 Scattered spaces 54G15 Pathological spaces 54G20 Counterexamples (general topology) 54G99 Peculiar topological spaces 54Gxx Peculiar topological spaces 54H05 Descriptive set theory (topological aspects) 54H10 Topological representations of algebraic systems 54H11 Topological groups (topological aspects) 54H12 Topological lattices (topological aspects) 54H13 Topological fields, etc. (topological aspects) 54H15 Transformation groups of topological spaces 54H20 Topological dynamics 54H25 Fixed-point theorems in topological spaces 54H99 Connections of general topology with other structures 54Hxx Connections of general topology with other structures 54J05 Nonstandard topology 55-00 Reference works (algebraic topology) 55-01 Textbooks (algebraic topology) 55-02 Research monographs (algebraic topology) 55-03 Historical (algebraic topology) 55-04 Machine computation, programs (algebraic topology) 55-06 Proceedings of conferences (algebraic topology) 55-99 Algebraic topology 55-XX Algebraic topology 55M05 Topological duality 55M10 Dimension theory (algebraic topology) 55M15 Absolute neighborhood retracts 55M20 Fixed points and coincidences (algebraic topology) 55M25 Degree, etc. 55M30 Lyusternik-Shnirel'man category of a space 55M35 Finite groups of transformations 55M99 Classical algebraic topology 55Mxx Classical topics of algebraic topology 55N05 Cech types 55N07 Steenrod-Sitnikov homologies 55N10 Singular theory 55N15 K-theory (algebraic topology) 55N20 Generalized homology and cohomology theories 55N22 Bordism and cobordism theories, etc. 55N25 Homology with local coefficients, equivariant cohomology 55N30 Sheaf cohomology 55N33 Intersection homology and cohomology 55N35 Other homology theories 55N40 Axioms for homology theory and uniqueness theorems 55N45 Products and intersections 55N91 Equivariant homology and cohomology 55N99 Homology and cohomology theories 55Nxx Homology and cohomology theories 55P05 Homotopy extension properties, cofibrations 55P10 Homotopy equivalences 55P15 Classification of homotopy type 55P20 Eilenberg-MacLane spaces 55P25 Spanier-Whitehead duality 55P30 Eckmann-Hilton duality 55P35 Loop spaces 55P40 Suspensions 55P42 Stable homotopy theory 55P45 H-spaces and duals 55P47 Infinite loop spaces 55P50 Category and cocategory 55P55 Shape theory 55P60 Localization and completion 55P62 Rational homotopy theory 55P65 Homotopy functors 55P91 Equivariant homotopy theory 55P99 Homotopy theory 55Pxx Homotopy theory 55Q05 General theory of homotopy groups 55Q07 Shape groups 55Q10 Stable homotopy groups 55Q15 Whitehead products and generalizations 55Q20 Homotopy groups of wedges, etc. 55Q25 Hopf invariants 55Q30 Homotopy groups of triads, n-ads 55Q35 Operations in homotopy groups 55Q40 Homotopy groups of spheres 55Q45 Stable homotopy of spheres 55Q50 J-morphism 55Q52 Homotopy groups of special spaces 55Q55 Cohomotopy groups 55Q70 Homotopy groups of special types 55Q91 Equivariant homotopy groups 55Q99 Homotopy groups 55Qxx Homotopy groups 55R05 Fiber spaces 55R10 Fiber bundles 55R12 Transfer 55R15 Classification 55R20 Spectral sequences and homology of fiber spaces 55R25 Sphere bundles and vector space bundles 55R35 Classifying spaces of groups and H-spaces 55R40 Homology of classifying spaces, characteristic classes 55R45 Homology and homotopy of BO and BU 55R50 Stable classes of vector space bundles, K-theory 55R55 Fiberings with singularities 55R60 Microbundles and block bundles 55R65 Generalizations of fiber spaces and bundles 55R91 Equivariant fiber spaces and bundles 55R99 Fiber spaces and bundles 55Rxx Fiber spaces and bundles 55S05 Primary cohomology operations 55S10 Steenrod algebra 55S12 Dyer-Lashof operations 55S15 Symmetric products, etc. 55S20 Secondary and higher cohomology operations 55S25 K-theory operations and generalized cohomology operations 55S30 Massey products 55S35 Obstruction theory 55S36 Extension and compression of mappings 55S37 Classification of mappings 55S40 Sectioning fiber spaces and bundles 55S45 Postnikov system, k-invariants 55S91 Equivariant operations and obstructions 55S99 Operations and obstructions 55Sxx Operations and obstructions 55T05 General spectral sequences 55T10 Serre spectral sequences 55T15 Adams spectral sequences 55T20 Eilenberg-Moore spectral sequences 55T25 Generalized cohomology 55T99 Spectral sequences 55Txx Spectral sequences 55U05 Abstract complexes 55U10 Semisimplicial complexes 55U15 Chain complexes 55U20 Universal coefficient theorems, Bockstein operator 55U25 Homology of a product, Kuenneth formula 55U30 Duality (applied homological algebra) 55U35 Abstract homotopy theory 55U40 Topological categories 55U99 Applied homological algebra and category theory 55Uxx Applied homological algebra and category theory 57-00 Reference works (manifolds) 57-01 Textbooks (manifolds) 57-02 Research monographs (manifolds) 57-03 Historical (manifolds) 57-04 Machine computation, programs (manifolds) 57-06 Proceedings of conferences (manifolds) 57-99 Manifolds and cell complexes 57-XX Manifolds and cell complexes 57M05 Fundamental group, etc. 57M07 Topological methods in group theory 57M10 Covering spaces 57M12 Special coverings 57M15 Relations with graph theory 57M20 Two-dimensional complexes 57M25 Knots and links in the 3-sphere 57M30 Wild knots and surfaces, wild imbeddings 57M35 Dehn's lemma, sphere theorem, loop theorem, asphericity 57M40 Characterizations of Euclidean 3-space and 3-sphere 57M50 Geometric structures on low-dimensional manifolds 57M60 Group actions in low dimensions 57M99 Low-dimensional topology 57Mxx Low-dimensional topology 57N05 Topology of Euclidean 2-space, 2-manifolds 57N10 Topology of general 3-manifolds 57N12 Topology of Euclidean 3-space and 3-sphere 57N13 Topology of Euclidean 4-space, 4-manifolds 57N15 Topology of Euclidean n-space, n-manifolds 57N17 Topology of topological vector spaces 57N20 Topology of infinite-dimensional manifolds 57N25 Shapes 57N30 Engulfing 57N35 Imbeddings and immersions (topological manifolds) 57N37 Isotopy and pseudo-isotopy 57N40 Neighborhoods of submanifolds 57N45 Flatness and tameness 57N50 (n-1)-sphere in Euclidean n-space 57N55 Microbundles and block bundles 57N60 Cellularity 57N65 Algebraic topology of manifolds 57N70 Cobordism and concordance 57N75 General position and transversality 57N80 Stratifications 57N99 Topological manifolds 57Nxx Topological manifolds 57P05 Local properties of generalized manifolds 57P10 Poincare duality spaces 57P99 Generalized manifolds 57Pxx Generalized manifolds 57Q05 General topology of complexes 57Q10 Simple homotopy type, etc. 57Q12 Wall finiteness obstruction for CW-complexes 57Q15 Triangulating manifolds 57Q20 Cobordism (PL-topology) 57Q25 Comparison of PL-structures 57Q30 Engulfing (PL-topology) 57Q35 Imbeddings and immersions (PL-topology) 57Q37 Isotopy (PL-topology) 57Q40 Regular neighborhoods 57Q45 Knots and links in high dimensions (PL-topology) 57Q50 Microbundles and block bundles (PL-topology) 57Q55 Approximations (PL-topology) 57Q60 Cobordism and concordance (PL-topology) 57Q65 General position and transversality (PL-topology) 57Q91 Equivariant PL-topology 57Q99 PL-topology 57Qxx PL-topology 57R05 Triangulating 57R10 Smoothing 57R12 Smooth approximations 57R15 Specialized structures on manifolds 57R19 Algebraic topology on manifolds 57R20 Characteristic classes and numbers 57R22 Topology of vector bundles and fiber bundles 57R25 Vector fields, frame fields 57R27 Controllability of vector fields on C-infinity (etc.) manifolds 57R30 Foliations; geometric theory 57R32 Classifying spaces for foliations 57R35 Differentiable mappings (differential topology) 57R40 Imbeddings (differential topology) 57R42 Immersions (differential topology) 57R45 Singularities of differentiable mappings 57R50 Diffeomorphisms 57R52 Isotopy (differential topology) 57R55 Differentiable structures 57R57 Appl. of global analysis to structures on manifolds 57R60 Homotopy spheres, Poincare conjecture 57R65 Surgery and handlebodies 57R67 Surgery obstructions, Wall groups 57R70 Critical points and critical submanifolds 57R75 O- and SO-cobordism 57R77 Complex cobordism (U- and SU-cobordism) 57R80 h- and s-cobordism 57R85 Equivariant cobordism 57R90 Other types of cobordism 57R91 Equivariant algebraic topology of manifolds 57R95 Realizing cycles by submanifolds 57R99 Differential topology 57Rxx Differential topology 57S05 Topological properties of groups of homeomorphisms, etc. 57S10 Compact groups of homeomorphisms 57S15 Compact Lie groups of differentiable transformations 57S17 Finite transformation groups 57S20 Noncompact Lie groups of transformations 57S25 Groups acting on specific manifolds 57S30 Discontinuous groups of transformations 57S99 Topological transformation groups 57Sxx Topological transformation groups 57T05 Hopf algebras 57T10 Homology and cohomology of Lie groups 57T15 Homology and cohomology of homogeneous spaces of Lie groups 57T20 Homotopy groups of topological groups and homogeneous spaces 57T25 Homology and cohomology of H-spaces 57T30 Bar and cobar constructions 57T35 Appl. of Eilenberg-Moore spectral sequences 57T99 Homology and homotopy of topological groups 57Txx Homology and homotopy of topological groups and related structures 58-00 Reference works (global analysis) 58-01 Textbooks (global analysis) 58-02 Research monographs (global analysis) 58-03 Historical (global analysis) 58-04 Machine computation, programs (global analysis) 58-06 Proceedings of conferences (global analysis) 58-99 Global analysis, analysis on manifolds 58-XX Global analysis 58A03 Topos-theoretic approach to differential manifolds 58A05 Foundations of differentiable manifolds 58A07 Real-analytic manifolds, etc. 58A10 Differential forms 58A12 de Rham theory (global analysis) 58A14 Hodge theory (global analysis) 58A15 Exterior differential systems (Cartan theory) 58A17 Pfaffian systems 58A20 Jets 58A25 Currents (global analysis) 58A30 Vector distributions (global analysis) 58A35 Stratified sets (global analysis) 58A40 Differential spaces (global analysis) 58A50 Supermanifolds, etc. (global analysis) 58A99 General theory of differentiable manifolds 58Axx General theory of differentiable manifolds 58B05 Topological questions of infinite-dimensional manifolds 58B10 Differentiability questions in infinite-dimensional manifolds 58B12 Questions of holomorphy in infinite-dimensional manifolds 58B15 Fredholm structures on infinite-dimensional manifolds 58B20 Geometric structures on infinite-dimensional manifolds 58B25 Group structures and generalizations on infinite-dim. manifolds 58B30 Noncommutative differential geometry and topology 58B99 Infinite-dimensional manifolds 58Bxx Infinite-dimensional manifolds 58C05 Real-valued functions on manifolds 58C06 Set-valued mappings etc. on manifolds 58C07 Continuity properties of mappings on manifolds 58C10 Holomorphic maps on manifolds (global analysis) 58C15 Implicit function theorems etc. on manifolds 58C20 Generalized differentiation theory on manifolds 58C25 Differentiable maps on manifolds (global analysis) 58C27 Singularities of differentiable maps on manifolds 58C28 Catastrophes 58C30 Fixed point theorems on manifolds 58C35 Integration on manifolds 58C40 Spectral theory on manifolds 58C50 Analysis on supermanifolds, etc. 58C99 Calculus on manifolds 58Cxx Calculus on manifolds 58D05 Groups of diffeomorphisms and homeomorphisms as manifolds 58D07 Groups and semigroups of nonlinear operators 58D10 Spaces of imbeddings and immersions 58D15 Manifolds of mappings 58D17 Manifolds of metrics 58D19 Global group actions and symmetry properties on manifolds 58D20 Measures on manifolds of maps 58D25 Differential equations in function spaces 58D27 Moduli problems for diff.geometric structures on spaces of mappings 58D29 Moduli problems for topological structures on manifolds of mappings 58D30 Spaces and manifolds of mappings in appl. to physics 58D99 Spaces and manifolds of mappings 58Dxx Spaces and manifolds of mappings 58E05 Abstract critical point theory 58E07 Abstract bifurcation theory 58E09 Group-invariant bifurcation theory 58E10 Appl. of bifurcation theory to geodesics 58E11 Critical metrics in infinite-dimensional spaces 58E12 Appl. of variational methods to minimal surfaces 58E15 Appl. of variational methods to extremal problems in sev.variables 58E17 Pareto optimality, etc., appl. to economics 58E20 Harmonic maps between infinite-dimensional spaces 58E25 Appl. of variational methods to control theory 58E30 Variational principles on infinite-dimensional spaces 58E35 Variational inequalities (global problems) 58E46 Variational problems under group actions on infinite-dim. spaces 58E50 Appl. of variational methods in infinite-dimensional spaces 58E99 Variational problems in infinite-dimensional spaces 58Exx Variational problems in infinite-dimensional spaces 58F03 One-dimensional dynamics, general; symbolic dynamics 58F05 Hamiltonian and Lagrangian systems on manifolds 58F06 Geometric quantization (appl. of representation theory) 58F07 Completely integrable dynamical systems 58F08 Point-mapping properties, iterations, completeness (dyn. systems) 58F09 Morse-Smale systems 58F10 Stability theory of ODE on manifolds 58F11 Ergodic theory of dynamical systems on manifolds 58F12 Structure of attractors 58F13 Pathologies of dynamical systems 58F14 Bifurcation theory and singularities of dynamical systems 58F15 Hyperbolic structures of dynamical systems 58F17 Geodesic and horocycle flows 58F18 Relations of dynamical systems with foliations 58F19 Eigenvalue and spectral problems of ODE on manifolds 58F20 Periodic points, etc. (dynamical systems) 58F21 Limit cycles, etc. of ODE on manifolds 58F22 Periodic solutions of ODE on manifolds 58F23 Holomorphic flows 58F25 Flows on manifolds (general aspects) 58F27 Quasiperiodic flows 58F30 Perturbations of dynamical systems 58F32 Functional-differential equations on manifolds 58F35 Invariance properties (ODE on manifolds) 58F36 Normal forms for ODE or diffeomorphisms 58F37 Correspondences and other transformation methods (ODE on manifolds) 58F39 Dynamical systems treatment of PDE 58F40 Appl. of ODE on manifolds to physics 58F99 ODE on manifolds and dynamical systems 58Fxx Ordinary differential equations on manifolds; dynamical systems 58G03 Elliptic equations on manifolds; general theory 58G05 Differential complexes on manifolds; elliptic complexes 58G07 Hyperfunctions on manifolds 58G10 Index theory and fixed point theorems (global analysis) 58G11 Heat and other parabolic equation methods (global analysis) 58G12 Exotic index theories (global analysis) 58G15 Pseudodifferential and Fourier integral operators on manifolds 58G16 Hyperbolic equations on manifolds 58G17 Propagation of singularities (PDE on manifolds) 58G18 Perturbations and asymptotics (PDE on manifolds) 58G20 Boundary value problems of PDE on manifolds 58G25 Spectral problems of PDE on manifolds, etc. 58G26 Determinants and determinant bundles on manifolds 58G28 Bifurcations (PDE on manifolds) 58G30 Relations of PDE with special manifold structures 58G32 Diffusion processes and stochastic analysis on manifolds 58G35 Invariance properties (PDE on manifolds) 58G37 Correspondences and other transformation methods (PDE on manifolds) 58G40 Appl. of PDE on manifolds to physics 58G99 Partial differential equations on manifolds 58Gxx Partial differential equations on manifolds; differential operators 58H05 Pseudogroups on manifolds 58H10 Cohomology of classifying spaces for pseudogroup structures 58H15 Global deformations of structures on manifolds 58H99 Pseudogroups and general structures on manifolds 58Hxx Pseudogroups and general structures on manifolds 58Z05 Appl. of global analysis to physics 60-00 Reference works (probability theory) 60-01 Textbooks (probability theory) 60-02 Research monographs (probability theory) 60-03 Historical (probability theory) 60-04 Machine computation, programs (probability theory) 60-06 Proceedings of conferences (probability theory) 60-99 Probability theory and stochastic processes 60-XX Probability theory and stochastic processes 60A05 Axioms of probability theory 60A10 Probabilistic measure theory 60A99 Foundations of probability theory 60Axx Foundations of probability theory 60B05 Probability measures on topological spaces 60B10 Convergence of probability measures 60B11 Probability theory on linear topological spaces 60B12 Limit theorems for vector-valued random variables (inf.-dim.case) 60B15 Probability measures on groups 60B99 Probability theory on general structures 60Bxx Probability theory on general structures 60C05 Combinatorial probability 60D05 Geometric probability 60E05 General theory of probability distributions 60E07 Infinitely divisible distributions 60E10 Transforms of probability distributions 60E15 Inequalities in probability theory 60E99 Distribution theory in probability theory 60Exx Distribution theory in probability theory 60F05 Weak limit theorems 60F10 Large deviations 60F15 Strong limit theorems 60F17 Functional limit theorems 60F20 Zero-one laws 60F25 Lp-limit theorems (probability) 60F99 Limit theorems (probability) 60Fxx Limit theorems (probability) 60G05 Foundations of stochastic processes 60G07 General theory of stochastic processes 60G09 Exchangeability 60G10 Stationary processes 60G12 General second order processes 60G15 Gaussian processes 60G17 Sample path properties 60G18 Self-similar processes 60G20 Generalized stochastic processes 60G25 Prediction theory 60G30 Induced measures of stochastic processes 60G35 Appl. of stochastic processes 60G40 Optimal stopping 60G42 Martingales with discrete parameter 60G44 Martingales with continuous parameter 60G46 Martingales and classical analysis 60G48 Generalizations of martingales 60G50 Sums of independent random variables 60G55 Point processes 60G57 Random measures 60G60 Random fields 60G70 Extreme value theory (probability) 60G99 Stochastic processes 60Gxx Stochastic processes 60H05 Stochastic integrals 60H07 Stochastic calculus of variations and the Malliavin calculus 60H10 Stochastic ordinary differential equations 60H15 Stochastic partial differential equations 60H20 Stochastic integral equations 60H25 Random operators, etc. 60H30 Appl. of stochastic analysis 60H99 Stochastic analysis 60Hxx Stochastic analysis 60J05 Markov processes with discrete parameter 60J10 Markov chains with discrete parameter 60J15 Random walk 60J20 Appl. of discrete Markov processes 60J25 Markov processes with continuous parameter 60J27 Markov chains with continuous parameter 60J30 Markov processes with independent increments 60J35 Transition functions 60J40 Right processes 60J45 Probabilistic potential theory 60J50 Boundary theory (probability) 60J55 Additive functionals 60J57 Multiplicative functionals 60J60 Diffusion processes 60J65 Brownian motion 60J70 Appl. of diffusion theory 60J75 Jump processes 60J80 Branching processes 60J85 Appl. of branching processes 60J99 Markov processes 60Jxx Markov processes 60K05 Renewal theory 60K10 Appl. of renewal theory 60K15 Markov renewal processes 60K20 Appl. of Markov renewal processes 60K25 Queueing theory 60K30 Appl. of queueing theory 60K35 Interacting random processes 60K40 Physical appl. of random processes 60K99 Special processes 60Kxx Special processes 62-00 Reference works (statistics) 62-01 Textbooks (statistics) 62-02 Research monographs (statistics) 62-03 Historical (statistics) 62-04 Machine computation, programs (statistics) 62-06 Proceedings of conferences (statistics) 62-07 Data analysis (statistics) 62-09 Graphical methods in statistics 62-99 Statistics 62-XX Statistics 62A05 Invariance and group considerations in statistics 62A10 The likelihood approach 62A15 The Bayesian approach 62A20 Classical approach in statistics 62A25 Structural approach in statistics 62A30 The fiducial approach 62A99 Foundations of statistics 62Axx Foundations of statistics 62B05 Sufficient statistics 62B10 Statistical information theory 62B15 Comparison of statistical experiments 62B20 Measure-theoretic results in statistics 62B99 Statistical sufficiency and information 62Bxx Statistical sufficiency and information 62C05 General considerations in statistical decision theory 62C07 Complete class results in statistical decision theory 62C10 Bayesian problems 62C12 Empirical statistical decision procedures 62C15 statistical admissibility 62C20 Statistical minimax procedures 62C25 Compound decision problems in statistics 62C99 Statistical decision theory 62Cxx Statistical decision theory 62D05 Statistical sampling theory 62E10 Structure theory of statistical distributions 62E15 Exact distribution theory in statistics 62E17 Approximations to statistical distributions (nonasymptotic) 62E20 Asymptotic distribution theory in statistics 62E25 Statistical Monte Carlo studies (distribution theory) 62E30 Formal computational methods for statistical distributions 62E99 Statistical distribution theory 62Exx Statistical distribution theory 62F03 Parametric hypothesis testing 62F04 Small sample properties of parametric tests 62F05 Asymptotic properties of parametric tests 62F07 Statistical ranking and selection procedures 62F10 Point estimation 62F11 Small sample properties of parametric estimators 62F12 Asymptotic properties of parametric estimators 62F15 Bayesian inference 62F25 Parametric confidence regions, etc. 62F30 Statistical inference under constraints 62F35 Robustness and adaptive procedures 62F99 Parametric inference 62Fxx Parametric inference 62G05 Nonparametric estimation 62G07 Curve estimation 62G09 Statistical resampling methods 62G10 Nonparametric hypothesis testing 62G15 Nonparametric confidence regions, etc. 62G20 Nonparametric asymptotic efficiency 62G30 Order statistics, etc. 62G35 Nonparametric robustness 62G99 Nonparametric inference 62Gxx Nonparametric inference 62H05 Multivariate structure theory 62H10 Multivariate distributions of statistics 62H11 Directional data; spatial statistics 62H12 Multivariate estimation 62H15 Multivariate hypothesis testing 62H17 Contingency (statistics) 62H20 Statistical measures of associations 62H25 Factor analysis, etc. 62H30 Statistical classification, etc. 62H40 Projection pursuit 62H99 Multivariate analysis 62Hxx Multivariate analysis 62J02 General nonlinear regression 62J05 Linear regression 62J07 Ridge regression 62J10 Analysis of variance, etc. 62J12 Generalized linear models 62J15 Multiple comparisons 62J20 Regression diagnostics 62J99 Linear statistical inference 62Jxx Linear statistical inference 62K05 Optimal statistical designs 62K10 Statistical block designs 62K15 Factorial statistical designs 62K99 Experimental statistical design 62Kxx Experimental statistical design 62L05 Sequential statistical designs 62L10 Sequential statistical analysis 62L12 Sequential estimation 62L15 Optimal stopping (statistics) 62L20 Stochastic approximation 62L99 Sequential statistical methods 62Lxx Sequential statistical methods 62M02 Markov processes: hypothesis testing 62M05 Markov processes: estimation 62M07 Non-Markovian processes: hypothesis testing 62M09 Non-Markovian processes: estimation 62M10 Time series, etc. (statistics) 62M15 Spectral analysis of processes 62M20 Prediction, etc. (statistics) 62M30 Statistics of spatial processes 62M40 Statistics of random fields 62M99 Inference from stochastic processes 62Mxx Inference from stochastic processes 62N05 Reliability, etc. (statistics) 62N10 Statistical quality control 62N99 Engineering statistics 62Nxx Engineering statistics 62P05 Appl. of statistics to actuarial sciences and financial mathematics 62P10 Appl. of statistics to biology 62P15 Appl. of statistics to psychology 62P20 Appl. of statistics to economics 62P25 Appl. of statistics to social sciences 62P99 Appl. of statistics 62Pxx Appl. of statistics 62Q05 Statistical tables 65-00 Reference works (numerical analysis) 65-01 Textbooks (numerical analysis) 65-02 Research monographs (numerical analysis) 65-03 Historical (numerical analysis) 65-04 Machine computation, programs (numerical analysis) 65-05 Experimental papers 65-06 Proceedings of conferences (numerical analysis) 65-99 Numerical analysis 65-XX Numerical analysis 65A05 Tables 65B05 Extrapolation to the limit 65B10 Summation of series 65B15 Euler-Maclaurin formula 65B99 Acceleration of convergence 65Bxx Acceleration of convergence 65C05 Monte Carlo methods 65C10 Random number generation 65C20 Models (numerical methods) 65C99 Numerical simulation 65Cxx Numerical simulation 65D05 Interpolation (numerical methods) 65D07 Splines (numerical methods) 65D10 Smoothing 65D15 Algorithms for functional approximation 65D17 Computer aided design (modeling of curves and surfaces) 65D20 Computation of special functions 65D25 Numerical differentiation 65D30 Numerical integration 65D32 Quadrature formulas (numerical methods) 65D99 Numerical approximation 65Dxx Numerical approximation 65E05 Numerical methods in complex analysis 65F05 Direct methods for linear systems 65F10 Iterative methods for linear systems 65F15 Eigenvalues (numerical linear algebra) 65F20 Overdetermined systems (numerical linear algebra) 65F25 Orthogonalization (numerical linear algebra) 65F30 Other matrix algorithms 65F35 Matrix norms, etc. (numerical linear algebra) 65F40 Determinants (numerical linear algebra) 65F50 Sparse matrices 65F99 Numerical linear algebra 65Fxx Numerical linear algebra 65G05 Roundoff error 65G10 Interval arithmetic 65G99 Error analysis 65Gxx Error analysis 65H05 Single nonlinear equations (numerical methods) 65H10 Systems of nonlinear equations (numerical methods) 65H17 Eigenvalue and bifurcation problems of nonlinear algebraic equations 65H20 Global methods, including homotopy approaches 65H99 Nonlinear algebraic or transcendental equations 65Hxx Nonlinear algebraic or transcendental equations 65J05 General theory of numerical methods in abstract spaces 65J10 Equations with linear operators (numerical methods) 65J15 Equations with nonlinear operators (numerical methods) 65J20 Improperly posed problems (numerical methods in abstract spaces) 65J99 Numerical analysis in abstract spaces 65Jxx Numerical analysis in abstract spaces 65K05 Mathematical programming (numerical methods) 65K10 Optimization techniques (numerical methods) 65K99 Numerical methods for mathematical programming and optimization 65Kxx Numerical methods in mathematical programming and optimization 65L05 Initial value problems for ODE (numerical methods) 65L06 Multistep, Runge-Kutta, and extrapolation methods 65L07 Numerical investigation of stability of solutions of ODE 65L08 Improperly posed problems for ODE (numerical methods) 65L10 Boundary value problems for ODE (numerical methods) 65L12 Finite difference methods for ODE 65L15 Eigenvalue problems for ODE (numerical methods) 65L20 Stability of numerical methods for ODE 65L50 Mesh generation and refinement (ODE) 65L60 Finite numerical methods for ODE 65L70 Error bounds (numerical methods for ODE) 65L99 Numerical methods for ODE 65Lxx Numerical methods for ODE 65M06 Finite difference methods (IVP of PDE) 65M12 Stability and convergence of numerical methods (IVP of PDE) 65M15 Error bounds (IVP of PDE) 65M20 Method of lines (IVP of PDE) 65M25 Method of characteristics (numerical) 65M30 Improperly posed problems (IVP of PDE, numerical methods) 65M50 Mesh generation and refinement (IVP of PDE) 65M55 Multigrid methods; domain decomposition (IVP of PDE) 65M60 Finite numerical methods (IVP of PDE) 65M70 Spectral, collocation and related methods (IVP of PDE) 65M99 Numerical methods for IVP of PDE 65Mxx Numerical methods for initial value problems (IVP) of PDE 65N06 Finite difference methods (BVP of PDE) 65N12 Stability and convergence of numerical methods (BVP of PDE) 65N15 Error bounds (BVP of PDE) 65N22 Solution of discretized equations (BVP of PDE) 65N25 Numerical methods for eigenvalue problems (BVP of PDE) 65N30 Finite numerical methods (BVP of PDE) 65N35 Collocation methods (BVP of PDE) 65N38 Boundary element methods (BVP of PDE) 65N40 Methods of lines (BVP of PDE) 65N45 Method of contraction of the boundary (BVP of PDE) 65N50 Mesh generation and refinement (BVP of PDE) 65N55 Multigrid methods; domain decomposition (BVP of PDE) 65N99 Numerical methods for BVP of PDE 65Nxx numerical methods for boundary value problems (BVP) of PDE 65P05 Numerical methods for miscellaneous problems of PDE 65Q05 Numerical methods for functional equations 65R10 Integral transforms (numerical methods) 65R20 Integral equations (numerical methods) 65R30 Improperly posed problems (integral equations, numerical methods) 65R99 Numerical methods for integral equations and transforms 65Rxx Numerical methods for integral equations and transforms 65S05 Graphical methods of numerical analysis 65T05 Numerical methods in harmonic analysis 65T10 Discrete and fast Fourier transforms 65T99 Numerical methods in Fourier analysis 65Txx Numerical methods in Fourier analysis 65U05 Numerical methods in probability and statistics 65Y05 Parallel computation (numerical methods) 65Y10 Algorithms for specific classes of architectures 65Y15 Packaged methods 65Y20 Complexity and performance of numerical algorithms 65Y25 Computer graphics and computational geometry 65Y99 Computer aspects of numerical algorithms 65Yxx Computer aspects of numerical algorithms 68-00 Reference works (computer science) 68-01 Textbooks (computer science) 68-02 Research monographs (computer science) 68-03 Historical (computer science) 68-04 Machine computation, programs (computer science) 68-06 Proceedings of conferences (computer science) 68-99 Computer science 68-XX Computer science 68M05 Computer system organization (general aspects) 68M07 Mathematical problems of computer architectures 68M10 Computer networks 68M15 Reliability and testing of computer systems 68M20 Performance evaluation of computer systems, etc. 68M99 Computer system organization 68Mxx Computer system organization 68N05 General theory of programming 68N15 Programming languages 68N17 Logic programming 68N20 Compilers and generators 68N25 Monitors and operating systems 68N99 Software 68Nxx Software 68P05 Data structures 68P10 Searching and sorting 68P15 Database theory 68P20 Information storage and retrieval 68P25 Data encryption 68P99 Theory of data 68Pxx Theory of data 68Q05 Models of computation 68Q10 Modes of computation 68Q15 Complexity classes of computation 68Q20 Nonnumerical algorithms 68Q22 Parallel and distributed algorithms 68Q25 Analysis of algorithms and problem complexity 68Q30 Algorithmic information theory 68Q35 VLSI algorithms 68Q40 Symbolic computation, algebraic computation 68Q42 Rewriting systems 68Q45 Formal languages 68Q50 Grammars 68Q52 Parsing 68Q55 Semantics 68Q60 Specification and verification of programs 68Q65 Abstract data types; algebraic specification 68Q68 Automata theory, general 68Q70 Algebraic theory of automata 68Q75 Stochastic and nondeterministic automata 68Q80 Cellular and array automata 68Q90 Transition nets 68Q99 Theory of computing 68Qxx Theory of computing 68R05 Combinatorics in connection with computer science 68R10 Graph theory in connection with computer science 68R15 Combinatorics on words 68R99 Discrete mathematics in relation to computer science 68Rxx Discrete mathematics in relation to computer science 68S05 Mathematical linguistics 68T01 Artificial intelligence (general aspects) 68T05 Learning and adaptive systems 68T10 Pattern recognition 68T15 Theorem proving 68T20 Problem solving 68T25 AI languages 68T27 AI logics 68T30 Knowledge representation 68T35 AI software systems 68T99 Artificial intelligence 68Txx Artificial intelligence 68U05 Computational geometry, etc. 68U07 Computer aided design 68U10 Image processing 68U15 Text processing 68U20 Simulation 68U30 Miscellaneous appl. of computers 68U99 Computing methodologies 68Uxx Computing methodologies 70-00 Reference works (mechanics of particles and systems) 70-01 Textbooks (mechanics of particles and systems) 70-02 Research monographs (mechanics of particles and systems) 70-03 Historical (mechanics of particles and systems) 70-04 Machine computation, programs (mechanics of particles and systems) 70-05 Experimental papers (mechanics of particles and systems) 70-06 Proceedings of conferences (mechanics of particles and systems) 70-08 Computational methods (mechanics of particles and systems) 70-99 Mechanics of particles and systems 70-XX Mechanics of particles and systems 70A05 Axiomatics, foundations (general mechanics) 70B05 Kinematics of particle 70B10 Kinematics of a rigid body 70B15 Mechanisms 70B99 Kinematics 70Bxx Kinematics 70C20 Statics 70D05 Newtonian dynamics 70D10 Lagrangian dynamics 70D99 Dynamics of a particle 70Dxx Dynamics of a particle 70E05 Motion of the gyroscope 70E10 Motion of streamlined bodies 70E15 Motion of rigid bodies 70E20 Perturbation methods for Euler's equations 70E99 Dynamics of a rigid body 70Exx Dynamics of a rigid body 70F05 Two-body problem 70F07 Three-body problem 70F10 n-body problem 70F15 Celestial mechanics 70F20 Holonomic systems 70F25 Nonholonomic systems 70F30 Impulsive motion 70F35 Collisions 70F99 Dynamics of a system of particles 70Fxx Dynamics of a system of particles 70G05 Geometrical methods in general mechanics 70G10 Generalized coordinates 70G15 Space of events 70G20 Impulse-energy space 70G25 Configuration space 70G30 State space 70G35 Phase space 70G50 Classical field theories (general) 70G99 General representations of dynamical systems 70Gxx General representations of dynamical systems 70H05 Hamilton's equations 70H10 Liouville's theorem 70H15 Canonical transformations 70H20 Hamilton-Jacobi equations 70H25 Hamilton's principle 70H30 Other variational principles (general mechanics) 70H33 Symmetries 70H35 Lagrange's equation of motion 70H40 Relativistic dynamics 70H99 Hamiltonian and Lagrangian mechanics 70Hxx Hamiltonian and Lagrangian mechanics 70J05 Linear vibrations of finite degree of freedom systems 70J10 Normal modes of linear vibrations 70J25 Stability of linear oscillatory motions 70J30 Free motions, etc. 70J35 Forced motions 70J40 Parametric resonances 70J99 Linear vibration theory 70Jxx Linear vibration theory (general mechanics) 70K05 Phase plane analysis (general mechanics) 70K10 Limit cycles (general mechanics) 70K15 Lyapunov theorems (general mechanics) 70K20 Stability of nonlinear oscillations (general mechanics) 70K25 Free motions 70K28 Parametric resonances 70K30 Nonlinear resonances (general mechanics) 70K40 Forced motions (general mechanics) 70K50 Transition to stochasticity (general mechanics) 70K99 Nonlinear motions 70Kxx Nonlinear oscillations (general mechanics) 70L05 Random vibrations (general mechanics) 70M20 Orbital mechanics 70P05 Variable mass 70Q05 Control of mechanical systems 73-00 Reference works (mechanics of solids) 73-01 Textbooks (mechanics of solids) 73-02 Research monographs (mechanics of solids) 73-03 Historical (mechanics of solids) 73-04 Machine computation, programs (mechanics of solids) 73-05 Experimental papers (mechanics of solids) 73-06 Proceedings of conferences (mechanics of solids) 73-99 Mechanics of solids 73-XX Mechanics of solids 73A05 Axiomatics, foundations of solid mechanics 73B05 Constitutive equations (mechanics of solids) 73B10 symmetry groups (mechanics of solids) 73B18 Nonlocal theories 73B25 Polar theories 73B27 Nonhomogeneous materials. Homogenization 73B30 Thermodynamics of solids 73B35 Random materials (mechanics of solids) 73B40 Anisotropic materials 73B50 Stress concentrations 73B99 Continuum mechanics 73Bxx Continuum mechanics (mechanics of solids) 73C02 Classical linear elasticity 73C05 Stress functions (elasticity) 73C10 Saint-Venant's principle 73C15 Uniqueness theorems in elasticity 73C35 Mixed boundary value problems in elasticity 73C50 Nonlinear elasticity 73C99 Elasticity 73Cxx Elasticity 73D05 Shock waves (mechanics of solids) 73D10 Integral transforms in solid mechanics 73D15 Body waves 73D20 Surface waves 73D25 Wave diffraction, etc. (mechanics of solids) 73D30 Linear vibrations of solids 73D35 Nonlinear vibrations of solids 73D40 Singular surfaces 73D50 Inverse problems in mechanics of solids 73D70 Random waves in mechanics of solids 73D99 Wave propagation in and vibrations of solids 73Dxx Wave propagation in and vibrations of solids 73E05 Constitutive specifications (Yield, flow, hardening) 73E10 Method of successive approximations in plasticity 73E20 Limit analysis in plasticity 73E50 Time-dependent problems in plasticity 73E60 Viscoplasticity 73E70 Plastic waves 73E99 Plasticity 73Exx Plasticity 73F05 Response functions in viscoelasticity 73F10 Correspondence principle in viscoelasticity 73F15 Time-dependent boundary value problems in viscoelasticity 73F20 Aging of materials 73F25 Environmental-dependent materials 73F99 Viscoelasticity 73Fxx Viscoelasticity 73G05 Finite elasticity 73G20 Finite plasticity 73G25 Finite viscoelasticity 73G99 Finite deformations 73Gxx Finite deformations (mechanics of solids) 73H05 Buckling 73H10 Dynamic stability (mechanics of solids) 73H99 Stability (mechanics of solids) 73Hxx Stability (mechanics of solids) 73K03 Strings 73K05 Rods, etc. 73K10 Plates, etc. 73K12 Dynamics of structures 73K15 Shells 73K20 Composite structures in mechanics of solids 73K35 Random excitation of structures 73K40 Optimization in structural mechanics 73K50 Control of structures 73K70 Aero- or hydromechanic structure interactions 73K99 Mechanics of structures 73Kxx Mechanics of structures 73M25 Fracture mechanics 73N20 Geophysical solid mechanics 73P05 Biomechanics of solids 73Q05 Soil and rock mechanics 73R05 Electromagnetic elasticity 73S10 Micromechanics of solids 73T05 Contact and surface mechanics 73V05 Finite element methods 73V10 Boundary element methods 73V15 Finite difference methods 73V20 Other numerical methods 73V25 Variational methods 73V30 Stochastic analysis 73V35 Complex variable techniques 73V99 Basic methods in solid mechanics 73Vxx Basic methods in solid mechanics 76-00 Reference works (fluid mechanics) 76-01 Textbooks (fluid mechanics) 76-02 Research monographs (fluid mechanics) 76-03 Historical (fluid mechanics) 76-04 Machine computation, programs (fluid mechanics) 76-05 Experimental papers (fluid mechanics) 76-06 Proceedings of conferences (fluid mechanics) 76-99 Fluid mechanics 76-XX Fluid mechanics 76A02 Foundations of fluid mechanics 76A05 Non-Newtonian fluids 76A10 Viscoelastic fluids 76A15 Liquid crystals 76A99 Foundations, constitutive equations, rheology 76Axx Foundations, constitutive equations, etc. 76B05 Airfoil theory 76B10 Free-streamline theory and appl. 76B15 Wave motions (fluid mechanics) 76B20 Ship waves 76B25 Solitary waves, etc. (inviscid fluids) 76B35 Random waves (inviscid fluids) 76B40 Added mass computations (fluid mechanics) 76B45 Capillarity 76B99 Incompressible inviscid fluids, potential theory 76Bxx Incompressible inviscid fluids, potential theory 76C05 Vorticity flows 76C10 Internal waves (inviscid fluids) 76C15 Atmospheric waves 76C20 Rossby waves (fluid mechanics) 76C99 Incompressible inviscid fluids, vorticity flows 76Cxx Incompressible inviscid fluids, vorticity flows 76D05 Navier-Stokes equations (fluid dynamics) 76D07 Stokes flows 76D08 Lubrication theory 76D10 Boundary-layer theory (incompressible fluids) 76D15 Boundary-layer separation and reattachment 76D20 Higher-order effects in boundary layers 76D25 Wakes and jets (viscous fluids) 76D30 Singular perturbation problems (viscous fluids) 76D33 Waves in incompressible viscous fluids 76D35 Random waves (viscous fluids) 76D45 Capillarity 76D99 Incompressible viscous fluids 76Dxx Incompressible viscous fluids 76E05 Stability of parallel flows 76E10 Inertial instability (fluid mechanics) 76E15 Convective instability (fluid mechanics) 76E20 Instability of flows in nature 76E25 Instabilities in presence of electromagnetic forces 76E30 Nonlinear effects (fluid mechanics) 76E99 Hydrodynamic stability 76Exx Hydrodynamic stability 76F05 Homogeneous isotropic turbulence 76F10 Shear flows 76F20 Turbulence via chaos techniques 76F99 Turbulence 76Fxx Turbulence 76G25 General aerodynamics and subsonic flows 76H05 Transonic flows 76J20 Supersonic flows 76K05 Hypersonic flows 76L05 Shock waves (fluid mechanics) 76M10 Finite element methods 76M15 Boundary element methods 76M20 Finite difference methods 76M25 Other numerical methods 76M30 Variational methods 76M35 Stochastic analysis 76M99 Basic methods in fluid mechanics 76Mxx Basic methods in fluid mechanics 76N10 Compressible fluids, general 76N15 Gas dynamics, general 76N20 Boundary layer theory 76N99 Compressible fluids and gas dynamics, general 76Nxx Compressible fluids and gas dynamics, general 76P05 Molecular or atomic structure 76Q05 Density waves (fluid mechanics) 76R05 Forced convection 76R10 Free convection 76R50 Diffusion 76R99 Diffusion and convection 76Rxx Diffusion and convection (fluid mechanics) 76S05 Flows in porous media 76T05 Several phase flows 76U05 Rotating fluids 76V05 Interacting phases (fluid mechanics) 76W05 Flows in presence of electromagnetic forces 76X05 Plasmic flows 76Y05 Nonclassical hydrodynamics 76Z05 Physiological flows 76Z10 Biopropulsion 76Z99 Biological fluid mechanics 76Zxx Biological fluid mechanics 78-00 Reference works (optics, electromagnetic theory) 78-01 Textbooks (optics, electromagnetic theory) 78-02 Research monographs (optics, electromagnetic theory) 78-03 Historical (optics, electromagnetic theory) 78-04 Machine computation, programs (optics, electromagnetic theory) 78-05 Experimental papers (optics, electromagnetic theory) 78-06 Proceedings of conferences (optics, electromagnetic theory) 78-08 Computational methods (optics, electromagnetic theory) 78-99 Optics, electromagnetic theory 78-XX Optics, electromagnetic theory 78A02 Foundations of optics and electromagnetic theory 78A05 Geometric optics 78A10 Physical optics 78A15 Electron optics 78A20 Space charge waves 78A25 General electromagnetic theory 78A30 Electro- and magnetostatics 78A35 Motion of charged particles 78A40 Waves and radiation 78A45 Diffraction, scattering (optics) 78A50 Antennas, wave-guides 78A55 Technical appl. of optics and electromagnetic theory 78A60 Lasers, etc. 78A70 Biological appl. of optics and electromagnetic theory 78A97 Mathematically heuristic optics and electromagnetic theory 78A99 Miscellaneous topics in optics and electromagnetic theory 80-00 Reference works (classical thermodynamics) 80-01 Textbooks (classical thermodynamics) 80-02 Research monographs (classical thermodynamics) 80-03 Historical (classical thermodynamics) 80-04 Machine computation, programs (classical thermodynamics) 80-05 Experimental papers (classical thermodynamics) 80-06 Proceedings of conferences (classical thermodynamics) 80-08 Computational methods (classical thermodynamics) 80-99 Classical thermodynamics, heat transfer 80-XX Classical thermodynamics, heat transfer 80A05 Foundations of classical thermodynamics 80A10 Classical thermodynamics 80A15 Thermodynamics of mixtures 80A20 Heat and mass transfer 80A22 Stefan problems, etc. 80A23 Inverse problems (thermodynamics) 80A25 Combustion, interior ballistics 80A30 Chemical kinetics 80A32 Chemically reacting flows 80A50 Thermodynamical problems in chemistry 80A97 Mathematically heuristic classical thermodynamics 80A99 Miscellaneous topics in classical thermodynamics 81-00 Reference works (quantum theory) 81-01 Textbooks (quantum theory) 81-02 Research monographs (quantum theory) 81-03 Historical (quantum theory) 81-04 Machine computation, programs (quantum theory) 81-05 Experimental papers (quantum theory) 81-06 Proceedings of conferences (quantum theory) 81-08 Computational methods (quantum theory) 81-99 Quantum theory 81-XX Quantum Theory 81P05 General and philosophical topics in quantum theory 81P10 Logical foundations of quantum mechanics 81P15 Quantum measurement theory 81P20 Stochastic mechanics (including stochastic electrodynamics) 81P99 Axiomatics, foundations, philosophy of quantum theory 81Pxx Axiomatics, foundations, philosophy of quantum theory 81Q05 Closed and approximate solutions to quantum-mechanical equations 81Q10 Selfadjoint operator theory in quantum theory 81Q15 Perturbation theories for operators and differential equations 81Q20 Semi-classical techniques in quantum theory 81Q30 Feynman integrals and graphs 81Q40 Integral equations in quantum theory 81Q50 Quantum chaos 81Q60 Supersymmetric quantum mechanics 81Q99 General mathematical topics and methods in quantum theory 81Qxx General mathematical topics and methods in quantum theory 81R05 Repres. of finite-dim. groups and algebras from quantum theory 81R10 Repres. of infinite-dim. groups and algebras from quantum theory 81R20 Covariant wave equations 81R25 Spinor and twistor methods in quantum theory 81R30 Coherent states in quantum theory 81R40 Symmetry breaking 81R50 Quantum groups and related algebraic methods in quantum theory 81R99 Groups and algebras in quantum theory 81Rxx Groups and algebras in quantum theory 81S05 Commutation relations (quantum theory) 81S10 Geometric quantization, symplectic methods 81S20 Stochastic quantization 81S25 Quantum stochastic calculus 81S30 Phase space methods in quantum mechanics 81S40 Path integrals in quantum mechanics 81S99 General quantum mechanics and problems of quantization 81Sxx General quantum mechanics and problems of quantization 81T05 Axiomatic quantum field theory 81T08 Constructive quantum field theory 81T10 Model quantum field theories 81T13 Gauge theories 81T15 Perturbative methods of renormalization 81T16 Nonperturbative methods of renormalization 81T17 Renormalization group methods 81T18 Feynman diagrams 81T20 Quantum field theory on curved space backgrounds 81T25 Quantum field theory on lattices 81T27 Continuum limits 81T30 String and superstring theories 81T40 Two-dimensional field theories, etc. 81T50 Anomalies in field theory 81T60 Supersymmetric field theories 81T70 Quantization in field theory; cohomological methods 81T80 Simulation and numerical modelling of fields 81T99 Quantum field theory 81Txx Quantum field theory and related classical field theories 81U05 2-body potential scattering theory 81U10 n-body potential scattering theory 81U20 S-matrix theory, etc. 81U30 Dispersion theory, dispersion relations (quantum theory) 81U40 Inverse scattering problems (quantum theory) 81U99 Scattering theory (quantum theory) 81Uxx Scattering theory (quantum theory) 81V05 Strong interaction 81V10 Electromagnetic interaction 81V15 Weak interaction 81V17 Gravitational interaction 81V19 Other fundamental interactions 81V22 Unified theories of elementary partcles 81V25 Other elementary particle theory 81V35 Appl. of quantum theory to nuclear physics 81V45 Appl. of quantum theory to atomic physics 81V55 Appl. of quantum theory to molecular physics 81V70 Appl. of quantum theory to many-body systems 81V80 Appl. of quantum theory to quantum optics 81V99 Appl. of quantum theory to specific physical systems 81Vxx Appl. of quantum theory to specific physical systems 82-00 Reference works (statistical mechanics) 82-01 Textbooks (statistical mechanics) 82-02 Research monographs (statistical mechanics) 82-03 Historical (statistical mechanics) 82-04 Machine computation, programs (statistical mechanics) 82-05 Experimental papers (statistical mechanics) 82-06 Proceedings of conferences (statistical mechanics) 82-08 Computational methods (statistical mechanics) 82-99 Statistical mechanics, structure of matter 82-XX Statistical mechanics, structure of matter 82B03 Foundations of equilibrium statistical mechanics 82B05 Classical equilibrium statistical mechanics (general) 82B10 Quantum equilibrium statistical mechanics (general) 82B20 Lattice systems 82B21 Continuum models (systems of particles, etc.) 82B23 Exactly solvable models 82B24 Interface problems (equilibrium) 82B26 Phase transitions (general) 82B27 Critical phenomena 82B28 Renormalization group methods 82B30 Statistical thermodynamics 82B31 Stochastic methods in equilibrium statistical mechanics 82B35 Irreversible thermodynamics 82B40 Kinetic theory of gases 82B41 Random walks, etc. (statistical mechanics) 82B43 Percolation 82B44 Disordered systems 82B80 Numerical methods in equilibrium statistical mechanics 82B99 Equilibrium statistical mechanics 82Bxx Equilibrium statistical mechanics 82C03 Foundations of time-dependent statistical mechanics 82C05 Classical dynamic and nonequilibrium statistical mechanics (general) 82C10 Quantum dynamics and nonequilibrium statistical mechanics (general) 82C20 Dynamic lattice systems 82C21 Dynamic continuum models 82C22 Interacting particle systems 82C23 Exactly solvable dynamic models 82C24 Interface problems (dynamic and non-equilibrium) 82C26 Dynamic and nonequilibrium phase transitions (general) 82C27 Dynamic critical phenomena 82C28 Dynamic renormalization group methods 82C31 Stochastic methods in time-dependent statistical mechanics 82C32 Neural nets 82C35 Irreversible thermodynamics 82C40 Kinetic theory of gases 82C41 Dynamics of random walks, etc. 82C43 Time-dependent percolation 82C44 Dynamics of disordered systems 82C70 Transport processes 82C80 Numerical methods of time-dependent statistical mechanics 82C99 Time-dependent statistical mechanics 82Cxx Time-dependent statistical mechanics (dynamic and non-equilibrium) 82D05 Gases 82D10 Plasmas 82D15 Liquids 82D20 Solids 82D25 Crystals 82D30 Random media, etc. 82D35 Metals 82D40 Magnetic materials 82D45 Ferroelectrics 82D50 Superfluids 82D55 Superconductors 82D60 Polymers 82D75 Nuclear reactor theory 82D99 Appl. to specific physical systems 82Dxx Appl. to specific physical systems 83-00 Reference works (relativity) 83-01 Textbooks (relativity) 83-02 Research monographs (relativity) 83-03 Historical (relativity) 83-04 Machine computation, programs (relativity) 83-05 Experimental papers (relativity) 83-06 Proceedings of conferences (relativity) 83-08 Computational methods (relativity) 83-99 Relativity and gravitational theory 83-XX Relativity and gravitational theory 83A05 Special relativity 83B05 Observational and experimental questions of relativity 83C05 Einstein's equations 83C10 Equations of motion 83C15 Closed form solutions of equations in general relativity 83C20 Classes of solutions of equations in general relativity 83C22 Electromagnetic fields, Einstein-Maxwell equations 83C25 Approximation procedures (general relativity) 83C27 Discrete methods in general relativity 83C30 Asymptotic procedures (general relativity) 83C35 Gravitational waves 83C40 Groups of motions, etc. 83C45 Quantization of the gravitational field 83C47 Quantum field theory on curved space-times 83C50 Electromagnetic fields 83C55 Hydrodynamics (general relativity) 83C57 Black holes 83C60 Spinor and twistor methods in general retativity 83C75 Space-time singularities, etc. 83C99 General relativity 83Cxx General relativity 83D05 Relativistic gravitational theories other than Einstein's 83E05 Geometrodynamics 83E15 Higher-dimensional field theories 83E30 String and superstring theories 83E50 Supergravity 83E99 Unified, higher-dimensional and super field theories 83Exx Unified field theories, etc. 83F05 Relativistic cosmology 85-00 Reference works (astronomy and astrophysics) 85-01 Textbooks (astronomy and astrophysics) 85-02 Research monographs (astronomy and astrophysics) 85-03 Historical (astronomy and astrophysics) 85-04 Machine computation, programs (astronomy and astrophysics) 85-05 Experimental papers (astronomy and astrophysics) 85-06 Proceedings of conferences (astronomy and astrophysics) 85-08 Computational methods (astronomy and astrophysics) 85-99 Astronomy and astrophysics 85-XX Astronomy and astrophysics 85A04 General topics of astronomy and astrophysics 85A05 Galactic and stellar dynamics 85A15 Galactic and stellar structure 85A20 Stellar atmospheres 85A25 Radiative transfer 85A30 Hydrodynamic and hydromagnetic problems in astrophysics 85A35 Statistical astronomy 85A40 Nonrelativistic cosmology 85A45 Radio astronomy 85A99 Miscellaneous topics in astronomy and astrophysics 86-00 Reference works (geophysics) 86-01 Textbooks (geophysics) 86-02 Research monographs (geophysics) 86-03 Historical (geophysics) 86-04 Machine computation, programs (geophysics) 86-05 Experimental papers (geophysics) 86-06 Proceedings of conferences (geophysics) 86-08 Computational methods (geophysics) 86-99 Geophysics 86-XX Geophysics 86A04 General topics of geophysics 86A05 Hydrology, hydrography, oceanography 86A10 Meteorology 86A15 Seismology 86A17 Global dynamics, earthquake problems 86A20 Potentials, prospecting 86A22 Inverse problems in geophysics 86A25 Geo-electricity and geomagnetism 86A30 Geodesy 86A32 Geostatistics 86A40 Glaciology 86A60 Geological problems 86A99 Miscellaneous topics in geophysics 90-00 Reference works (optimization) 90-01 Textbooks (optimization) 90-02 Research monographs (optimization) 90-03 Historical (optimization) 90-04 Machine computation, programs (optimization) 90-06 Proceedings of conferences (optimization) 90-08 Computational methods (optimization) 90-99 Optimization 90-XX Optimization 90A05 Decision theory 90A06 Individual preferences 90A07 Group preferences 90A08 Social welfare 90A09 Finance, etc. 90A10 Utility theory 90A11 Production theory, etc. 90A12 Price theory and market structure 90A14 General economic equilibrium theory 90A15 General economic models, etc. 90A16 Dynamic economic models, etc. 90A17 Multisectoral economic models 90A19 Statistical methods in mathematical economics 90A20 Economic time series analysis 90A25 Spatial economic models 90A27 Public goods 90A28 Voting theory 90A30 Environmental economics 90A35 Informational economics 90A36 Incentives theory 90A40 Consumer behavior, demand theory 90A43 Expected utility, etc. 90A46 Risk theory 90A50 Labor market 90A53 Special types of economies 90A56 Special types of economic equilibria 90A58 Models of real world systems, etc. 90A60 Market models 90A70 Macro-economic policy-making 90A80 Resource allocation 90A99 Mathematical economics 90Axx Mathematical economics 90B05 Inventory management 90B06 Transportation, logistics 90B10 Flows in networks 90B12 Communication networks 90B15 Flows in networks with stochastic elements 90B20 Highway traffic 90B22 Queues and service 90B25 Reliability, etc. 90B30 Production models 90B35 Scheduling theory 90B40 Search theory 90B50 Multiple-criteria decision making 90B60 Marketing, advertising 90B70 Theory of organizations, etc. 90B80 Discrete location and assignment 90B85 Continuous location 90B90 Case-oriented studies in OR 90B99 Operations research and management science 90Bxx Operations research and management sience 90C05 Linear programming 90C06 Large-scale problems 90C08 Special problems of linear programming 90C09 Boolean programming 90C10 Integer programming 90C11 Mixed integer programming 90C15 Stochastic programming 90C20 Quadratic programming 90C25 Convex programming 90C26 Nonconvex programming 90C27 Combinatorial programming 90C28 Geometric programming 90C29 Multi-objective programming, etc. 90C30 Nonlinear programming 90C31 Sensitivity, etc. 90C32 Fractional programming 90C33 Complementarity problems 90C34 Semi-infinite programming 90C35 Network programming 90C39 Dynamic programming 90C40 Markov decision processes, etc. 90C42 Markov and Markov renewal programming 90C48 Programming in abstract spaces 90C60 Abstract computational complexity for math. programming problems 90C70 Fuzzy programming 90C90 Appl. of mathematical programming 90C99 Mathematical programming 90Cxx Mathematical programming 90D05 2-person games 90D06 n-person games (n>2) 90D10 Noncooperative games 90D12 Cooperative games 90D13 Games with infinitely many players 90D15 Stochastic games 90D20 Multistage games 90D25 Differential games 90D26 Pursuit and evasion games 90D35 Decision theory for games 90D40 Game theory models 90D42 Positional games 90D43 Games involving graphs 90D44 Games involving topology or set theory 90D46 Combinatorial games 90D50 Discrete-time games 90D55 Games of timing 90D60 Probabilistic games 90D65 Hierarchical games 90D70 Spaces of games 90D80 Appl. of game theory 90D99 Game theory 90Dxx Game theory 92-00 Reference works (appl. to natural and behavioral sciences) 92-01 Textbooks (appl. to natural etc. sciences) 92-02 Research monographs (appl. to natural/behavioral sciences) 92-03 Historical (appl. to natural and behavioral sciences) 92-04 Machine computation, programs (appl. to natural/behavioral sciences) 92-06 Proceedings of conferences (appl. to natural/behavioral sciences) 92-08 Computational methods (appl. to natural and behavioral sciences) 92-99 Appl. of mathematics in natural and behavioral sciences 92-XX Appl. of mathematics to natural and behavioral sciences 92B05 General biology and biomathematics 92B10 Taxonomy, etc. 92B15 General biostatistics 92B20 General theory of neural networks 92B99 Mathematical biology 92Bxx Mathematical biology in general 92C05 Biophysics 92C10 Biomechanics 92C15 Developmental biology, etc. 92C20 Neural biology 92C30 Physiology 92C35 Physiological flows 92C40 Biochemistry, etc. 92C45 Kinetics in biochemical problems 92C50 Medical appl. of mathematical biology 92C55 Tomography 92C60 Medical epidemiology 92C99 Physiological, cellular and medical topics 92Cxx Physiological, cellular and medical topics 92D10 Genetics 92D15 Problems related to evolution 92D20 Protein sequences, DNA sequences 92D25 Population dynamics 92D30 Epidemiology 92D40 Ecology 92D50 Animal behavior 92D99 Genetics and population dynamics 92Dxx Genetics and population dynamics 92E10 Chemical structures 92E20 Chemical flows, reactions, etc. 92E99 Appl. of mathematics to chemistry 92Exx Chemistry 92F05 Appl. of mathematics to other natural sciences 92G05 Measurement theory (social and behavioral sciences) 92G10 One- and multidimensional scaling 92G20 Test theory (social and behavioral sciences) 92G25 Questionnaire analysis 92G30 Clustering (social and behavioral sciences) 92G40 Q-analysis 92G99 Appl. of mathematics to social and behavioral sciences 92Gxx Social and behavioral sciences: methodology 92H10 Models of societies, etc. 92H20 Mathematical geography and demography 92H25 Spatial models in sociology 92H30 Social networks 92H35 Manpower systems 92H99 Mathematyical sociology 92Hxx Mathematical sociology 92J10 Cognitive psychology 92J30 Psychophysics and psychophysiology 92J40 Memory and learning 92J45 Measurement and performance psychology 92J99 Mathematical psychology 92Jxx Mathematical psychology 92K10 Mathematical treatment of history and political sciences 92K20 Mathematical treatment of linguistics 92K99 Mathematical treatment of other social and behavioral sciences 92Kxx Mathematical treatment of other social and behavioral sciences 93-00 Reference works (systems and control) 93-01 Textbooks (systems and control) 93-02 Research monographs (systems and control) 93-03 Historical (systems and control) 93-04 Machine computation, programs (systems and control) 93-06 Proceedings of conferences (systems and control) 93-99 Systems and control 93-XX Systems theory; control 93A05 Axiomatic system theory 93A10 General systems 93A13 Hierarchical systems 93A14 Decentralized systems 93A15 Large scale systems 93A20 Cascaded systems 93A25 Input-output systems 93A30 Mathematical modelling of systems 93A99 General systems theory 93Axx General systems theory 93B03 Attainable sets 93B05 Controllability 93B06 Relations between controllability and optimal solutions 93B07 Observability 93B10 Canonical structure of systems 93B11 System structure simplification 93B12 Variable structure systems 93B15 Realizability of systems from input-output data 93B17 System transformation 93B18 Linearizability of systems 93B20 Minimal systems representations 93B25 Algebraic theory of control systems 93B27 Geometric methods in systems theory 93B28 Operator-theoretic methods in systems theory 93B29 Differential-geometric methods in systems theory 93B30 System identification 93B35 Sensitivity (robustness) of control systems 93B36 H-infinity-control 93B40 Computational methods in systems theory 93B50 Synthesis problems 93B51 Design techniques in systems theory 93B52 Feedback control 93B55 Pole and zero placement problems 93B60 Eigenvalue problems in systems theory 93B99 Controllability, observability, and system structure 93Bxx Controllability, observability, and system structure 93C05 Linear control systems 93C10 Nonlinear control systems 93C15 Control systems governed by ODE 93C20 Control systems governed by PDE 93C22 Control systems governed by integral equations 93C25 Control systems in abstract spaces 93C30 Control systems governed by other functional relations 93C35 Multivariable, multidimensional control systems 93C40 Adaptive control systems 93C41 Control problems with incomplete information 93C42 Fuzzy control 93C45 Time-invariant control systems 93C50 Time-dependent control systems 93C55 Discrete-time control systems 93C57 Sampled-data control systems 93C60 Continuous-time control systems 93C62 Digital control systems 93C70 Time-scale analysis and related topics 93C73 Perturbations in control systems 93C80 Frequency-response methods 93C83 Control problems involving computers 93C85 Automated control systems 93C90 Random disturbances in control systems 93C95 Appl. of control theory 93C99 Control systems, guided systems 93Cxx Control systems, guided systems 93D05 Lyapunov and other classical stabilities of control systems 93D09 Robust stability of control systems 93D10 Popov-type stability of feedback systems 93D15 Stabilization of systems by feedback 93D20 Asymptotic stability of control systems 93D21 Adaptive and robust stabilization 93D22 Interrelations between stability problems and optimization problems 93D25 Input-output approaches to stability of control systems 93D30 Scalar and vector Lyapunov functions 93D99 Stability of control systems 93Dxx Stability of control systems 93E03 General theory of stochastic systems 93E05 Stochastic games, etc. 93E10 Estimation and detection in stochastic control 93E11 Filtering in stochastic control 93E12 System identification (stochastic systems) 93E14 Data smoothing (stochastic systems) 93E15 Stochastic stability 93E20 Optimal stochastic control (systems) 93E23 Stochastic gradient methods 93E24 Least squares and related methods in stochastic control 93E25 Computational methods in stochastic control 93E30 Computer simulations of stochastic systems 93E35 Stochastic learning and adaptive control 93E99 Stochastic systems and stochastic control 93Exx Stochastic systems and control 94-00 Reference works (information and communication) 94-01 Textbooks (information and communication) 94-02 Research monographs (information and communication) 94-03 Historical (information and communication) 94-04 Machine computation, programs (information and communication) 94-06 Proceedings of conferences (information and communication) 94-99 Information and communication 94-XX Information and communication 94A05 Communication theory 94A11 Application of orthogonal functions in communication 94A12 Signal theory 94A13 Detection theory 94A14 Modulation and demodulation 94A15 General topics of information theory 94A17 Measures of information 94A24 Coding theorems (Shannon theory) 94A29 Source coding 94A34 Rate-distortion theory 94A40 Channel models 94A45 Codes in connection with formal languages 94A50 Theory of questionnaires 94A55 Shift register sequences 94A60 Cryptography 94A99 Communication and information 94Axx Communication, information 94B05 General theory of linear codes 94B10 Convolutional codes 94B12 Combined modulation schemes 94B15 Cyclic codes 94B20 Burst-correcting codes 94B25 Combinatorial codes 94B27 Geometric methods in coding theory 94B30 Majority codes 94B35 Decoding 94B40 Arithmetic codes 94B50 Synchronization error-correcting codes 94B60 Other types of codes 94B65 Bounds on codes 94B70 Error probability for codes 94B75 Appl. of convex sets and geometry of numbers in coding theory 94B99 Theory of error-correcting codes 94Bxx Theory of error-correcting codes 94C05 Analytic circuit theory 94C10 Switching theory 94C12 Fault detection 94C15 Appl. of graph theory to circuits and networks 94C30 Appl. of design theory to circuits and networks 94C99 Circuits, networks 94Cxx Circuits, networks 94D05 Fuzzy sets and logic in connection with communication

9. Mhc03.htm
03E47, Other notions of Settheoretic definability. 03E50, Continuum hypothesis and Martin s axiom / See also 04A30, 54A25. 03E55, Large cardinals
http://www.math.unipd.it/~biblio/math/complexc/mhc03.htm
03-XX Mathematical logic and foundations
General reference works (handbooks, dictionaries, bibliographies, etc.)
Instructional exposition (textbooks, tutorial papers, etc.)
Research exposition (monographs, survey articles)
Explicit machine computation and programs (not the theory of computation or programming)
Proceedings, conferences, collections, etc.
General logic
Classical propositional logic
Classical first-order logic
Higher-order logic and type theory
Subsystems of classical logic (including intuitionistic logic) Abstract deductive systems Decidability of theories and sets of sentences [See also Foundations of classical theories (including reverse mathematics) [See also Foundation and axiomatics of classical theories Mechanization of proofs and logical operations [See also Combinatory logic and lambda-calculus [See also /:> [See also Logic of knowledge and belief Temporal logic ; for temporal logic, see ; for provability logic, see also Relevance and entailment Probability and inductive logic [See also Many-valued logic Fuzzy logic; logic of vagueness [See also

10. MSC 2000 : CC = Ore
03C25 Modeltheoretic forcing; 03C55 Set-theoretic model theory ordinal definability, and core models; 03E47 Other notions of Set-theoretic definability
http://portail.mathdoc.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=Ore

11. 03Exx
including constructibility, ordinal definability, and core models 03E47 Other notions of Settheoretic definability 03E50 Continuum hypothesis and
http://www.emis.de/MSC2000/03Exx.html
Set theory 03E02 Partition relations 03E04 Ordered sets and their cofinalities; pcf theory 03E05 Other combinatorial set theory 03E10 Ordinal and cardinal numbers 03E15 Descriptive set theory [See also ] 03E17 Cardinal characteristics of the continuum 03E20 Other classical set theory (including functions, relations, and set algebra) 03E25 Axiom of choice and related propositions 03E30 Axiomatics of classical set theory and its fragments 03E35 Consistency and independence results 03E40 Other aspects of forcing and Boolean-valued models 03E45 Inner models, including constructibility, ordinal definability, and core models 03E47 Other notions of set-theoretic definability 03E50 Continuum hypothesis and Martin's axiom 03E55 Large cardinals 03E60 Determinacy principles 03E65 Other hypotheses and axioms 03E70 Nonclassical and second-order set theories 03E72 Fuzzy set theory 03E75 Applications of set theory 03E99 None of the above, but in this section
Version of December 15, 1998

12. MSC 2000 : CC = Other
03E40 Other aspects of forcing and Booleanvalued models; 03E47 Other notions of Set-theoretic definability; 03E65 Other hypotheses and axioms
http://www-mathdoc.ujf-grenoble.fr/cgi-bin/msc2000.py?CC=other&L=fr

13. HeiDOK
03E45 Inner models, including constructibility, ordinal definability, and core models ( 0 Dok. ) 03E47 Other notions of Settheoretic definability ( 0 Dok.
http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03E&anzahl

14. Nothing Of Consequence: May 2007
Settheoretic definability of Constructions - Progress Report on a Disgracefully Old Problem; Moshe Vardi (Rice University, Houston)
http://notofcon.blogspot.com/2007_05_01_archive.html
skip to main skip to sidebar
Nothing of Consequence
Thursday, May 31, 2007
The Arch©/CSMN Graduate Conference: Call for papers
From the 2 nd to the 4 th of November, Arch© and CSMN will be organising a graduate conference at the University of St Andrews, and I've been volunteered to do some of the dirty work together with fellow Archeans Federico Luzzi and Andri Hj¡lmarsson . As usual, I had no idea about what I'm getting myself into, but now it looks like I'm in for quite a lot of admin work in the upcoming months. However, it's already looking very promising - funding is in place, and we've secured two excellent keynote speakers, Prof. Kit Fine (New York University) and Dr Gabriel Uzquiano (University of Oxford).
Needless to say, I strongly encourage all my postgraduate readers to submit their work.
Check out the details here , and in particular funding info here Posted by Ole Hjortland at 9:39 AM 0 comments Labels: Arch© Gradconf St.Andrews
Wednesday, May 23, 2007
British Logic Colloquium 2007
The British Logic Colloquium 2007 is being held in London from the 6 th to the 8 th of September. Looking at the invited speakers it's out of question to miss this event. I'm especially looking forward to seeing

15. Von Neumann Universe
The notion of definability treated in this article has been chosen primarily for Russell s paradox Applied versions, Russell s paradox - Set-theoretic
http://www.experiencefestival.com/von_neumann_universe
Articles Archives Start page News Contact Community General Newsletter Contact information Site map Most recommended Search the site Archive Photo Archive Video Archive Articles Archive More ... Wisdom Archive Body Mind and Soul Faith and Belief God and Religion ... Yoga Positions Site map 2 Site map
Hi! Below are some links that have been popular among the visitors of Global Oneness.
Check them out!
Jonas
von Neumann universe
A Wisdom Archive on von Neumann universe
von Neumann universe A selection of articles related to von Neumann universe More material related to Von Neumann Universe can be found here: Index of Articles
related to

Von Neumann Universe
von Neumann universe
ARTICLES RELATED TO von Neumann universe
von Neumann universe: Encyclopedia II - Axiom schema of replacement - Statement Suppose P is any predicate in two variables that doesn't use the symbol B. Then in the formal language of the Zermelo-Fraenkel axioms, the axiom schema reads: or in words: If, given any set X, there is a unique set Y such that P holds for X and Y, then, given any set A, there is a set B such that, given any set C, C is a member of B if and only if there is a set D such that D is a member of A ...
See also:
Axiom schema of replacement Axiom schema of replacement - Statement Axiom schema of replacement - Example applications Axiom schema of replacement - History and philosophy ... Axiom schema of replacement - Relation to the axiom schema of specification Read more here: von Neumann universe: Encyclopedia II - Definable number - General facts The definable numbers form a field containing all the familiar real numbers such as 0, 1, π, e, et cetera. In particular, it contains all the numbers named in the mathematical constants article, and all algebraic numbers (and therefore all rational numbers). However, most real numbers are not definable: the set of all definable numbers is countably infinite (because the set of all logical formulas is) while the set of real numbers is uncountably infinite (see Cantor's diagonal argument). As a result, most real numbers have no description (in the same sense o ...

16. List KWIC DDC And MSC Lexical Connection
Settheoretic definability other notions of 03E47 Set-theoretic model theory 03C55 set-valued and variational analysis 49J53 set-valued functions 26E25
http://www.mi.imati.cnr.it/~alberto/dml_11_46.htm
series, $_pF_q$ # generalized hypergeometric
series, auto-correlation, regression, etc. # time
series, central series, and generalizations # derived
series, etc.) # approximation to limiting values (summation of
series, over-convergence # boundary behavior of power
series, periods of modular forms, cohomology, modular symbols # special values of automorphic $L$-
series, series of functions # power
series, transformations, transforms, operational calculus, etc. # analytical theory:
series; Weil representation # theta
Serre spectral sequences
service # queues and set (change of topology, comparison of topologies, lattices of topologies) # several topologies on one set functions # integration with respect to measures and other set functions # real- or complex-valued set functions and measures and integrals in infinite-dimensional spaces (Wiener measure, Gaussian measure, etc.) set functions and measures on spaces with additional structure set functions and measures on topological groups, Haar measures, invariant measures set functions and measures on topological spaces (regularity of measures, etc.)

17. Citations: Polymorphism Is Set-theoretic - Pitts (ResearchIndex)
Polymorphism is Settheoretic, constructively. In DH Pitt et al., editors, A Characterization Of Lambda definability In Categorical Models .
http://citeseer.comp.nus.edu.sg/context/132613/0
39 citations found. Retrieving documents...
A. Pitts. Polymorphism is set theoretic , constructively. In Proceedings of the Conference on Category Theory and Computer Science, Edinburgh, UK, Sept. 1987.
@ NUS
Home/Search Document Not in Database Summary Related Articles Check
This paper is cited in the following contexts: Parametricity as a Notion of Uniformity in Reflexive Graphs - Dunphy (2002) (Correct) ....type judgements involving polymorphic types. There would need to be a function from [ 8X: A to [ X ] A 1 ; A n ; B) where B = 2 ] A for any 2 . This is not an easy task. While there are models of System F that have been produced in other settings [GLT89, BTC88, ] attempts for a simple, set based model run into foundational problems. For instance, an obvious attempt is to interpret a polymorphic type ; 8X: as the indexed product B2Set [ X ] B. However this product indexed over all sets is, in general, too big to be a set. These foundational ....
A. M. Pitts. Polymorphism is set-theoretic Programming Metalogics with a Fixpoint Type - Crole (1992) (9 citations) (Correct) ....logical systems FIX= and FIX correspond in a precise way to FIX categories and FIX hyperdoctrines respectively. We shall now define the categorical structure which corresponds to FIX = such structures will be called FIX categories with attributes.

18. Inference, Explanation, And Other Frustrations "d0e7551"
I will indicate how questions of eliminability and definability that elude precise . Settheoretic type and uses this output to complete its calculation.
http://content.cdlib.org/xtf/view?docId=ft4f59n977&doc.view=content&chunk.id=d0e

19. LC '98 Abstract: Alberto Marcone
definability in Function Spaces and Extensions of Functions If X is a countable topological space the descriptive Settheoretic complexity of C_p (X)
http://www.math.cas.cz/~lc98/abstracts/Marcone.html
Definability in Function Spaces and Extensions of Functions
Alberto Marcone
Dipartimento di Matematica, Universita' di Torino, Italy
marcone@dm.unito.it
Work in collaboration with Alessandro Andretta and Camillo Costantini. Theorem 1 (Andretta-M.) Let $X$ be Polish: 1) if X is locally compact then C_p(X) is standard Borel; 2) if X is not the countable union of compact sets then C_p(X) is not standard Borel but it is coanalytic. We are interested in how a function space behaves with respect to the topology of a different function space. For example we prove: Theorem 4 (Costantini-M.) Let X be a topological space, A a dense subset of X, and Y locally compact. Every continuous function from A to Y has an extension to X which is continuous at every point of A. (This answers a question of Arhangel'skii's.) Others are more descriptive set-theoretic: Theorem 5 (Costantini-M.) Let X be an uncountable Polish space and Y a separable metrizable space. The following are equivalent: i) for every A subset of X, every continuous function from A to Y has an extension to X which is continuous at every point of A; ii) $Y$ is Polish. Theorem 6 (Costantini-M.) Let X be metrizable, A a subset of X, Y completely metrizable and at least one of X and Y be separable. Every continuous function from A to Y has an extension to X which is of Baire class $1$ and is continuous at every point of A.

20. Model Theory (Stanford Encyclopedia Of Philosophy)
The fourth kind of definability is a pair of notions, . Then he would point out that the original argument paraphrases into a Settheoretic consequence
http://plato.stanford.edu/entries/model-theory/
Cite this entry Search the SEP Advanced Search Tools ...
Please Read How You Can Help Keep the Encyclopedia Free
Model Theory
First published Sat Nov 10, 2001; substantive revision Tue Jul 12, 2005 Model theory began with the study of formal languages and their interpretations, and of the kinds of classification that a particular formal language can make. Mainstream model theory is now a sophisticated branch of mathematics (see the entry on first-order model theory ). But in a broader sense, model theory is the study of the interpretation of any language, formal or natural, by means of set-theoretic structures, with Alfred Tarski's truth definition as a paradigm. In this broader sense, model theory meets philosophy at several points, for example in the theory of logical consequence and in the semantics of natural languages.
1. Basic notions of model theory
Sometimes we write or speak a sentence S that expresses nothing either true or false, because some crucial information is missing about what the words mean. If we go on to add this information, so that S comes to express a true or false statement, we are said to interpret S, and the added information is called an

21. MSC 2000 : CC = Set
03C55 Settheoretic model theory; 03C62 Models of arithmetic and set 03E47 Other notions of Set-theoretic definability; 03E70 Nonclassical and
http://www.mathdoc.emath.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=Set

22. CMS Winter 2003 Meeting
Tilting toward definability. We discuss some applications of Settheoretic methods to representation theory, in particular to tilting theory.
http://www.math.ca/Events/winter03/abs/mt.html
Org: Robert Woodrow (Calgary), Bradd Hart (Fields Institute), and/et John Baldwin (Illinois-Chicago)
JOHN BALDWIN, University of Illinois at Chicago, Chicago, Illinois 60607, USA
Categoricity and model completeness
Ever since Lindstom's `little' theorem: a -axiomatizable theory which is categorical in some infinite cardinality is model complete, there have been questions about weaker conditions on an -categorical theories that imply it is model complete. We will review some of the history of this problem and report the latest result: Theorem (Baldwin-Holland). The finite rank expansions of an algebraically closed field obtained by the Hrushovski construction are model complete. Moreover, this holds for such expansions of any strongly minimal set which admits `exactly k -independent formulas.
GREGORY CHERLIN, Rutgers University, Busch Campus/Piscataway, New Jersey 08854, USA
Countable universal graphs with forbidden subgraphs: a decision problem
Given a finite set C of finite connected graphs, which we declare to be "forbidden graphs," we say that a graph is C -free if it contains no subgraph isomorphic to one in the set C . We ask whether there is a countable C -free graph in which all countable C -free graphs embed. This is then a "countable universal graph with (specified) forbidden subgraphs". In the graph theoretic literature one finds various cases treated, notably the case of a single forbidden graph, where results of some substantial generality have been achieved. It is reasonable to ask whether the problem as formulated here can be solved in full generality. In particular one may ask whether the problem, as a whole, is decidable or not. Both practical experience and a model theoretic analysis suggest that this problem is intimately connected with one whose combinatorial content is considerably clearer: the local finiteness of a closure operation associated with the set

23. Scientific Commons Vladimir Sazonov
It is proved definability in FO+IFP of a global linear ordering on vertices this paper rather abstract, static Settheoretic view on the World-Wide Web
http://de.scientificcommons.org/vladimir_sazonov

24. Lusin's Theorem [Math]
He s talking about Settheoretic definability issues relating to things like the axiom of choice. Indeed, each nonmeasurable
http://www.adras.com/lusin-s-theorem.t21079-92-2.html
Math
in [ Math Prev: JSH: Prime numbers, counting tells it all
Next: Your #1 Work At Home Directory
From: cbrown on 14 Nov 2006 19:50 jennifer wrote:
> > function. Nor will she ever, for some interpretations of "know
> > an example".
(a) math.ubc.ca
I think you misunderstand Robert's comment; he means that /no one/ can
"know an example" of a non-measurable function, just like no one can
"know an example" of a well-ordering of R.
Cheers - Chas
From: Dave L. Renfro on 14 Nov 2006 19:54 Robert Israel wrote: >> some interpretations of "know an example". jennifer wrote: He's talking about set-theoretic definability issues relating to things like the axiom of choice. Indeed, each nonmeasurable function fails to belong to any of the Baire classes of functions, meaning it's pretty much impossible to reach by any sort of countably iterated limiting process. http://mathworld.wolfram.com/BaireFunction.html http://groups.google.com/groups?q=nonmeasurable+axiom-of-choice Mirko Sardella, "What's the price of a nonmeasurable set"

25. Logic Colloquium 2007 (Wrocław, Poland, July 14-19, 2007)
Some false Settheoretic principles like the refutation of Piotr Kowalski (Wroclaw) definability in Differential Fields (chair Ludomir Newelski)
http://www.math.wisc.edu/~lempp/conf/ELC07.html

Tentative Schedule
Time Saturday, July 14 Sunday, July 15 Monday, July 16 Tuesday, July 17
Wednesday, July 18
Thursday, July 19
Time
registration
opening ceremony
Matthias Baaz
Steve Jackson
(I)

Steve Jackson
...
Kjos-Hanssen
coffee coffee coffee coffee Kobi Peterzil (III) coffee Paul Larson Albert Atserias Fernando Ferreira Martin Hyland coffee Tony Martin Piotr Kowalski Kobi Peterzil (I) ... (II) special sessions: and ST 2 Rosalie Iemhoff Alex Simpson lunch lunch excursions lunch lunch special sessions: JPL 1 and MT 1 Vasco Brattka special sessions: PC and ST 1 Colin Stirling Bakh Khoussainov (II) ... Cristiano Calcagno coffee coffee Bakh Khoussainov (I) coffee Bakh Khoussainov (III) coffee special sessions: JPL 2 and MT 2 contributed talks contributed ... talks break contributed talks ASL reception (LICS participants also invited) ASL banquet Andrzej Grzegorczyk ASL Council meeting Color Coding: joint LICS/LC talks tutorial ... talks ASL business meetings social events/ excursions coffee breaks/ lunch Joint LICS/LC Long Talks: Martin Hyland (Cambridge): Combinatorics of Proofs (chair: Andy Pitts) Abstract: Ideally interpretations of proofs should exhibit some essential combinatorial features in an interesting and appealing way. As a case study, one can consider the notion of innocent strategy which is the basis for a game semantical interpretation of proofs and programmes. Some combinatorial content of this notion is sketched in the joint LICS paper accompanying this talk, whose abstract reads as follows.

26. Paradox On Ordinals And Human Mind
So not all the ordinals in the Settheoretic universe I ma theory of definability based on a less wildly immoderate idealization of the human mind.
http://osdir.com/ml/science.mathematics.fom/2004-12/msg00075.html
var addthis_pub = 'comforteagle'; science.mathematics.fom Top All Lists Date Thread
Paradox on Ordinals and Human Mind
Subject Paradox on Ordinals and Human Mind List-id Dmytro Taranovsky has asked about "König's Paradox" (=, for those who like the prose of Russell's "Mathematical Logic as based on...," "the contradiction concerning the least indefinable ordinal"). Suppose we understand "define" or "specify" in a way that makes contact with some, not TOO idealized, conception of the cognitive powers of human beings (or beings of the same "epistemological type," if you prefer a vaguer notion, as humans). On most reasonable precisifications of that, it is at least plausible that there is some limit to the number of definitions possible. [[[For example: Suppose you are a philosophical physicalist and think that the humanly-understandable concepts inject into physically distinguishable states of the brain. Then it seems plausible to me that only finitely many concepts can REALLY be understood, that with a moderate degree of idealization we

27. SUO: Re: Powers That B
which correspond to the Settheoretic notions of sets and classes, respectively. in Benabou s theory of fibrations and definability Benabou J.
http://suo.ieee.org/email/msg04805.html
Thread Links Date Links Thread Prev Thread Next Thread Index Date Prev ... Date Index
SUO: Re: Powers That B
http://suo.ieee.org/email/msg03804.html http://suo.ieee.org/email/msg01758.html http://suo.ieee.org/email/msg02950.html ... http://www.risc.uni-linz.ac.at/research/category/risc/catlist/goedel-cat

28. Model Theory (Stanford Encyclopedia Of Philosophy/Winter 2001 Edition)
The fourth kind of definability is a pair of notions, . For example in Boole’s case the Settheoretic consequences that he relies on are all easily
http://www.seop.leeds.ac.uk/archives/win2001/entries/model-theory/
This is a file in the archives of the Stanford Encyclopedia of Philosophy
Stanford Encyclopedia of Philosophy
A B C D ... Z
Model Theory
Model theory began with the study of formal languages and their interpretations, and of the kinds of classification that a particular formal language can make. Mainstream model theory is now a sophisticated branch of mathematics (see the entry on first-order model theory truth definition as a paradigm. In this broader sense, model theory meets philosophy at several points, for example in the theory of logical consequence and in the semantics of natural languages.
1. Basic notions of model theory
Sometimes we write or speak a sentence S that expresses nothing either true or false, because some crucial information is missing about what the words mean. If we go on to add this information, so that S comes to express a true or false statement, we are said to interpret S, and the added information is called an

29. Mathematik-Klassifikation / Teil 2
AMS 03E45 Construcibility, ordinal definability, and related notions; AMS 03E47 Other notions of Settheoretic definability; AMS 03E50 Continuum
http://www.ub.uni-heidelberg.de/helios/fachinfo/www/math/ams2.htm
@import url(/css/style.css); @import url(/css/printstyle.css); @import url(/css/ubhduni.css);
HEIDI Web-Seiten

30. CAT.INIST
Totality, definability and boolean circuits. A BUCCIARELLI, I SALVO seen as different algorithms for computing a given Settheoretic boolean function.
http://cat.inist.fr/?aModele=afficheN&cpsidt=2290350

31. IngentaConnect Delta: Set-theoretic Query Language Capturing LOGSPACE
Two versions of a set theoretic Delta language are considered as approaches by some new partial result on definability of a linear ordering over finite
http://www.ingentaconnect.com/content/klu/amai/2001/00000033/F0030002/00381481
var tcdacmd="dt";

32. Kvantifiointi Määriteltävien Relaatioiden Yli
7, J.Väänänen, Matemaattinen logiikka, Gaudeamus, 1987. 8, J.Väänänen, Settheoretic definability of Logics, 1 s. 599-643.
http://ethesis.helsinki.fi/julkaisut/mat/matem/pg/hakulinen/Liite1.html
Liite I: Kirjallisuusviitteet
J.Barwise, S.Feferman (toim.), Model-Theoretic Logics Springler-Verlag, 1985 G.S.Boolos, R.C.Jeffrey, Computability and Logic , Press Syndicate of the University of Campridge, 1974 C.C.Chang, J.Keisler, Model Theory , North Holland, 1973 H.-D.Ebbinghaus, Extended Logics: The General Framework [1] s. 25-76 A note on weak second-order logic with variables for elementarily definable relations , Proceedings of the Bertrand Russell Memorial Logic Conference, 1973, s. 221-233 Malliteoria , luentomoniste, Helsingin Yliopisto, 1988 Matemaattinen logiikka , Gaudeamus, 1987 Set-Theoretic Definability of Logics , [1] s. 599-643.

33. 358/369 (Total 5522) NO 167 03E65 Other Hypotheses
Translate this page 163, 03E47, Other notions of Set-theoretic definability. 162, 03E45, Inner models, including constructibility, ordinal definability, and core models
http://www.mathnet.or.kr/mathnet/msc_list.php?mode=list&ftype=&fstr=&page=358

34. MSC 2000 : CC = Theoretic
03C25 Modeltheoretic forcing; 03C55 Set-theoretic model theory 11U09, 12L12, 13L05, 16B70, 20A15; 03E47 Other notions of Set-theoretic definability
http://math-doc.ujf-grenoble.fr/cgi-bin/msc2000.py?L=en&T=Q&C=msc2000&CC=Theoret

35. 0 Steps 0 Top Appears 1 0 Steps - Nodes 1 1 Steps 87 Computer
model theory appears 2 4 steps 237 Settheoretic model theory appears 2 4 set algebra appears 2 4 steps 398 Set-theoretic definability appears 2 4
http://www.science.uva.nl/~caterina/LoLaLi/soft/ch-data/node_levels.txt
steps: top appears 1 steps - nodes 1 1 steps: 87 computer science appears 1 1 steps: 173 linguistics appears 1 1 steps: 202 mathematics appears 1 1 steps: 258 philosophy appears 1 1 steps - nodes 4 2 steps: 5 algebra 1 appears 1 2 steps: 20 ambiguity appears 1 2 steps: 34 artificial intelligence appears 1 2 steps: 88 software appears 1 2 steps: 89 theory of computation appears 1 2 steps: 140 language generation appears 1 2 steps: 174 language acquisition appears 1 2 steps: 175 semantics 175 appears 1 2 steps: 176 mathematical logic appears 1 2 steps: 191 logic (1) appears 2 2 steps: 208 metaphysics appears 1 2 steps: 259 logic 259 appears 1 2 steps: 361 formal semantics appears 1 2 steps: 424 system appears 1 2 steps: 443 linguistic geography appears 1 2 steps: 446 descriptive linguistics appears 1 2 steps: 450 pragmatics appears 1 2 steps: 496 syntax 496 appears 1 2 steps: 499 syntax and semantic interface appears 1 2 steps: 502 discontinuity appears 1 2 steps: 506 linguistic phenomena appears 1 2 steps: 510 frameworks appears 1 2 steps: 524 philosophy of language appears 1 2 steps: 527 algebra 2 appears 1 2 steps - nodes 24 3 steps: 6 boolean algebra appears 1 3 steps: 8 lattice appears 1 3 steps: 9 Lindenbaum algebra appears 1 3 steps: 10 relation algebra appears 1 3 steps: 11 universal algebra appears 1 3 steps: 12 algebraic logic appears 1 3 steps: 21 derivational ambiguity appears 1 3 steps: 22 lexical ambiguity appears 1 3 steps: 23 polymorphism appears 1 3 steps: 24 pragmatic ambiguity appears 1 3 steps: 25 semantic ambiguity appears 2 3 steps: 26 structural ambiguity appears 1 3 steps: 27 syntactic ambiguity appears 1 3 steps: 31 animal appears 1 3 steps: 36 classification appears 1 3 steps: 37 heuristic appears 1 3 steps: 38 knowledge representation appears 3 3 steps: 40 planning appears 1 3 steps: 41 aspect appears 1 3 steps: 46 attitude appears 1 3 steps: 48 automata theory appears 1 3 steps: 53 automated reasoning appears 3 3 steps: 77 category theory appears 2 3 steps: 83 completeness appears 3 3 steps: 100 conversational maxim appears 1 3 steps: 104 database appears 1 3 steps: 123 extension appears 1 3 steps: 125 feature logic appears 2 3 steps: 127 formal language theory appears 1 3 steps: 128 categorial grammar appears 1 3 steps: 141 reversibility appears 1 3 steps: 142 grammar appears 1 3 steps: 146 indexicality appears 1 3 steps: 148 intension appears 1 3 steps: 156 modal logic appears 2 3 steps: 167 temporal logic (2) appears 2 3 steps: 168 lambda calculus appears 2 3 steps: 177 aristotelean logic appears 3 3 steps: 178 compactness appears 3 3 steps: 179 Goedel's 1st incompleteness theorem (1931) appears 3 3 steps: 180 Lindstroem's theorem appears 3 3 steps: 181 logical constants appears 1 3 steps: 182 Loewenheim-Skolem-Tarski theorem appears 3 3 steps: 183 operator appears 3 3 steps: 184 symbolic logic appears 1 3 steps: 185 computational logic (1) appears 1 3 steps: 191 logic (1) appears 1 3 steps: 192 combinatory logic appears 2 3 steps: 193 computability theory appears 2 3 steps: 194 computational logic (2) appears 2 3 steps: 195 constraint programming appears 2 3 steps: 196 foundations of theories appears 2 3 steps: 197 model theory appears 2 3 steps: 198 proof theory appears 2 3 steps: 199 recursive function theory appears 2 3 steps: 200 relevance logic appears 2 3 steps: 201 set theory appears 2 3 steps: 209 common sense world appears 1 3 steps: 216 abstract model theory appears 2 3 steps: 240 Montague grammar appears 1 3 steps: 254 quantifier appears 1 3 steps: 263 presupposition appears 1 3 steps: 275 programming language appears 1 3 steps: 302 recursion theory appears 1 3 steps: 332 reference appears 1 3 steps: 334 referent appears 1 3 steps: 353 truth appears 2 3 steps: 354 underspecification appears 1 3 steps: 361 formal semantics appears 3 3 steps: 362 dynamic semantics appears 1 3 steps: 363 lexical semantics appears 1 3 steps: 364 natural logic appears 1 3 steps: 365 property theory appears 1 3 steps: 366 situation semantics appears 1 3 steps: 367 semantics 367 appears 2 3 steps: 403 speech act appears 1 3 steps: 435 type theory appears 3 3 steps: 449 proposition appears 1 3 steps: 475 first order logic appears 2 3 steps: 481 linear logic appears 2 3 steps: 491 algebraic principles appears 1 3 steps: 495 substructural logic appears 2 3 steps: 497 movement appears 1 3 steps: 498 word order appears 1 3 steps: 499 syntax and semantic interface appears 1 3 steps: 500 quantified phrases appears 1 3 steps: 501 coordination appears 1 3 steps: 507 compositionality appears 1 3 steps: 515 quantification appears 1 3 steps: 520 Goedel's 2nd incompleteness theorem (1931) appears 1 3 steps: 526 variable appears 2 3 steps: 529 GB appears 1 3 steps: 530 TAG appears 1 3 steps: 531 dynamic syntax appears 1 3 steps: 532 DRT appears 1 3 steps: 534 HPSG appears 1 3 steps: 535 LFG appears 1 3 steps - nodes 97 4 steps: 6 boolean algebra appears 1 4 steps: 7 boolean algebra with operators appears 1 4 steps: 8 lattice appears 1 4 steps: 10 relation algebra appears 1 4 steps: 11 universal algebra appears 2 4 steps: 13 categorical logic appears 1 4 steps: 14 cylindric algebra appears 1 4 steps: 15 Lukasiewicz algebra appears 1 4 steps: 16 polyadic algebra appears 1 4 steps: 17 post algebra appears 1 4 steps: 18 quantum logic appears 1 4 steps: 19 topos appears 1 4 steps: 23 polymorphism appears 3 4 steps: 32 donkey appears 1 4 steps: 33 unicorn appears 1 4 steps: 35 belief revision appears 3 4 steps: 38 knowledge representation appears 1 4 steps: 39 syllogism appears 3 4 steps: 42 aspectual classification appears 1 4 steps: 47 propositional attitude appears 1 4 steps: 49 finite state machine appears 1 4 steps: 50 linear bounded automaton appears 1 4 steps: 51 push down automaton appears 1 4 steps: 52 Turing machine appears 2 4 steps: 53 automated reasoning appears 2 4 steps: 54 answer extraction appears 3 4 steps: 55 clause 55 appears 3 4 steps: 56 completion appears 3 4 steps: 57 connection graph procedure appears 3 4 steps: 58 connection matrix appears 3 4 steps: 59 deduction appears 5 4 steps: 60 Herbrand's theorem appears 3 4 steps: 61 literal appears 3 4 steps: 62 logic programming appears 3 4 steps: 63 mathematical induction appears 3 4 steps: 64 metatheory appears 3 4 steps: 65 model checking appears 3 4 steps: 66 narrowing appears 3 4 steps: 67 nonmonotonic reasoning appears 3 4 steps: 68 paramodulation appears 3 4 steps: 69 reason extraction appears 3 4 steps: 70 resolution appears 3 4 steps: 71 rewrite system appears 3 4 steps: 72 skolemisation appears 3 4 steps: 73 theorem prover appears 3 4 steps: 74 uncertainty appears 3 4 steps: 75 unification appears 5 4 steps: 78 bottom appears 2 4 steps: 81 clause 81 appears 3 4 steps: 83 completeness appears 2 4 steps: 84 axiomatic completeness appears 3 4 steps: 85 functional completeness appears 5 4 steps: 92 concept analysis appears 3 4 steps: 93 concept formation appears 3 4 steps: 94 conditional statement appears 1 4 steps: 97 context appears 3 4 steps: 101 conversational implicature appears 1 4 steps: 102 cooperative principle appears 1 4 steps: 103 implicature appears 2 4 steps: 104 database appears 3 4 steps: 105 query appears 1 4 steps: 107 consistency appears 2 4 steps: 108 entailment appears 2 4 steps: 110 natural deduction appears 2 4 steps: 124 extensionality appears 1 4 steps: 125 feature logic appears 2 4 steps: 128 categorial grammar appears 1 4 steps: 129 category appears 1 4 steps: 130 Chomsky hierarchy appears 1 4 steps: 131 context free language appears 1 4 steps: 132 context sensitive language appears 1 4 steps: 133 feature constraint appears 1 4 steps: 134 phrase structure grammar appears 1 4 steps: 135 recursive language appears 2 4 steps: 136 regular language appears 1 4 steps: 137 unrestricted language appears 1 4 steps: 143 sentence appears 1 4 steps: 144 syntax 144 appears 1 4 steps: 145 idea appears 3 4 steps: 147 indexical expression appears 1 4 steps: 149 intensional isomorphism appears 1 4 steps: 150 intensional verb appears 1 4 steps: 151 intensionality appears 1 4 steps: 152 frame (1) appears 3 4 steps: 153 frame problem appears 3 4 steps: 154 logical omniscience appears 3 4 steps: 156 modal logic appears 5 4 steps: 157 predicate logic appears 4 4 steps: 159 procedural representation appears 3 4 steps: 160 relation system appears 3 4 steps: 161 representation language appears 3 4 steps: 162 rule-based representation appears 3 4 steps: 163 script appears 3 4 steps: 164 semantic network appears 3 4 steps: 165 situation calculus appears 3 4 steps: 166 temporal logic (1) appears 3 4 steps: 167 temporal logic (2) appears 4 4 steps: 168 lambda calculus appears 1 4 steps: 169 abstraction appears 2 4 steps: 170 application appears 2 4 steps: 171 conversion appears 2 4 steps: 172 lambda operator appears 2 4 steps: 177 aristotelean logic appears 1 4 steps: 178 compactness appears 1 4 steps: 179 Goedel's 1st incompleteness theorem (1931) appears 1 4 steps: 180 Lindstroem's theorem appears 1 4 steps: 182 Loewenheim-Skolem-Tarski theorem appears 1 4 steps: 183 operator appears 1 4 steps: 186 program construct appears 1 4 steps: 187 program specification appears 1 4 steps: 188 program verification appears 1 4 steps: 189 reasoning about programs appears 1 4 steps: 190 semantics 190 appears 2 4 steps: 192 combinatory logic appears 1 4 steps: 193 computability theory appears 1 4 steps: 194 computational logic (2) appears 1 4 steps: 195 constraint programming appears 1 4 steps: 196 foundations of theories appears 1 4 steps: 197 model theory appears 1 4 steps: 198 proof theory appears 1 4 steps: 199 recursive function theory appears 1 4 steps: 200 relevance logic appears 2 4 steps: 201 set theory appears 3 4 steps: 210 modal operator appears 5 4 steps: 211 alethic logic appears 2 4 steps: 212 deontic logic appears 2 4 steps: 213 doxastic logic appears 2 4 steps: 214 epistemic logic appears 2 4 steps: 215 Kripke semantics appears 4 4 steps: 216 abstract model theory appears 3 4 steps: 217 admissible set appears 2 4 steps: 218 categoricity appears 2 4 steps: 219 completeness of theories appears 2 4 steps: 220 definability appears 2 4 steps: 221 denumerable structure appears 2 4 steps: 222 equational class appears 2 4 steps: 223 finite structure appears 2 4 steps: 224 higher-order model theory appears 2 4 steps: 225 infinitary logic appears 2 4 steps: 226 interpolation appears 2 4 steps: 227 logic with extra quantifiers appears 2 4 steps: 228 model-theoretic algebra appears 2 4 steps: 229 model-theoretic forcing appears 2 4 steps: 230 model of arithmetic appears 2 4 steps: 231 nonclassical model appears 2 4 steps: 232 preservation appears 2 4 steps: 233 quantifier elimination appears 2 4 steps: 234 recursion-theoretic model theory appears 2 4 steps: 235 saturation appears 2 4 steps: 236 second-order model theory appears 2 4 steps: 237 set-theoretic model theory appears 2 4 steps: 238 stability appears 2 4 steps: 239 ultraproduct appears 2 4 steps: 240 Montague grammar appears 3 4 steps: 241 meaning postulate appears 1 4 steps: 242 ptq appears 1 4 steps: 243 sense 243 appears 1 4 steps: 244 sense 244 appears 1 4 steps: 247 nonmonotonic logic appears 6 4 steps: 254 quantifier appears 10 4 steps: 276 syntax 276 appears 1 4 steps: 277 prolog appears 1 4 steps: 281 complexity of proofs appears 2 4 steps: 282 constructive analysis appears 2 4 steps: 283 constructive system appears 2 4 steps: 284 cut elimination theorem appears 2 4 steps: 285 first-order arithmetic appears 2 4 steps: 286 functionals in proof theory appears 2 4 steps: 287 Goedel numbering appears 2 4 steps: 288 higher-order arithmetic appears 2 4 steps: 289 interpretation appears 2 4 steps: 290 intuitionistic mathematics appears 2 4 steps: 291 metamathematics appears 2 4 steps: 292 normal form theorem appears 2 4 steps: 293 ordinal notation appears 2 4 steps: 294 recursive analysis appears 2 4 steps: 295 recursive ordinal appears 2 4 steps: 296 relative consistency appears 2 4 steps: 297 second-order arithmetic appears 2 4 steps: 298 structure of proofs appears 2 4 steps: 301 scope appears 1 4 steps: 303 abstract recursion theory appears 1 4 steps: 304 automaton appears 1 4 steps: 305 axiomatic recursion theory appears 1 4 steps: 306 complexity of computation appears 1 4 steps: 307 decidability appears 1 4 steps: 308 degrees of sets of sentences appears 1 4 steps: 309 effectively presented structure appears 1 4 steps: 310 formal grammar appears 1 4 steps: 311 hierarchy appears 1 4 steps: 312 higher type recursion theory appears 1 4 steps: 313 inductive definability appears 1 4 steps: 314 isol appears 1 4 steps: 315 post system appears 1 4 steps: 316 recursion theory on admissible sets appears 1 4 steps: 317 recursion theory on ordinals appears 1 4 steps: 318 recursive axiomatizability appears 1 4 steps: 319 recursive equivalence type appears 1 4 steps: 320 recursive function appears 1 4 steps: 321 recursive relation appears 1 4 steps: 322 recursively enumerable degree appears 1 4 steps: 323 recursively enumerable language appears 1 4 steps: 324 recursively enumerable set appears 1 4 steps: 325 reducibility appears 1 4 steps: 326 set recursion theory appears 1 4 steps: 327 subrecursive hierarchy appears 1 4 steps: 328 theory of numerations appears 1 4 steps: 329 thue system appears 1 4 steps: 330 undecidability appears 1 4 steps: 331 word problem appears 1 4 steps: 333 identity puzzle appears 1 4 steps: 335 referential term appears 1 4 steps: 352 rabbit appears 1 4 steps: 353 truth appears 3 4 steps: 361 formal semantics appears 1 4 steps: 362 dynamic semantics appears 3 4 steps: 363 lexical semantics appears 3 4 steps: 364 natural logic appears 4 4 steps: 365 property theory appears 3 4 steps: 366 situation semantics appears 3 4 steps: 367 semantics 367 appears 1 4 steps: 368 assignment appears 2 4 steps: 369 material implication appears 2 4 steps: 370 satisfaction appears 2 4 steps: 371 truth conditional semantics appears 2 4 steps: 372 truth function appears 4 4 steps: 373 truth table appears 2 4 steps: 377 axiom of choice appears 2 4 steps: 378 borel classification appears 2 4 steps: 379 cardinal number appears 2 4 steps: 380 combinatorial set theory appears 2 4 steps: 381 constructibility appears 2 4 steps: 382 continuum hypothesis appears 2 4 steps: 383 descriptive set theory appears 2 4 steps: 384 determinacy appears 2 4 steps: 385 filter appears 2 4 steps: 386 function appears 2 4 steps: 387 fuzzy relation appears 2 4 steps: 388 fuzzy set appears 2 4 steps: 389 generalized continuum hypothesis appears 2 4 steps: 390 independence appears 2 4 steps: 391 iota operator appears 2 4 steps: 392 large cardinal appears 2 4 steps: 393 Martin's axiom appears 2 4 steps: 394 ordinal definability appears 2 4 steps: 395 ordinal number appears 2 4 steps: 396 relation appears 2 4 steps: 397 set algebra appears 2 4 steps: 398 set-theoretic definability appears 2 4 steps: 399 Suslin scheme appears 2 4 steps: 400 situation appears 1 4 steps: 402 partiality appears 1 4 steps: 404 illocutionary force appears 1 4 steps: 405 indirect speech act appears 1 4 steps: 406 performative appears 1 4 steps: 407 performative hypothesis appears 1 4 steps: 408 statement appears 1 4 steps: 410 boolean logic appears 1 4 steps: 411 conditional logic appears 1 4 steps: 412 dynamic logic appears 1 4 steps: 413 fuzzy logic appears 1 4 steps: 414 higher-order logic appears 1 4 steps: 415 inductive logic appears 1 4 steps: 416 intermediate logic appears 1 4 steps: 417 intuitionistic logic appears 1 4 steps: 418 many-valued logic appears 1 4 steps: 419 paraconsistent logic appears 1 4 steps: 420 partial logic appears 1 4 steps: 421 probability logic appears 1 4 steps: 422 propositional logic appears 1 4 steps: 430 truth condition appears 2 4 steps: 431 truth definition appears 2 4 steps: 432 truth value appears 2 4 steps: 433 type appears 3 4 steps: 435 type theory appears 2 4 steps: 436 monotonic semantics appears 1 4 steps: 437 quasi-logical form appears 1 4 steps: 444 linguistic unit appears 1 4 steps: 448 contradiction appears 1 4 steps: 452 grammatical constituent appears 1 4 steps: 454 first order model theory appears 2 4 steps: 457 modal model theory appears 4 4 steps: 462 model appears 2 4 steps: 471 modal language appears 2 4 steps: 475 first order logic appears 1 4 steps: 476 first order language appears 2 4 steps: 481 linear logic appears 1 4 steps: 485 proof nets appears 2 4 steps: 486 frame (2) appears 2 4 steps: 488 modes appears 2 4 steps: 489 accessability relation appears 2 4 steps: 492 residuation appears 1 4 steps: 493 correspondence theory appears 2 4 steps: 495 substructural logic appears 1 4 steps: 503 sequent calculus appears 2 4 steps: 507 compositionality appears 3 4 steps: 511 SPASS appears 2 4 steps: 512 S4 appears 2 4 steps: 513 Aristotle on quantification appears 5 4 steps: 514 Frege on quantification appears 2 4 steps: 515 quantification appears 5 4 steps: 516 bound variable appears 2 4 steps: 517 free variable appears 4 4 steps: 518 truth-funcional operator appears 3 4 steps: 519 derivation appears 1 4 steps: 525 arity appears 3 4 steps: 526 variable appears 1 4 steps: 528 combinatorial categorial grammar appears 1 4 steps - nodes 308 5 steps: 7 boolean algebra with operators appears 1 5 steps: 11 universal algebra appears 1 5 steps: 23 polymorphism appears 2 5 steps: 35 belief revision appears 2 5 steps: 39 syllogism appears 1 5 steps: 43 assertion appears 2 5 steps: 54 answer extraction appears 2 5 steps: 55 clause 55 appears 2 5 steps: 56 completion appears 2 5 steps: 57 connection graph procedure appears 2 5 steps: 58 connection matrix appears 2 5 steps: 59 deduction appears 3 5 steps: 60 Herbrand's theorem appears 2 5 steps: 61 literal appears 2 5 steps: 62 logic programming appears 2 5 steps: 63 mathematical induction appears 2 5 steps: 64 metatheory appears 2 5 steps: 65 model checking appears 2 5 steps: 66 narrowing appears 2 5 steps: 67 nonmonotonic reasoning appears 2 5 steps: 68 paramodulation appears 2 5 steps: 69 reason extraction appears 2 5 steps: 70 resolution appears 3 5 steps: 71 rewrite system appears 2 5 steps: 72 skolemisation appears 2 5 steps: 73 theorem prover appears 2 5 steps: 74 uncertainty appears 2 5 steps: 75 unification appears 4 5 steps: 76 update appears 3 5 steps: 79 Gentzen clause appears 3 5 steps: 80 horn clause appears 3 5 steps: 81 clause 81 appears 2 5 steps: 82 relative clause appears 3 5 steps: 84 axiomatic completeness appears 2 5 steps: 85 functional completeness appears 3 5 steps: 86 Knuth Bendix completion appears 3 5 steps: 90 concept appears 9 5 steps: 92 concept analysis appears 1 5 steps: 93 concept formation appears 1 5 steps: 95 antecedent appears 1 5 steps: 96 counterfactual appears 1 5 steps: 97 context appears 1 5 steps: 98 context change appears 3 5 steps: 99 context dependence appears 3 5 steps: 104 database appears 1 5 steps: 105 query appears 3 5 steps: 106 consequence appears 5 5 steps: 107 consistency appears 8 5 steps: 108 entailment appears 7 5 steps: 109 inconsistency appears 5 5 steps: 110 natural deduction appears 6 5 steps: 111 rule-based deduction appears 5 5 steps: 112 description appears 1 5 steps: 115 discourse appears 1 5 steps: 119 domain theory appears 2 5 steps: 121 ellipsis appears 1 5 steps: 145 idea appears 1 5 steps: 152 frame (1) appears 1 5 steps: 153 frame problem appears 1 5 steps: 154 logical omniscience appears 1 5 steps: 156 modal logic appears 1 5 steps: 157 predicate logic appears 1 5 steps: 159 procedural representation appears 1 5 steps: 160 relation system appears 1 5 steps: 161 representation language appears 1 5 steps: 162 rule-based representation appears 1 5 steps: 163 script appears 1 5 steps: 164 semantic network appears 1 5 steps: 165 situation calculus appears 1 5 steps: 166 temporal logic (1) appears 1 5 steps: 167 temporal logic (2) appears 1 5 steps: 169 abstraction appears 1 5 steps: 170 application appears 1 5 steps: 171 conversion appears 1 5 steps: 172 lambda operator appears 1 5 steps: 201 set theory appears 1 5 steps: 203 meaning relation appears 1 5 steps: 210 modal operator appears 8 5 steps: 211 alethic logic appears 5 5 steps: 212 deontic logic appears 5 5 steps: 213 doxastic logic appears 5 5 steps: 214 epistemic logic appears 5 5 steps: 215 Kripke semantics appears 12 5 steps: 216 abstract model theory appears 1 5 steps: 217 admissible set appears 1 5 steps: 218 categoricity appears 1 5 steps: 219 completeness of theories appears 1 5 steps: 220 definability appears 1 5 steps: 221 denumerable structure appears 1 5 steps: 222 equational class appears 1 5 steps: 223 finite structure appears 1 5 steps: 224 higher-order model theory appears 1 5 steps: 225 infinitary logic appears 1 5 steps: 226 interpolation appears 1 5 steps: 227 logic with extra quantifiers appears 1 5 steps: 228 model-theoretic algebra appears 1 5 steps: 229 model-theoretic forcing appears 1 5 steps: 230 model of arithmetic appears 1 5 steps: 231 nonclassical model appears 1 5 steps: 232 preservation appears 1 5 steps: 233 quantifier elimination appears 1 5 steps: 234 recursion-theoretic model theory appears 1 5 steps: 235 saturation appears 1 5 steps: 236 second-order model theory appears 1 5 steps: 237 set-theoretic model theory appears 1 5 steps: 238 stability appears 1 5 steps: 239 ultraproduct appears 1 5 steps: 240 Montague grammar appears 1 5 steps: 241 meaning postulate appears 3 5 steps: 242 ptq appears 3 5 steps: 243 sense 243 appears 3 5 steps: 244 sense 244 appears 3 5 steps: 245 boolean valued appears 2 5 steps: 246 sheaf model appears 2 5 steps: 247 nonmonotonic logic appears 3 5 steps: 248 default inference appears 6 5 steps: 252 iff appears 3 5 steps: 253 negation appears 3 5 steps: 254 quantifier appears 6 5 steps: 255 paradox appears 1 5 steps: 264 control primitive appears 1 5 steps: 265 functional construct appears 1 5 steps: 266 object oriented construct appears 1 5 steps: 267 program scheme appears 1 5 steps: 268 type structure appears 1 5 steps: 269 invariant appears 2 5 steps: 270 post-condition appears 1 5 steps: 271 pre-condition appears 1 5 steps: 272 specification technique appears 1 5 steps: 273 logic of programs appears 1 5 steps: 274 mechanical verification appears 1 5 steps: 281 complexity of proofs appears 1 5 steps: 282 constructive analysis appears 1 5 steps: 283 constructive system appears 1 5 steps: 284 cut elimination theorem appears 1 5 steps: 285 first-order arithmetic appears 1 5 steps: 286 functionals in proof theory appears 1 5 steps: 287 Goedel numbering appears 1 5 steps: 288 higher-order arithmetic appears 1 5 steps: 289 interpretation appears 1 5 steps: 290 intuitionistic mathematics appears 1 5 steps: 291 metamathematics appears 1 5 steps: 292 normal form theorem appears 1 5 steps: 293 ordinal notation appears 1 5 steps: 294 recursive analysis appears 1 5 steps: 295 recursive ordinal appears 1 5 steps: 296 relative consistency appears 1 5 steps: 297 second-order arithmetic appears 1 5 steps: 298 structure of proofs appears 1 5 steps: 299 belief appears 1 5 steps: 300 quantifying in appears 1 5 steps: 301 scope appears 10 5 steps: 336 anchor appears 1 5 steps: 337 demodulation appears 3 5 steps: 338 ordering appears 3 5 steps: 339 purity principle appears 3 5 steps: 340 removal of tautologies appears 3 5 steps: 341 resolution refinement appears 3 5 steps: 342 simplification appears 3 5 steps: 343 subsumption appears 3 5 steps: 348 confluence appears 3 5 steps: 349 critical pair appears 3 5 steps: 350 termination appears 3 5 steps: 351 scoping algorithm appears 1 5 steps: 353 truth appears 1 5 steps: 355 algebraic semantics appears 2 5 steps: 356 denotational semantics appears 2 5 steps: 357 operational semantics appears 2 5 steps: 358 partial evaluation appears 2 5 steps: 359 process model appears 2 5 steps: 360 program analysis appears 2 5 steps: 362 dynamic semantics appears 1 5 steps: 363 lexical semantics appears 1 5 steps: 364 natural logic appears 1 5 steps: 365 property theory appears 1 5 steps: 366 situation semantics appears 1 5 steps: 368 assignment appears 1 5 steps: 369 material implication appears 1 5 steps: 370 satisfaction appears 1 5 steps: 371 truth conditional semantics appears 1 5 steps: 372 truth function appears 4 5 steps: 373 truth table appears 1 5 steps: 374 literal meaning appears 1 5 steps: 375 metaphor appears 1 5 steps: 376 metonymy appears 1 5 steps: 377 axiom of choice appears 3 5 steps: 378 borel classification appears 3 5 steps: 379 cardinal number appears 3 5 steps: 380 combinatorial set theory appears 3 5 steps: 381 constructibility appears 3 5 steps: 382 continuum hypothesis appears 3 5 steps: 383 descriptive set theory appears 3 5 steps: 384 determinacy appears 3 5 steps: 385 filter appears 3 5 steps: 386 function appears 3 5 steps: 387 fuzzy relation appears 3 5 steps: 388 fuzzy set appears 3 5 steps: 389 generalized continuum hypothesis appears 3 5 steps: 390 independence appears 3 5 steps: 391 iota operator appears 3 5 steps: 392 large cardinal appears 3 5 steps: 393 Martin's axiom appears 3 5 steps: 394 ordinal definability appears 3 5 steps: 395 ordinal number appears 3 5 steps: 396 relation appears 3 5 steps: 397 set algebra appears 3 5 steps: 398 set-theoretic definability appears 3 5 steps: 399 Suslin scheme appears 3 5 steps: 400 situation appears 3 5 steps: 401 scene appears 1 5 steps: 402 partiality appears 3 5 steps: 409 indicative statement appears 1 5 steps: 423 syntactic category appears 1 5 steps: 427 Bliksem appears 3 5 steps: 428 Boyer-Moore theorem prover appears 3 5 steps: 429 SPASS appears 3 5 steps: 430 truth condition appears 3 5 steps: 431 truth definition appears 3 5 steps: 432 truth value appears 3 5 steps: 433 type appears 2 5 steps: 434 type shifting appears 3 5 steps: 440 word appears 1 5 steps: 453 logical syntax appears 1 5 steps: 454 first order model theory appears 1 5 steps: 455 homomorphism appears 6 5 steps: 457 modal model theory appears 6 5 steps: 459 disjoint union of models appears 4 5 steps: 460 bisimulation appears 4 5 steps: 461 generated submodel appears 4 5 steps: 462 model appears 9 5 steps: 463 valuation appears 2 5 steps: 464 finite model appears 2 5 steps: 465 tree model appears 2 5 steps: 466 image finite model appears 2 5 steps: 469 expressive power appears 4 5 steps: 471 modal language appears 5 5 steps: 472 diamond appears 5 5 steps: 473 box appears 5 5 steps: 474 tree model property appears 1 5 steps: 476 first order language appears 1 5 steps: 477 fragment appears 2 5 steps: 482 hypothetical reasoning appears 4 5 steps: 483 normalization appears 2 5 steps: 484 structural rules appears 2 5 steps: 485 proof nets appears 1 5 steps: 486 frame (2) appears 5 5 steps: 487 frame constraints appears 2 5 steps: 488 modes appears 5 5 steps: 489 accessability relation appears 9 5 steps: 490 boolean operators appears 2 5 steps: 493 correspondence theory appears 1 5 steps: 494 labelled deductive system appears 5 5 steps: 500 quantified phrases appears 1 5 steps: 503 sequent calculus appears 1 5 steps: 504 subformula property appears 1 5 steps: 507 compositionality appears 1 5 steps: 508 functional composition appears 2 5 steps: 509 functional application appears 2 5 steps: 511 SPASS appears 1 5 steps: 512 S4 appears 5 5 steps: 513 Aristotle on quantification appears 16 5 steps: 514 Frege on quantification appears 15 5 steps: 515 quantification appears 2 5 steps: 516 bound variable appears 15 5 steps: 517 free variable appears 16 5 steps: 518 truth-funcional operator appears 1 5 steps: 521 standard deontic logic appears 2 5 steps: 522 dyadic deontic logic appears 2 5 steps: 523 two-sorted deontic logic appears 2 5 steps: 525 arity appears 1 5 steps: 528 combinatorial categorial grammar appears 1 5 steps - nodes 271 6 steps: 12 algebraic logic appears 1 6 steps: 28 anaphor appears 1 6 steps: 44 declarative assertion appears 2 6 steps: 45 imperative assertion appears 2 6 steps: 76 update appears 2 6 steps: 79 Gentzen clause appears 2 6 steps: 80 horn clause appears 2 6 steps: 82 relative clause appears 2 6 steps: 86 Knuth Bendix completion appears 2 6 steps: 90 concept appears 3 6 steps: 91 individual concept appears 9 6 steps: 98 context change appears 1 6 steps: 99 context dependence appears 1 6 steps: 105 query appears 1 6 steps: 106 consequence appears 3 6 steps: 107 consistency appears 4 6 steps: 108 entailment appears 4 6 steps: 109 inconsistency appears 3 6 steps: 110 natural deduction appears 3 6 steps: 111 rule-based deduction appears 3 6 steps: 113 definite description appears 1 6 steps: 114 indefinite description appears 1 6 steps: 116 discourse particle appears 1 6 steps: 117 discourse referent appears 1 6 steps: 118 discourse representation theory appears 1 6 steps: 120 domain appears 2 6 steps: 122 antecedent of ellipsis appears 1 6 steps: 138 function word appears 1 6 steps: 203 meaning relation appears 3 6 steps: 204 antonymy appears 1 6 steps: 205 hyponymy appears 1 6 steps: 206 paraphrase appears 1 6 steps: 207 synonymy appears 1 6 steps: 210 modal operator appears 6 6 steps: 211 alethic logic appears 1 6 steps: 212 deontic logic appears 1 6 steps: 213 doxastic logic appears 1 6 steps: 214 epistemic logic appears 1 6 steps: 215 Kripke semantics appears 7 6 steps: 241 meaning postulate appears 1 6 steps: 242 ptq appears 1 6 steps: 243 sense 243 appears 1 6 steps: 244 sense 244 appears 1 6 steps: 245 boolean valued appears 1 6 steps: 246 sheaf model appears 1 6 steps: 248 default inference appears 3 6 steps: 249 noun appears 1 6 steps: 252 iff appears 1 6 steps: 253 negation appears 1 6 steps: 254 quantifier appears 1 6 steps: 256 liar paradox appears 1 6 steps: 257 semantic paradox appears 1 6 steps: 278 pronoun appears 1 6 steps: 300 quantifying in appears 3 6 steps: 301 scope appears 6 6 steps: 337 demodulation appears 3 6 steps: 338 ordering appears 3 6 steps: 339 purity principle appears 3 6 steps: 340 removal of tautologies appears 3 6 steps: 341 resolution refinement appears 3 6 steps: 342 simplification appears 3 6 steps: 343 subsumption appears 3 6 steps: 344 hyper resolution appears 3 6 steps: 345 lock resolution appears 3 6 steps: 346 set of support appears 3 6 steps: 347 theory resolution appears 3 6 steps: 348 confluence appears 2 6 steps: 349 critical pair appears 2 6 steps: 350 termination appears 2 6 steps: 351 scoping algorithm appears 10 6 steps: 372 truth function appears 1 6 steps: 374 literal meaning appears 3 6 steps: 375 metaphor appears 3 6 steps: 376 metonymy appears 3 6 steps: 377 axiom of choice appears 1 6 steps: 378 borel classification appears 1 6 steps: 379 cardinal number appears 1 6 steps: 380 combinatorial set theory appears 1 6 steps: 381 constructibility appears 1 6 steps: 382 continuum hypothesis appears 1 6 steps: 383 descriptive set theory appears 1 6 steps: 384 determinacy appears 1 6 steps: 385 filter appears 1 6 steps: 386 function appears 1 6 steps: 387 fuzzy relation appears 1 6 steps: 388 fuzzy set appears 1 6 steps: 389 generalized continuum hypothesis appears 1 6 steps: 390 independence appears 1 6 steps: 391 iota operator appears 1 6 steps: 392 large cardinal appears 1 6 steps: 393 Martin's axiom appears 1 6 steps: 394 ordinal definability appears 1 6 steps: 395 ordinal number appears 1 6 steps: 396 relation appears 1 6 steps: 397 set algebra appears 1 6 steps: 398 set-theoretic definability appears 1 6 steps: 399 Suslin scheme appears 1 6 steps: 400 situation appears 1 6 steps: 401 scene appears 3 6 steps: 402 partiality appears 1 6 steps: 425 term appears 1 6 steps: 427 Bliksem appears 2 6 steps: 428 Boyer-Moore theorem prover appears 2 6 steps: 429 SPASS appears 2 6 steps: 430 truth condition appears 1 6 steps: 431 truth definition appears 1 6 steps: 432 truth value appears 1 6 steps: 434 type shifting appears 2 6 steps: 438 verb appears 1 6 steps: 442 content word appears 1 6 steps: 447 part of speech appears 1 6 steps: 455 homomorphism appears 7 6 steps: 456 bounded homomorphism appears 6 6 steps: 457 modal model theory appears 1 6 steps: 459 disjoint union of models appears 6 6 steps: 460 bisimulation appears 6 6 steps: 461 generated submodel appears 6 6 steps: 462 model appears 7 6 steps: 463 valuation appears 9 6 steps: 464 finite model appears 9 6 steps: 465 tree model appears 9 6 steps: 466 image finite model appears 9 6 steps: 467 Hennessy-Milner theorem appears 2 6 steps: 468 bounded morphism appears 6 6 steps: 469 expressive power appears 6 6 steps: 470 standard translation appears 4 6 steps: 471 modal language appears 1 6 steps: 472 diamond appears 8 6 steps: 473 box appears 8 6 steps: 477 fragment appears 1 6 steps: 478 modal fragment appears 2 6 steps: 479 finite-variable fragment appears 2 6 steps: 480 guarded fragment appears 2 6 steps: 482 hypothetical reasoning appears 9 6 steps: 483 normalization appears 6 6 steps: 484 structural rules appears 1 6 steps: 486 frame (2) appears 1 6 steps: 487 frame constraints appears 5 6 steps: 488 modes appears 1 6 steps: 489 accessability relation appears 13 6 steps: 490 boolean operators appears 5 6 steps: 494 labelled deductive system appears 3 6 steps: 508 functional composition appears 3 6 steps: 509 functional application appears 3 6 steps: 512 S4 appears 1 6 steps: 513 Aristotle on quantification appears 8 6 steps: 514 Frege on quantification appears 8 6 steps: 516 bound variable appears 8 6 steps: 517 free variable appears 8 6 steps: 521 standard deontic logic appears 5 6 steps: 522 dyadic deontic logic appears 5 6 steps: 523 two-sorted deontic logic appears 5 6 steps - nodes 152 7 steps: 6 boolean algebra appears 1 7 steps: 8 lattice appears 1 7 steps: 10 relation algebra appears 1 7 steps: 13 categorical logic appears 1 7 steps: 14 cylindric algebra appears 1 7 steps: 15 Lukasiewicz algebra appears 1 7 steps: 16 polyadic algebra appears 1 7 steps: 17 post algebra appears 1 7 steps: 18 quantum logic appears 1 7 steps: 19 topos appears 1 7 steps: 29 anaphora resolution appears 1 7 steps: 30 antecedent of an anaphor appears 1 7 steps: 91 individual concept appears 3 7 steps: 108 entailment appears 3 7 steps: 139 determiner appears 1 7 steps: 149 intensional isomorphism appears 1 7 steps: 203 meaning relation appears 1 7 steps: 204 antonymy appears 3 7 steps: 205 hyponymy appears 3 7 steps: 206 paraphrase appears 3 7 steps: 207 synonymy appears 3 7 steps: 210 modal operator appears 1 7 steps: 215 Kripke semantics appears 1 7 steps: 250 mass noun appears 1 7 steps: 251 proper name appears 1 7 steps: 260 plural term appears 1 7 steps: 279 demonstrative appears 1 7 steps: 280 pronoun resolution appears 1 7 steps: 300 quantifying in appears 1 7 steps: 301 scope appears 1 7 steps: 344 hyper resolution appears 3 7 steps: 345 lock resolution appears 3 7 steps: 346 set of support appears 3 7 steps: 347 theory resolution appears 3 7 steps: 351 scoping algorithm appears 6 7 steps: 374 literal meaning appears 1 7 steps: 375 metaphor appears 1 7 steps: 376 metonymy appears 1 7 steps: 401 scene appears 1 7 steps: 426 singular term appears 1 7 steps: 439 perception verb appears 1 7 steps: 441 modifier appears 1 7 steps: 455 homomorphism appears 1 7 steps: 456 bounded homomorphism appears 7 7 steps: 459 disjoint union of models appears 1 7 steps: 460 bisimulation appears 1 7 steps: 461 generated submodel appears 1 7 steps: 462 model appears 1 7 steps: 463 valuation appears 7 7 steps: 464 finite model appears 7 7 steps: 465 tree model appears 7 7 steps: 466 image finite model appears 7 7 steps: 467 Hennessy-Milner theorem appears 9 7 steps: 468 bounded morphism appears 7 7 steps: 469 expressive power appears 1 7 steps: 470 standard translation appears 8 7 steps: 472 diamond appears 6 7 steps: 473 box appears 6 7 steps: 478 modal fragment appears 1 7 steps: 479 finite-variable fragment appears 1 7 steps: 480 guarded fragment appears 1 7 steps: 482 hypothetical reasoning appears 4 7 steps: 483 normalization appears 3 7 steps: 487 frame constraints appears 1 7 steps: 489 accessability relation appears 7 7 steps: 490 boolean operators appears 1 7 steps: 508 functional composition appears 1 7 steps: 509 functional application appears 1 7 steps: 513 Aristotle on quantification appears 1 7 steps: 514 Frege on quantification appears 1 7 steps: 516 bound variable appears 1 7 steps: 517 free variable appears 1 7 steps: 521 standard deontic logic appears 1 7 steps: 522 dyadic deontic logic appears 1 7 steps: 523 two-sorted deontic logic appears 1 7 steps - nodes 75 8 steps: 7 boolean algebra with operators appears 1 8 steps: 108 entailment appears 1 8 steps: 149 intensional isomorphism appears 3 8 steps: 204 antonymy appears 1 8 steps: 205 hyponymy appears 1 8 steps: 206 paraphrase appears 1 8 steps: 207 synonymy appears 1 8 steps: 261 collective reading appears 1 8 steps: 262 distributive reading appears 1 8 steps: 351 scoping algorithm appears 1 8 steps: 445 adjective appears 1 8 steps: 456 bounded homomorphism appears 1 8 steps: 463 valuation appears 1 8 steps: 464 finite model appears 1 8 steps: 465 tree model appears 1 8 steps: 466 image finite model appears 1 8 steps: 467 Hennessy-Milner theorem appears 7 8 steps: 468 bounded morphism appears 1 8 steps: 470 standard translation appears 2 8 steps: 472 diamond appears 1 8 steps: 473 box appears 1 8 steps: 489 accessability relation appears 1 8 steps - nodes 22 9 steps: 1 adverbial modification appears 1 9 steps: 2 graded adjective appears 1 9 steps: 3 intersective adjective appears 1 9 steps: 4 predicative position appears 1 9 steps: 149 intensional isomorphism appears 1 9 steps: 467 Hennessy-Milner theorem appears 1 9 steps - nodes 6 - 960

36. SUO: Re: Foundation Ontology
The Foundation Ontology essentially represents Settheoretic classes See McLarty s suggestion to use Benabou s theory of fibrations and definability
http://grouper.ieee.org/groups/suo/email/msg05108.html
Thread Links Date Links Thread Prev Thread Next Thread Index Date Prev ... Date Index
SUO: Re: Foundation Ontology
http://suo.ieee.org/ontology/msg02399.html http://suo.ieee.org/ontology/msg02381.html http://www.risc.uni-linz.ac.at/research/category/risc/catlist/goedel-cat ... http://www.ontologos.org/IFF/Metalevel/Foundation%20Ontology.pdf

37. Pointclass - Wikipedia, The Free Encyclopedia
Strong Settheoretic principles may be stated in terms of the determinacy In that sense, membership in a boldface pointclass is a definability property,
http://en.wikipedia.org/wiki/Pointclass
var wgNotice = ""; var wgNoticeLocal = ""; var wgNoticeLang = "en"; var wgNoticeProject = "wikipedia";
Pointclass
From Wikipedia, the free encyclopedia
Jump to: navigation search In the mathematical field of descriptive set theory , a pointclass is a collection of sets of points , where a point is ordinarily understood to be an element of some perfect Polish space . In practice, a pointclass is usually characterized by some sort of definability property ; for example, the collection of all open sets in some fixed collection of Polish spaces is a pointclass. (An open set may be seen as in some sense definable because it cannot be a purely arbitrary collection of points; for any point in the set, all points sufficiently close to that point must also be in the set.) Pointclasses find application in formulating many important principles and theorems from set theory and real analysis . Strong set-theoretic principles may be stated in terms of the determinacy of various pointclasses, which in turn implies that sets in those pointclasses (or sometimes larger ones) have regularity properties such as Lebesgue measurability (and indeed universal measurability ), the

38. 97-05: On Linear Ordering Finitely-branching Graphs And Non-well-founded Sets
definability of a linear order in finite structures of some given class by of computable Settheoretic operations by some bounded set-theory (BST)
http://dimacs.rutgers.edu/TechnicalReports/abstracts/1997/97-05.html
DIMACS TR: 97-05
On linear ordering finitely-branching graphs and non-well-founded sets
Authors: Alexei Lisitsa and Vladimir Sazonov
ABSTRACT
We propose two different definitions of linear ordering, one of which is an application of the method of A.Dawar, S.Lindell and S.Weinstein to the case of SE graphs and give a comparison of both approaches in terms of coherence of the orders on different graphs. Cf. also related papers in ftp://ftp.botik.ru/rented/logic/papers/ http://www.botik.ru/PSI/AIReC/logic/ Both authors from Program Systems Institute of Russian Acad. of Sci., Pereslavl-Zalessky, 152140, Russia. e-mail: sazonov@logic.botik.ru lisitsa@logic.botik.ru phones: +7-08535-98945 and 98942, fax: +7-08535-20566. Supported by RBRF (project 96-01-01717). The work on this paper was started when the second author visited Princeton and Rutgers Universities (DIMACS) in 1996.
Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1997/97-05.ps.gz DIMACS Home Page

39. JSTOR Mathematics As A Science Of Patterns Ontology And Reference
sIf second order or set theoretic definability is used, then a theory of types must be observed so that no set theoretic or higher order entities are added
http://links.jstor.org/sici?sici=0029-4624(198111)15:4<529:MAASOP>2.0.CO;2-M

40. FOM: 6:Undefinability/Nonstandard Models
QUESTION What is the set theoretic (definability) status of full models of PA? We conjecture that this is weak enough so that we can construct one
http://cs.nyu.edu/pipermail/fom/1997-November/000278.html
FOM: 6:Undefinability/Nonstandard Models
Harvey Friedman friedman at math.ohio-state.edu
Sat Nov 15 18:04:51 EST 1997 This is the sixth in a series of positive self contained postings to fom covering a wide range of topics in f.o.m. Previous ones are: 1:Foundational Completeness 11/3/97, 10:13AM, 10:26AM. 2:Axioms 11/6/97. 3:Simplicity 11/14/97 10:10AM. 4:Simplicity 11/14/97 4:25PM 5:Constructions 11/15/97 5:24PM Let me remind you that a complete archiving of fom, message by message, is available at http://www.math.psu.edu/simpson/fom/index.html More information about the FOM mailing list

41. PhD
J. Vaananen Set theoretic definability of logics. In Handbook of Model Theoretic Logics (eds J. Barwise and S. Feferman), SpringerVerlag, 1985.
http://phil.elte.hu/logic/english/phd.html
Logic Postgraduate School Budapest
CURRICULUM
I. General outline

II. List of course titles
Introductory (preliminary) courses
Introduction to Universal Algebra Classical Extensional Logic
Central courses:
Classical Logic Set Theory Modal Logic Model Theory Algebraic Logic Metalogic Intensional logic Logic and Natural Language, Formal Semantics
Further recommended courses:
Logics of programs
Tarski and Trends in 20th Century Philosophical Logic (History of Logic) Chapters from Philosophical Logic (cf. Handbook of Phil. Log.) Temporal logic and related subjects Boolean Algebras with Operators (connections with Kripke style semantics for nonclassical logics) History of Logic L-IV. Philosophy of foundations of mathematics, main direction Peano Arithmetic Artifacts in logic Logic and Cosmology Theories of Partial Semantics Category Theoretic Approaches to Algebraic Logic Category theory (introduction, foundations, connections with varieties, quasivarieties, free algebras etc.) III. Course descriptions

42. Publications Of Jouko Väänänen
Set theoretic definability of logics. In J.Barwise and S.Feferman, editors, Model Theoretic Logics, pages 599643, Springer, 1985.
http://www.math.helsinki.fi/logic/people/jouko.vaananen/jvaaALL.html
  • Some remarks on pseudocompact spaces. Ann. Acad. Sci. Fenn. Ser. A I Math 559 pp. 11, 1973
  • Remarks on generalized quantifiers and second-order logics. In Set theory and hierarchy theory , Prace Naukowe Instytutu Matematyki Politechniki Wroclawskiej, Wroclaw, vol. 14 (1977), pages 117-123.
  • Remarks on free quantifier variables, In J.Hintikka, I.Niiniluoto and E.Saarinen, editors, Essays on mathematical and philosophical logic pages 267-272, Reidel, 1978.
  • Two axioms of set theory with applications to logic. Ann. Acad. Sci. Fenn. Ser. A I. Math. Diss.
  • Abstract logic and set theory, I: Definability. In M.Boffa, D.van Dalen and K.McAloon, editors, Logic Colloquium '78 , pages 391-421, North-Holland, 1979.
  • On the Hanf numbers of unbounded logics. In F.Jensen, B.Mayoh and K.Moller, editors, Proceedings from 5th Scandinavian Logic Symposium , pages 309-328, Aalborg University Press, 1979.
  • Archimedes
  • Boolean valued models and generalized quantifiers, Annals of Mathematical Logic , 79, pages 193-225, 1980.
  • On the axiomatisability of the notion of an automorphism of a finite order, with Dionysis Anapolitanos.
  • 43. MathNet-Mathematical Subject Classification
    03E45, Constructibility, ordinal definability, and related notions. 03E47, Other notions of set theoretic definability
    http://basilo.kaist.ac.kr/API/?MIval=research_msc_1991_out&class=03-XX

    44. Definability Of Initial Segments
    We consider implicit definability of the standard part {0,1,. To construct such a model, first we assume a set theoretic hypothesis
    http://nsdl.org/resource/2200/20061006041150854T
    Skip to Main Content Skip to Footer Links This resource was selected by the National Science Digital Library. Search for more NSDL resources Return to top of the page View this resource in its own window View more information about this resource This resource is found in the following collection(s). Click on the collection logo for more information. Close this window
    Collection Name: arXiv.org e-Print archive Collection Description: ArXiv.org, the major e-Print archive in the areas of physics, computer science, mathematics and related disciplines, makes available online research articles in relevant disciplines prior to print publication. Articles are submitted by their authors, and are then available freely, in various formats. Subject(s):
    Computer scienceCollections
    PhysicsCollections
    MathematicsCollections
    Physics
    Mathematics
    Applied mathematics
    Science
    Computer science
    Collection Information: Title arXiv.org e-Print archive Author Ginsparg, Paul Subject Keyword(s) Computer scienceCollections PhysicsCollections MathematicsCollections Physics Mathematics Applied mathematics Science Computer science Description ArXiv.org, the major e-Print archive in the areas of physics, computer science, mathematics and related disciplines, makes available online research articles in relevant disciplines prior to print publication. Articles are submitted by their authors, and are then available freely, in various formats.

    45. LINGUISTIX&LOGIK, Tony Marmo's Blog
    The paper is concerned with the question of definability of Our methods are mainly model?theoretic and set?theoretic, and they admit extension to richer
    http://tonymarmo.tripod.com/linguistix-logik/index.blog?topic_id=13046

    46. Bertrand Russell And The Paradoxes Of Set Theory | Science And Its Times: 1900-1
    Logical paradoxes are generally of two kinds set theoretic and semantic. and the GrellingNelson, raise questions of truth, definability, and language.
    http://www.bookrags.com/research/bertrand-russell-and-the-paradoxes--scit-06123/
    Literature Guides Criticism/Essays Biographies Research Anything: All BookRags Literature Guides Essays Criticism Biographies Encyclopedias History Encyclopedias Films Periodic Table ...
    Search "Bertrand Russell and the Paradoxes of Set Theory"
    Contents Navigation Get Religion and Science from ... Amazon.com
    Bertrand Russell and the Paradoxes of Set Theory
    About 4 pages (1,167 words) Bertrand Russell Summary
    Bertrand Russell and the Paradoxes of Set Theory Overview Background At about the same time in the 1870s, Georg Cantor (1845-1918) developed set theory and Gottlob Frege (1848-1925) developed mathematical logic. These two strains of theory soon became closely intertwined. Cantor recognized from the beginning that set theory was replete with paradoxes. He, along with other mathematicians and logicians or philosophers of mathematics such as Bertrand Russell (1872-1970), Alfred North Whitehead (1861-1947), and Edmund Husserl (1859-1938), tried to resolve these difficulties. In 1901 Russell discovered the paradox that the set of all sets that are not members of themselves cannot exist. Such a set would be a member of itself if and only if it were not a member of itself. This paradox is based on the fact that some sets are members of themselves and some are not.

    47. Re: Cantor Confusion
    according to a rule in a sense which implies computation, definability . Z set theory statements and proofs of Cantor s the set theoretic definition
    http://sci.tech-archive.net/Archive/sci.math/2007-05/msg01259.html
    Re: Cantor Confusion
    • From Date : 8 May 2007 06:07:52 -0700

    wrote:
    Carsten Schultz wrote:
    WM schrieb:
    That is a very common NON-formal definition and notion of function
    found in a great amount of mathematics. However, it is NOT the set
    theoretic defintion that is being used in formal Z set theory and is
    NOT the definition that is used in formal Z set theory to prove
    Cantor's theorem that there is no function from a set onto its power
    set.
    It is a definition from a book on set theory, called "Introduction to Set Theory". So it gives basic set theory. It may very well be a very naive set theory for non-mathematicians. Who wrote it, and for what sort of students is it supposed to be an introduction? Karel Hrbacek and Thomas Jech: "Introduction to Set Theory" Marcel Dekker Inc., New York, 1984, 2nd edition. 250 pages. For students of set theory. Now please, before we rush to look it up: I guess that everyone here agrees that a function is a special kind of relation, where a relation is a subset of a cartesian product of two sets. What is debated is that

    48. Front: [math.LO/0104277] Definability Of Initial Segments
    Abstract We consider implicit definability of the standard part {0,1,. To construct such a model, first we assume a set theoretic hypothesis
    http://front.math.ucdavis.edu/0104.5277
    Front for the arXiv Mon, 24 Dec 2007
    Front
    math LO math.LO/0104277 search register submit
    journals
    ... iFAQ math.LO/0104277 Title: Definability of initial segments
    Authors: Saharon Shelah , Akito Tsuboi
    Categories: math.LO Logic
    Report number: Shelah [ShTs:767]
    Abstract:
    Owner:
    Saharon Shelah's Office
    Version 1: Sat, 28 Apr 2001 17:00:41 GMT
    - for questions or comments about the Front
    arXiv contact page
    - for questions about downloading and submitting e-prints

    49. Academia.edu | Papers By Harvey Friedman
    difference between overtly set theoretic statements like the continuum hypothesis Limited Formulas, Limited Indiscernibles, x definability, Normal Form.
    http://philosophy.academia.edu/categories/1/papers/460;owner?page=2&tracker_id=6

    50. Δ
    Two versions of a set theoretic language are considered as theoretical by some new partial result on definability of a linear ordering over finite
    http://portal.acm.org/citation.cfm?id=590427.590467

    Page 1     1-57 of 57    1