Geometry.net Online Store

1. 03Cxx 03C10 Quantifier elimination, model completeness and related topics; 03C13 Finite structures See also 68Q15, 68Q19; 03C15 Denumerable structures http://www.ams.org/msc/03Cxx.html

Home MathSciNet Journals Books ... Contact Us 201 Charles Street Providence, RI 02904 USA Phone: 401-455-4000 or 800-321-4AMS Or email us at ams@ams.org Open Positions Model theory 03C05 Equational classes, universal algebra [See also 03C07 Basic properties of first-order languages and structures 03C10 Quantifier elimination, model completeness and related topics 03C13 Finite structures [See also 03C15 Denumerable structures 03C20 Ultraproducts and related constructions 03C25 Model-theoretic forcing 03C30 Other model constructions 03C35 Categoricity and completeness of theories 03C40 Interpolation, preservation, definability 03C45 Classification theory, stability and related concepts 03C50 Models with special properties (saturated, rigid, etc.) 03C52 Properties of classes of models 03C55 Set-theoretic model theory 03C57 Effective and recursion-theoretic model theory [See also 03C60 Model-theoretic algebra [See also 03C62 Models of arithmetic and set theory [See also 03C64 Model theory of ordered structures; o-minimality 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 [See also 03C85 Second- and higher-order model theory 03C90 Nonclassical models (Boolean-valued, sheaf, etc.)

2. Mhb03.htm 03C15, Denumerable structures. 03C20, Ultraproducts and related constructions. 03C25, Modeltheoretic forcing. 03C30, Other model constructions http://www.mi.imati.cnr.it/~alberto/mhb03.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 Mechanization of proofs and logical operations [See also Combinatory logic and lambda-calculus [See also Logic of knowledge and belief Temporal logic ; for temporal logic, see ; for provability logic, see also Probability and inductive logic [See also Many-valued logic Fuzzy logic; logic of vagueness [See also Logics admitting inconsistency (paraconsistent logics, discussive logics, etc.)

3. List KWIC DDC22 510 And MSC+ZDM E-N Lexical Connection Denumerable structures 03C15 dependence integral 13B21 dependence and continuation of solutions initial value problems, existence, uniqueness, http://www.math.unipd.it/~biblio/kwic/msc-cdd/dml2_11_13.htm

curriculum development # goals of mathematics teaching. curriculum guides, official documents # syllabuses. curriculum materials, effective teaching, etc.) # teaching and curriculum (innovations, teaching practices, studies of curvature # minimal surfaces, surfaces with prescribed mean curvature manifolds # negative curvature manifolds # positive curvature restrictions # methods of Riemannian geometry, including PDE methods; curvature, tight, etc.) # immersions (minimal, prescribed curve fitting # smoothing, curve sketching, extremum problems) # differential calculus (e.g.: curved groups # hyperbolic groups and nonpositively curved space backgrounds # quantum field theory on curves curves curves # directly differentiable curves # elliptic curves # geometry of orders of nondifferentiable curves # plane and space curves # pseudoholomorphic curves and curves of low genus # special curves and surfaces on projective and affine planes curves and surfaces) # computer aided design (modeling of curves and their moduli # vector bundles on curves in Euclidean space curves of low genus # special curves and curves over finite and local fields curves over global fields # elliptic curves over local fields # elliptic curves) # convex sets in $2$ dimensions (including convex curves, singular points, limit cycles # location of integral

4. Sachgebiete Der AMS-Klassifikation: 00-09 properties of firstorder languages and structures 03C10 Quantifier elimination and related topics 03C13 Finite structures 03C15 Denumerable structures http://www.math.fu-berlin.de/litrech/Class/ams-00-09.html

Sachgebiete der AMS-Klassifikation: 00-09 nach 90-99 Weiter nach 10-19 Suche in allen Klassifikationen 01-XX 03-XX 04-XX 05-XX 06-XX 08-XX nach 90-99 Weiter nach 10-19 Suche in allen Klassifikationen

5. Wikipedia:WikiProject Mathematics/PlanetMath Exchange/03-XX Mathematical Logic A PM proof of homomorphic image of a \Sigmastructure is a \Sigma-structure, id=4489 WP edit 03C15 Denumerable structures. Needs to be merged 1. http://en.wikipedia.org/wiki/Wikipedia:WikiProject_Mathematics/PlanetMath_Exchan

var wgNotice = ""; var wgNoticeLocal = ""; var wgNoticeLang = "en"; var wgNoticeProject = "wikipedia"; Wikipedia:WikiProject Mathematics/PlanetMath Exchange/03-XX Mathematical logic and foundations From Wikipedia, the free encyclopedia Wikipedia:WikiProject Mathematics PlanetMath Exchange Jump to: navigation search This page provides a list of all articles available at PlanetMath in the following topic: 03-XX Mathematical logic and foundations This list will be periodically updated. Each entry in the list has three fields: PM WP Status status entries are: Status means PM article N not needed A adequately covered C copied M merged NC needs copying NM needs merging Please update the WP and Status fields as appropriate. if the WP field is correct please remove the qualifier "guess". If the corresponding Wikipedia article exists, but the link to it is wrong, please fix the link. If you copy or merge an article from PlanetMath, please update the WP and Status fields for that entry. If you have any comments, for example, thoughts on how the PlanetMath article compares to the corresponding Wikipedia article(s), please place such comments on a new indented line following the entry. Comments of this kind are very valuable. Don't forget to include the relevant template if you copy over text or feel like an external link is warranted See the main page for examples and usage criteria.

6. HeiDOK 03C15 Denumerable structures ( 0 Dok. ) 03C20 Ultraproducts and related constructions ( 0 Dok. ) 03C25 Modeltheoretic forcing ( 0 Dok. http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03C&anzahl

7. WHAT ARE WEAK ARITHMETICS? They have also constructed some first order Denumerable structures modelling a version of PEANO Analysis to provide proofs within PEANO Arithmetic models or http://www.univ-paris12.fr/lacl/jaf/wa/wa.html

WHAT ARE WEAK ARITHMETICS? Patrick C EGIELSKI Denis R ICHARD Contents I. An attempt to define Weak Arithmetics from the Faibles Theme 1 : Construction of Nonstandard Models of first-order Arithmetics in order to investigate: 1) axiomatizations of subtheories of P EANO Arithmetic in which induction schemata are restricted to special subset of formulas; 2) complexities of the considered subtheories, especially for getting algorithms of polynomial time. Theme 2 : Definability and decidability of weak substructures of the Standard Model of P EANO Theme 3 : Abstract Machines, Automata and Words Other Themes a) Graphs, Spectra and RUD; b) Elementary proofs of classical Number Theory results, Arithmetical Proof Theory; c) Functional Programming and Recursivity; d) General Logic; e) Applied Algorithmics. II. An illustration of definability problem in Weak Arithmetics: the W OODS- E conjecture II-1 The Number Theoretical approach to WE II-2 Logical approach to WE Conclusion.

8. EULER Record Details , The authors characterize those Denumerable relational structures ${\germ A}$ with only finitely many binary relations that have only countably...... http://www.emis.de/projects/EULER/detail?ide=1991macpbinarelastru&matchno=39&mat

9. Denumerable And Induction Math Discrete Structures Subjects Math - Discrete structures - Posting 61007. Add to Shopping Cart. Math, Discrete structures. Year 3. Denumerable and Induction http://www.solutionlibrary.com/math/discrete_structures/61007

checkout view Your Cart: item(s) drawGSearch('','',''); advsrch_init(0,0); Subjects Math Discrete Structures Math, Discrete Structures Year 3 Denumerable and Induction 1. Show that if A and > are denumerable disjoint sets then A u > is denumerable 2. Show that every set of cardinalty c contains a denumerable subset 3. Show by induction that 6 divides n^3 - n for all n in N By OTA: Yupei Xiong, PhD OTA Rating: Your Price: (original value ~$11.97) What's included: Plain text response Page generated in 0.0316 seconds About Us Samples Solutions Legal Terms and Conditions var cart_count=0;;drawSysActivity("2,136","628");

10. General General Mathematics Mathematics For Nonmathematicians languages and structures Quantifier elimination, model completeness and related topics Finite structures See also 68Q15, 68Q19 Denumerable structures http://amf.openlib.org/2001/msc2000.xsd

11. Courses Set theory, including the concepts of mapping and Denumerable and non Denumerable sets. Study of abstract structures such as groups, rings fields and http://www.bridgeport.edu/pages/3624.asp

Home About UB Admissions Academics ... Mathematics Courses MATH 100: Elementary Algebra MATH C105: Intermediate Algebra MATH C105A: Intermediate Algebra MATH 106: Brief Calculus ... MATH 414: Numerical Analysis Math 100: Elementary Algebra An introductory course in basic algebra with applications. Topics include fundamental operations, fractions, real numbers, algebraic equations, linear equations and inequalities, exponents and polynomials, factoring and rational equations. This is a course for those students who are not ready for Math C105, Intermediate Algebra. This course is a three university semester hour course which means it does not meet distribution requirements or count toward the minimum semester hour requirement for graduation. This course is not open to those students who have passed the Math Placement Exam (Basic algebra exam) or passed Math C105 or above. 3 semester hours. Math C105: Intermediate Algebra A survey course in selected topics from college algebra and elementary functions. This course satisfies the core curriculum basic skills mathematics requirement. Topics include set notation, number systems, rules of algebra, operations with polynomials, factoring, linear equations and inequalities, solving polynomial equations, linear systems, and functions.

12. 91SUB.TEX Renamed Msc.new EDITED FOR SCREEN USE 11-28-90 % 11-29 03C13 Finite structures 03C15 Denumerable structures 03C20 Ultraproducts primitive rings and ideals 16D70 Structure and classification (except as http://www.math.uiuc.edu/documenta/AMS-MSC/MSC91

13. 1991 Mathematics Subject Classification (MSC 1991) 03C13 Finite structures; 03C15 Denumerable structures; 03C20 Ultraproducts and 20Exx Structure and classification of infinite or finite groups http://www.zblmath.fiz-karlsruhe.de/MATH/msc/msc91

1991 Mathematics Subject Classification (MSC 1991) 00-XX General Instructional exposition (textbooks, tutorial papers, etc.) Research exposition (monographs, survey articles) General and miscellaneous specific topics General mathematics Mathematics for nonmathematicians (engineering, social sciences, etc.) Problem books Recreational mathematics Bibliographies Dictionaries and other general reference works Formularies Methodology of mathematics, didactics Theory of mathematical modeling General methods of simulation Dimensional analysis Physics (use more specific entries from Sections 70 through 86 when possible) Miscellaneous topics Conference proceedings and collections of papers 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 01-XX General reference works (handbooks, dictionaries, bibliographies, etc.)

14. MathGuide - OPAC Subject Catalog 03C13 Finite structures; 03C15 Denumerable structures; 03C20 Ultraproducts and related 03D45 Theory of numerations, effectively presented structures 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

15. 362/369 (Total 5522) NO 107 03C20 Ultraproducts Translate this page 107, 03C20, Ultraproducts and related constructions. 106, 03C15, Denumerable structures. 105, 03C13, Finite structures See also 68Q15, 68Q19 http://www.mathnet.or.kr/mathnet/msc_list.php?mode=list&ftype=&fstr=&page=362

16. Mathematics Discrete Structures Homework Help Let (A, *) be an algebraic structure, and suppose that A is associative, Show that if A and are Denumerable disjoint sets then Au is Denumerable 2. http://www.brainmass.com/homework-help/math/discrete-structures/pg27

About Us Join BrainMass Sign In Post-A-Problem ... more... Mathematics Homework Solutions All Subjects Mathematics Discrete Structures Discrete mathematics (See attached file for full problem description) - Let R1 and R2 be relations on a set A. represented by the matrices: M R1 1 M R2 1 1 1 1 1 1 1 1 1 1 find the matrices that represent ( show all work) a) R1 union R2 b) R1 interse ...continues Posting ID: 59663 Add to Cart $2.19 Instant Download 4 Problems (See attached file for full problem description) - 1. Show that if A and B are countable and disjoint, then A B is countable. 2. Show that any set, A, of cardinality c contains a subset, B, that is denumerable. 3. Show that the irrational numbers have a cardinality c. 4. Show that if A is equivalent to B and C i ...continues Posting ID: 60252 Add to Cart $2.19 Instant Download 2 Problems Posting ID: 60254 Add to Cart $2.19 Instant Download 2 Problems ...continues Posting ID: 60256 Add to Cart $2.19 Instant Download

17. University Of Trento - Italy - UNITN-Eprints - The Principles Of Ambient Calculu focussing on the spatial structures of the processes they can describe. ambient processes having infinite nonDenumerable active actions due to a http://eprints.biblio.unitn.it/archive/00000750/

The principles of ambient calculus revisited Mardare, Radu and Priami, Corrado ) The principles of ambient calculus revisited. Technical Report DIT-05-018, Informatica e Telecomunicazioni, University of Trento. Full text available as: PDF - Requires Adobe Acrobat Reader or other PDF viewer. Abstract Keywords: ambient processes, hypersets, coalgebra, temporal logics Subjects: Q Science QA Mathematics QA075 Electronic computers. Computer science ID Code: Deposited By: DIT, Administrator Deposited On: 25 March 2005 Contact the site administrator at : eprints@biblio.unitn.it University Library System UNITN-eprints is running on EPrints2 archive-creating software, which generates eprints archives that are compliant with the Open Archives Protocol for Metadata Harvesting OAI 1.1 The eprints.org archive-creating software is available for free at http://www.eprints.org/

18. IngentaConnect Multiple-valued Logics Based On Hazy Structures that is to say that we can reduce the Denumerable or even continuum valued system or hazy structures for necessities and possibilities as relevant http://www.ingentaconnect.com/content/tandf/gmvl/2002/00000008/F0020005/art00003

var tcdacmd="dt"; Home About Ingenta Ingenta Labs Ingenta Blog ... Check our FAQs Or contact us to report problems with: Subscription access Article delivery Registration Library administrator tasks ... Other problems For Publishers Why go online? Why choose IngentaConnect? Beyond Print: enhancing your service Access and authentication ... Contact us For Researchers For Authors About IngentaConnect Search and browse Publications available ... Register For Librarians Resource Zone Why choose IngentaConnect? Why choose IngentaConnect Complete? Activating Subscriptions ... Register CM8ShowAd("HorizontalBanner"); Multiple-valued Logics Based on Hazy Structures Author: GHEZELAYAGHE M. Source: Multiple Valued Logic: An International Journal , Volume 8, Numbers 5-6, 1 January 2002 , pp. 659-672(14) Publisher: Taylor and Francis Ltd view table of contents Key: - Free Content - New Content - Subscribed Content - Free Trial Content CM8ShowAd("Skyscraper"); Abstract: We will use the notion of neighbourhood-spaces as the ranges of arbitrary hazy structures imposed on the set of truth values in a multiple-valued logic instead of a point-wise truth values. In light of this consideration, we can characterize and modify the indistinguishable formulas of the propositional or first order multiple-valued logics. Thus, any problem in any ordinary

19. UCL - Some Notions Of Mathematical Logic union, infinity, natural numbers object, induction, Denumerable sets and higher powers. Then we look at finitary algebraic structures and languages, http://www.uclouvain.be/en-cours-2008-mat1235.html

my office log on information about ... Study programme 2008-2009 Some notions of mathematical logic [30h + 15h] 5 cr©dits This course is taught in the 2d semester. Teacher(s): Language: French Level: First Aims Main themes Content and teaching methods Aims One aims at making explicit the laws of mathematical resoning, when it is presented as a formalised theory. One examines the peculiarities of the languages that are used, the propositions that are taken as starting points, the deduction rules that are usually admitted. One looks also at the limitations of the formalisation process, e.g. the impossibility to guarantee a definitive rigour. The spirit and the presentation are of the same kind as for any mathematical course : one gives definitions, one constructs chains of propositions, one proves theorems. Main themes We start recalling some basic concepts and axioms of set theory : extensionality, union, infinity, natural numbers object, induction, denumerable sets and higher powers. Then we look at finitary algebraic structures and languages, in the spirit of universal algebra, making use of homomorphisms and the universal property of the algebra of terms to treat in detail such topics as substitution. Propositional calculus follows, as the study of a particular algebraic structure, with the task of discovering all valid formulas. To reach that goal, one sets up a formal system, proving on one hand that it is sound (all provable formulas are valid) and on the other that it is complete (all valid formulas are provable).

20. Emerald: Article Request The third part will further present the structures predicted for exhibiting Denumerable additivity for any sequence of disjoint subsets (bn) of B, http://www.emeraldinsight.com/Insight/viewContentItem.do?contentType=Article&hdA

21. Cookies Required The BNL study focused on nuclear containment structures using the linear . The problem is therefore completely determined in terms of a Denumerable set http://link.aip.org/link/?JENMDT/128/66/1

22. Phys. Rev. B 61 (2000): A. L. Sukstanskii, E. P. Stefanovskii, S. A. Reshetnyak, In other words, we are dealing here with threeFS structures of the same type, . nbecomes meaningless on a Denumerable set of values of the angle c. http://link.aps.org/doi/10.1103/PhysRevB.61.8843

Physical Review Online Archive Physical Review Online Archive AMERICAN PHYSICAL SOCIETY Home Browse Search Members ... Help Abstract/title Author: Full Record: Full Text: Title: Abstract: Cited Author: Collaboration: Affiliation: PACS: Phys. Rev. Lett. Phys. Rev. A Phys. Rev. B Phys. Rev. C Phys. Rev. D Phys. Rev. E Phys. Rev. ST AB Phys. Rev. ST PER Rev. Mod. Phys. Phys. Rev. (Series I) Phys. Rev. Volume: Page/Article: MyArticles: View Collection Help (Click on the to add an article.) Phys. Rev. B 61, 8843 - 8850 (2000) Previous article Next article Issue 13 View PDF (113 kB) or Buy this Article Use Article Pack Export Citation: BibTeX EndNote (RIS) Modulated magnetic structure and spin waves in hexagonal CsCuCl -type antiferromagnets A. L. Sukstanskii Donetsk Physicotechnical Institute, Ukrainian Academy of Sciences, 340114 Donetsk, Ukraine E. P. Stefanovskii Department of Physics, Ben-Gurion University of the Negev, P.O.B. 653, Beer-Sheeva 84105, Israel S. A. Reshetnyak and V. N. Varyukhin Donetsk Physicotechnical Institute, Ukrainian Academy of Sciences, 340114 Donetsk, Ukraine Received 8 March 1999 A theory is developed for triangular helicoidal antiferromagnetic structures due to the relativistic-exchange inhomogeneous Dzyaloshinskii-Moriya interaction in hexagonal crystals. The magnetic structure observed in the CsCuCl

23. Powell's Books - Denumerable Markov Chains By John G. Kemeny This textbook provides a systematic treatment of Denumerable Markov chains Groups and Their Representations Metric structures in Differential Geometry http://www.powells.com/biblio?isbn=9780387901770

24. Awi Federgruen 9) The optimality equation in average cost Denumerable state semi Markov . 51) The joint replenishment problem with general joint cost structures http://www.gsb.columbia.edu/divisions/dro/federgru.html

Awi Federgruen Graduate School of Business 101 Uris Hall, mail code 9142 Columbia University New York, NY 10027 Telephone (212) 854-6084 e-mail: af7@columbia.edu PROFESSIONAL EXPERIENCE October 1992-: Charles E. Exley Professor in Management at the Graduate School of Business, Columbia University July 1986 -: Professor in Management Science and Operations Management, at the Graduate School of Business, Columbia University October 1987 - February 1988: Lady Davis Foundation Visiting Professor at Graduate School of Business, Hebrew University, Jerusalem. February- June 1988: Visiting Professor, Dept. of Statistics, Tel-Aviv University, Tel-Aviv. July 1981 - July 1986: Associate Professor in Management Science and Operations Management at the Graduate School of Business, Columbia University 1979 - July 1981: Assistant Professor in Management Science and Operations Management, Columbia University 1978 - June 1979: Assistant Professor in Operations Management and Operations Research at the Graduate School of Management, University of Rochester, N.Y. (on leave of absence from the Mathematisch Centrum, Amsterdam, Netherlands) 1975 - October 1978: Research Fellow, Mathematisch Centrum, Operations Research Department

25. Borcea: Moduli For Kodaira Surfaces realthreedimensional torus a Denumerable family indexed by the single torsion . We want to prove that q and v define isomorphic complex structures. http://www.numdam.org/numdam-bin/fitem?id=CM_1984__52_3_373_0

26. Catálogo - MSC 2000: 03C15 Translate this page 03C15 - Denumerable structures. Completo; Ficha MARC BibTeX. Se encontró este único registro. Libro. La reconstruction d une relation dans l hypothèse http://catalis.uns.edu.ar/cgi-bin/catalis_pack_demo_devel/wxis?IsisScript=opac/x

27. SUB Göttingen - Systematische Recherche Im Katalog Der SUB EADC 050, Equational classes, universal algebra. EADC 070, Basic properties of firstorder languages and structures EADC 150, Denumerable structures http://www.sub.uni-goettingen.de/scripts/gok/browse.php?gok=E&lang=de

28. Creation & Maya Presumably there exist a nonDenumerable infinity of such attractors and structures. Evolution is the random, stepwise selection of some finite sequence of http://mywebpages.comcast.net/dantsmith/nexu31.htm

[A brief summary appears at the end of the page.] I have previously broached the subject of Creation on several occasions. Here I hope to look at it particularly from the contrasting views of the prophetic and pantheist, or Eastern and Western , traditions. My second favorite Creation story is that of Vishnu dreaming up the world. This has always made a lot more sense to me than the various other creation stories that generally depict God as an artisan rather than as author or inventor. A typical example is the story in Genesis of God creating Adam out of clay. I recall that there are two separate creation stories in Genesis, and the one referenced is the second, and perhaps earlier one. But probably the most 'primitive' of known stories, and my all-time favorite , is from the Australian aborigines where there is simply a reference to the primordial 'dreamtime'. I don't recall that there was any specification of a particular dreamer. The implication is that it was all beings. This is even closer to my immaterialist, participatory view of the matter. Obviously I will need to brush up on my Creation stories, and I like to think that able assistance will be on the way, once Google wakes up and smells the BPW, but I may just be dreaming! Several things need remarking. Hinduism is generally regarded as atheistic, so the popular myth above that casts the Vishnu as Creator confirms the pluralist tolerance of the East. Nonetheless, it is peculiar how the contrasting stories of dreamer vs. artisan so clearly demarcate the monism and dualism of the East and West respectively. Hopefully we can eventually get a handle on which came first: the metaphysical ethos or the creation narratives. I wouldn't put is past the Creator to have planted the respective narrative seeds, just with the immanent

29. JSTOR Degrees Of Nonrecursive Presentability A Denumerable structure is said to be recursive (Xrecursive, r.e., H~, tt-reducible to X, etc.) if and only if its universe is a recursive (X-recursive, http://links.jstor.org/sici?sici=0002-9939(197305)38:3<621:DONP>2.0.CO;2-R

30. Quantum Field Theory, Quantum Topodynamics, Quantum Topology Functional space is Denumerable and measurable in contrast to Hilbert space. In this representation we have a quantum topological group structure with http://www.geocities.com/diahmed/reviews.html

Reviews of Articles on Quantum Topodynamics Quantum Dynamics of the Space " Washington, DC 2005. *Functional Integral Formalism of Quantum Topodynamics *The Quantum Set *The Quantum Topological Group *Quantum Toplogical Structures *Hilbert Ortholattice *The Quantum Processor Quantum theory demonstrated that the manifold and the dynamics are connected in such a mathematical manner that vectors and their duals are connected in the theory of functional spaces. "Quantum Topology" is an extension of the space-time manifold into a functional space that incorporates the quantum dynamics; the quantum space. The quantum manifold is expressed as an antilinear-bilinear form. Quantum space is the invariant arena where physical interactions are projected from. Theory of the Functional Space " Washington, DC 2005. *Functional Space *Inner Product and Global Properties of the Fundamental Set *Commutation Relations and Topological Structures Functional space is different from Hilbert space; it has global properties that Hilbert space does not have. The Dirac Quantum Field " Amsterdam 2001.

31. Tree Structure Of LoLaLi Concept Hierarchy Updated On 2004624 221 Denumerable structure . . . . 228 modeltheoretic algebra . . . . 236 second-order model theory . . . . 230 model of arithmetic . 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

32. FOM: Axioms Of Infinity: First-order Versus Higher-order Now take your favorite Denumerable structure (N, for example, or the simple type hierarchy over some a domain of individuals of SPECIFIED finite size). http://cs.nyu.edu/pipermail/fom/2000-July/004201.html

FOM: Axioms of Infinity: first-order versus higher-order Allen Hazen a.hazen at philosophy.unimelb.edu.au Tue Jul 25 06:39:51 EDT 2000 Previous message: FOM: Intuitionistic reals Next message: FOM: Brouwer, Constructivist/Intuitionist? Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Previous message: FOM: Intuitionistic reals Next message: FOM: Brouwer, Constructivist/Intuitionist? Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] ... More information about the FOM mailing list

33. CiteULike: Mathematical Structures Defined By Identities We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. http://www.citeulike.org/user/A_Olympia/article/1869107

Register Log in FAQ CiteULike News Discussion Journals Browse current issues Groups Search groups Profile Library Watchlist ... Import Mathematical Structures Defined by Identities Authors Petridi CM Krikelis PB Online Article arXiv (abstract): View article online arXiv (PDF): View article online Note: You or your institution must have access rights to this article. CiteULike will not help you view an online article which you aren't authorized to view. Copy-and-Pasteable Citation (31 Oct 2001) Citation format: Plain APA Chicago Elsevier Harvard MLA Nature Oxford Science Turabian Vancouver A_Olympia's tags for this article by defined identities mathematical ... title Other users who have posted this article julianjonker Everyone's tags for this article algebraic by defined identities ... title Abstract BibTeX Note: You may cite this page as: http://www.citeulike.org/user/A_Olympia/article/1869107 EndNote BibTeX A_Olympia's tags All tags in A_Olympia's library Filter: 4-dimensional aberration about absolute ... zitterbewegung CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

34. MSC 2000 : CC = T 0699 Order, lattices, ordered algebraic structures (not classified at a 22F50 Groups as automorphisms of other structures Nouveau code MSC 2000 http://portail.mathdoc.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=T

35. (IUCr) Crystallography Journals Online - Paper Details In the crystal structure, herein reported, the B,C nets are composed of fused five .. was anticipated by Wells (1954) as one of the Denumerable ways of http://dx.doi.org/10.1107/S0365110X65004061

Acta Crystallographica Volume 19, Part 4 (October 1965) research papers Acta Cryst. doi:10.1107/S0365110X65004061 The crystal structure of ScB C G. S. Smith Q. Johnson and P. C. Nordine bibliographic record in BIBTeX EndNote RefMan Refer Medline CIF SGML Plain Text format Find reference: Acta Cryst. Acta Cryst. A Acta Cryst. B Acta Cryst. C Acta Cryst. D Acta Cryst. E Acta Cryst. F J. Appl. Cryst. J. Synchrotron Rad. Volume Page Search: From to Advanced search IUCr Webmaster

36. 0 Top The TOP Concept In The Hierarchy. 1 Adverbial Modification 220 definability 221 Denumerable structure 222 equational class 223 finite structure 224 higherorder model theory 225 infinitary logic 226 interpolation http://staff.science.uva.nl/~caterina/LoLaLi/soft/ch-data/gloss.txt