Geometry.net Online Store

1. Forward And Reverse Waves In Nonclassical Models O...[J Acoust Soc Am. 2007] - P Wave propagation in such models is the same for both propagation directions, towards the apex and towards the base. Nonclassical models contain mechanical http://www.ncbi.nlm.nih.gov/sites/entrez?db=pubmed&uid=17550180&cmd=showdetailvi

2. Nonclassical Models For Logic Programs Nonclassical models for Logic Programs. Source, Lecture Notes In Computer Science archive Proceedings of the International Workshop on Processing http://portal.acm.org/citation.cfm?id=648111.748595

3. Plotnitsky - "Thinking Singularity With Immanuel Kant And Paul De Man: Aesthetic In Kant and Schiller, de Man speaks of the problem of the question of irreversibility, of the reversibility in the type of Nonclassical models which http://www.rc.umd.edu/praxis/deman/plotnitsky/plotnitsky.html

Legacies of Paul de Man Thinking Singularity with Immanuel Kant and Paul de Man: Aesthetics, Epistemology, History and Politics Arkady Plotnitsky, Purdue University article abstract about the author search volume Proceeding from Immanuel Kant's third Critique The Critique of Judgment , and Paul de Man's reading of Kant, this essay will discuss certain specific concepts, first, of singularity and, second, of the relationship between the individual and the collective, based on this concept of singularity. While emerging from Kant's analysis of aesthetics , this conceptuality entails a radical form of epistemology and, correlatively, a radical form of historicity. This conceptual and epistemological configuration, however, also translates into a political concept of community or, as I shall call it here, parliamentarity. As a result, aesthetics, epistemology, history, and politics become interconnected, and each becomes in turn conceptually refigured through these interconnections. The genealogy of the conceptuality and epistemology in question may itself be political in part, insofar as the actual practice of politics may have served, deliberately or not, as one of the models of this epistemology. On the other hand, Kant's analysis of the aesthetic expressly offers a model for this conceptuality and epistemology, or historicity, and establishes the aesthetic (in his sense) as the condition of possibility of their emergence and functioning in contexts other than the aesthetic.

4. AMS Online Journals - Influence Of Mean Zonal Motion And Classical and Nonclassical model calculations have been performed for . 36) in the .classical and Nonclassical models reveals the following features? http://ams.allenpress.com/perlserv/?request=get-document&doi=10.1175/1520-0469(1

5. Biophysical Journal -- Sign In Page A number of Nonclassical models have been proposed, each requiring a different source of longitudinal coupling to successfully replicate experimental http://www.biophysj.org/cgi/content/full/92/9/3284

HOME HELP FEEDBACK SUBSCRIPTIONS ... SEARCH This item requires a subscription to Biophysical Journal Online. Full Text Evidence for Outer Hair Cell Driven Oscillatory Fluid Flow in the Tunnel of Corti Karavitaki and Mountain Biophys. J.. To view this item, select one of the options below: Sign In User Name Sign in without cookies. Can't get past this page? Help with Cookies. Need to Activate? Password Forgot your user name or password? Purchase Short-Term Access Pay per Article - You may access this article (from the computer you are currently using) for 1 day for US$5.00 Regain Access - You can regain access to a recent Pay per Article purchase if your access period has not yet expired. Sign Up Subscribe to the Journal - Subscribe to the print and/or online journal. This Article Abstract Full Text (PDF) Supplemental ... Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Karavitaki, K. D.

6. Capital Theory: List Of Examples Example 1 Existence of an optimal maximin program; Example 2 Upcounting; Example 3 Nonclassical models; Example 4 Weak maximality and the cakeeating http://www.fiu.edu/~boydj/examples.html

List of Major Examples Home FIU Econ Publications Working Papers ... Book Preface Examples Our book contains over 80 major examples as well as numerous in-text examples. Chapter 1 Example 1: The Ramsey Problem Example 2: Endogenous Uncertain Lifetimes Example 3: The Rawls Maximin Utility Function Example 4: Majumdar's Example Example 5: The Cake-Eating Problem Example 6: A convex model of endogenous growth Example 7: Human capital and endogenous growth Chapter 2 Example 1: Equivalent metrics Example 2: l p spaces Example 3: The product topology on s m Example 4: Non-compact order interval Example 5: [0,1] is connected Example 6: Normed spaces Example 7: Convergence in s m Example 8: The dual of l is l Example 9: The dual of c is l Example 10: The dual of s m is c l Example 12: Banach limits Example 13: L duality trickery Chapter 3 Example 1: Continuity and TAS preferences Example 2: The maximin criterion Example 3: The overtaking criterion and the golden rule Example 4: Cake-eating and utility values Example 5: Long-run average criteria and Banach limits Example 6: Admissibility Example 7: The TAS extension problem Example 8: Banach limit utility and myopia Example 9: The KDW aggregator Example 11: Overtaking and recursive utility Chapter 4 Example 1: Existence of an optimal maximin program Example 2: Upcounting Example 3: Nonclassical models Example 4: Weak maximality and the cake-eating problem Example 5: Long-run average optimal paths Example 6: The von Neumann model With fixed labor supply Example 7: The neoclassical multisector model

7. 03Cxx 03C52 Properties of classes of models; 03C55 Settheoretic model theory 03B48; 03C85 Second- and higher-order model theory; 03C90 Nonclassical models 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.)

8. Program III3. Waves in continua III-4. Fracture and damage mechanics III-5. Structural mechanics III-6. Nonclassical models of solid mechanics http://congress2001.icmm.ru/eng/prog.htm

Congress contents General topics Section I. Theoretical and applied mechanics Section II. Fluid Mechanics Section III. Solid mechanics I-1. Analytical mechanics and dynamic [motion] stability I-2. Mechanical system optimization and control I-3. Vibrations of mechanical systems I-4. Mechanics of systems of rigid and deformable bodies I-5. Space flight mechanics I-6. Mechanics of machines and robots II-1. Theoretical and applied hydrodynamics II-2. Theoretical and applied gas dynamics II-3. Hydrodynamic instability and turbulence II-4. Physicochemical fluid dynamics II-4a. Combustion and detonation II-5. Hydrodynamics of multiphase media II-6. Hydromechanical problems in microgravity III-1. Elasticity and viscoelasticity theory III-2. Plasticity and creep theory III-3. Waves in continua III-4. Fracture and damage mechanics III-5. Structural mechanics III-6. Nonclassical models of solid mechanics Particular topics In the frame of the Congress four special sections will be organized: IV-1.

9. CURRICULUM VITAE 39 Nonclassical models of Damage Mechanics, (in Turkish, Klasik olmayan Modellerle Hasar ncelemesi),Turgan Sabis An s na, Symp., TÜ, Ayaza a,Yap Merkezi http://math.isikun.edu.tr/inan/index.htm

CURRICULUM VITAE Name Esin INAN Sex : Female Position : Full Professor (Isýk University , Faculty of Science and Letters, Department of Mathematics) Current Duties : Teaching and Research Birth Date : 16 August 1944, Place : Sürmene- TURKEY Address : Iþýk University, Faculty of art and Sciences Maslak 34398, Istanbul, Turkey Tel : 090 212 286 29 62 / 2154 (office), Fax E-mail : inan@isikun.edu.tr Schools Attended ÝTÜ, Faculty of Civil Engineering B.S. of Engineering Civil Engineering ÝTÜ, Faculty of Civil Engineering Master of Engineering Civil Engineering ÝTÜ, Faculty of Civil Engineering Ph.D. in Engineering Continuum Mechanics ÝTÜ, Faculty of Science and Letters Habitation in Engineering Continuum Mechanics Position Held 1) Graduate Assistant Tech.Univ. of IST. (ÝTÜ) Teaching and Research (Fac. of Civil Engineering) 2) Ass. Prof. Tech.Univ. of IST. (ÝTÜ) Teaching and Research (Fac. of Civil Engineering) 3)Research Ass. TÜBÝTAK (The Scientific and Technical Research Council of Turkey) Research (Part time) 4)Senior Research Associate University of Newcastle upon Tyne, U.K

10. Robert Becker models 5.2.3 Monotonicity and Turnpikes in TAS models Differential Approach Nonclassical models 5.2.4 Monotonicity and Turnpikes in Recursive models http://www.indiana.edu/~econweb/econeduc/beckerr.html

Robert A. Becker Capital Theory, Equilibrium Analysis and Recursive Utility Basil Blackwell Publishers, 1997 co-authored with John H. Boyd III ISBN: 1-557-86413-6 Presents a unified and systematic account of economic dynamics based on neoclassical growth theory. It emphasizes the rigorous construction of dynamic economic models, showing solutions exist and characterizing those solutions and their properties. It also examines the relationship between optimal growth and dynamic competitive equilibria. The book focuses on time consistent decision-making by using a general type of intertemporal objective, recursive utility. This allows an integrated treatment that develops the subject from its theoretical foundations to its applications in dynamic economic models. Numerous solved examples illustrate both the theory and its applications. Robert A. Becker and John H. Boyd III have synthesized their own published and unpublished work on recursive models with that of their students and numerous others. They provide extensive coverage of optimal growth (including endogenous growth), general equilibrium with infinitely many commodities, nonlinear dynamics for both optimal growth models and their equilibrium counterparts, and monotone comparative dynamics. Capital Theory, Equilibrium Analysis, and Recursive Utility

11. Mhb03.htm 03C85, Second and higher-order model theory. 03C90, Nonclassical models (Boolean-valued, sheaf, etc.) 03C95, Abstract model theory 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.)

12. Journal "Computational Technologies" Gorshkov V.V. The analysis of behaviour of multilayered conic shells on the basis of Nonclassical models // Computational technolgies. 2003. V. 8. http://www.ict.nsc.ru/jct/annotation/488?l=eng

13. MathNet-Mathematical Subject Classification 03C90, Nonclassical models (Booleanvalued, sheaf, etc.) 03C95, Abstract model theory. 03C99, None of the above, but in this section. 03Cxx, Model theory http://basilo.kaist.ac.kr/API/?MIval=research_msc_1991_out&class=03-XX

14. List KWIC DDC22 510 And MSC+ZDM E-N Lexical Connection Nonclassical and secondorder set theories 03E70 Nonclassical logic other 03B60 Nonclassical logic (nonstandard logic) 511.31 Nonclassical models http://www.math.unipd.it/~biblio/kwic/msc-cdd/dml2_11_38.htm

near-fields and near-algebras # representation by near-rings nearness spaces necessary conditions # methods based on necessary conditions (penalty function, etc.) # other methods, not based on necessary conditions and sufficient conditions for optimality negative $K$-theory, NK and Nil negative curvature manifolds neighborhood extensor, absolute extensor, absolute neighborhood retract (ANR), absolute retract spaces (general properties) # absolute neighborhood retract (ANR), absolute retract spaces (general properties) # absolute neighborhood extensor, absolute extensor, absolute neighborhood retracts # absolute neighborhoods # formal neighborhoods # regular neighborhoods of submanifolds neolithic # paleolithic, nest algebras, CSL algebras nests) of projections or of invariant subspaces, integrals along chains, etc. # chains ( nets # neural nets and related approaches # neural nets, etc.) # models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, partial spreads # finite partial geometries (general)

15. Nonparametric Identification And Estimation Of Nonclassical Errors-in-Variables Nonparametric Identification and Estimation of Nonclassical Errorsin-Variables models Without Additional Information. Author info Abstract Publisher http://ideas.repec.org/p/boc/bocoec/676.html

This file is part of IDEAS , which uses RePEc data Papers Articles Software Books ... Help! Nonparametric Identification and Estimation of Nonclassical Errors-in-Variables Models Without Additional Information Author info Abstract Publisher info Download info ... Statistics Author Info Xiaohong Chen (Yale University) Yingyao Hu (Johns Hopkins University) Arthur Lewbel liame2('edu','bc','m7i7','lewbel') ) (Boston College) Additional information is available for the following registered author(s): Arthur Lewbel Yingyao Hu Abstract Download Info To download: If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help file . Note that these files are not on the IDEAS site. Please be patient as the files may be large. File URL: http://fmwww.bc.edu/EC-P/WP676.pdf File Format: application/pdf File Function: main text Download Restriction: no Publisher Info Paper provided by Boston College Department of Economics in its series Boston College Working Papers in Economics with number 676.

16. Wikipedia:WikiProject Mathematics/PlanetMath Exchange/03-XX Mathematical Logic A edit 03C10 Quantifier elimination, model completeness and related topics edit 03C90 Nonclassical models (Booleanvalued, sheaf, etc.) 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.

17. Sachgebiete Der AMS-Klassifikation: 00-09 03C52 Properties of classes of models 03C55 Settheoretic model theory 03C57 and higher-order model theory 03C90 Nonclassical models (Boolean-valued, 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

18. HeiDOK 03C90 Nonclassical models (Booleanvalued, sheaf, etc.) ( 0 Dok. ) 03C95 Abstract model theory ( 0 Dok. ) 03C98 Applications of model theory ( 0 Dok. http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03C&anzahl

19. The Journal Of The American Society Of Anesthesiologists, Inc. - Anesthesiology Buerk DG, Saidel GM A comparison of two Nonclassical models for oxygen consumption in brain and liver tissue. Adv Exp Med Biol 1978; 9422532. http://www.anesthesiology.org/pt/re/anes/fulltext.00000542-199610000-00036.htm;j

LWWOnline LOGIN REGISTER CUSTOMER SUPPORT ... ASA Meeting Abstracts Cerebral Oxygenation during Deep... ARTICLE LINKS: References (5) View full-size inline images Anesthesiology Volume 85(4) October 1996 pp 940-941 Cerebral Oxygenation during Deep Hypothermic Cardiopulmonary Bypass: Is Hemoglobin Relevant? [Correspondence] Gunter, Joel B. MD Associate Professor of Clinical Anesthesia and Pediatrics, Department of Anesthesia, Children's Hospital Medical Center, 3333 Burnet Avenue, Cincinnati, OH 45229. To the Editor:I was fascinated by Dexter and Hindman's model of cerebral oxygen delivery. To examine the behavior of their model in more detail, I loaded the equations into a Hewlett Packard HP-48GX programmable calculator and examined their behavior under a variety of conditions, using the calculator's Equation Solverapplication. This examination led me to conclude that it is not the shift in P alone that is responsible for the change in the relation between SV O and CMR% (percentage of maximal CMRO ) seen with hypothermia, but rather the interaction between that shift and the relation between interstitial oxygen tension (PinO ) and CMR%. In brief, the target (or basal) CMR% determines the PinO

20. Nonparametric Identification And Estimation Of Nonclassical Errors-in-Variables Nonparametric Identification and Estimation of Nonclassical Errorsin-Variables models Without Additional Information. AUTHOR(S) http://escholarship.bc.edu/econ_papers/428/

A Digital Commons Project HOME ECONOMICS home ... Economics Department Working Papers in Economics Browse Contents Search Economics Dept. Website Policies TITLE: Nonparametric Identification and Estimation of Nonclassical Errors-in-Variables Models Without Additional Information AUTHOR(S): Xiaohong Chen, Yale University Yingyao Hu, Johns Hopkins University ... Boston College DOCUMENT TYPE: Article Download the Document (PDF format - 308 K) - July 2007 Tell a colleague about it. ABSTRACT: HOME SEARCH HELP MY ACCOUNT ... NOTIFY

21. Budapest Mind Society The two best developed are perhaps the higherorder thought (HOT) model of the classical model by contrasting it with Nonclassical models of emergence http://philosophy.elte.hu/bms/

About Upcoming Past Inaugural About The Budapest Mind Society aims to bring together researchers in Hungary with interests in philosophy of mind. The Society organises monthly talks and will sponsor reading groups to examine the latest monographs in philosophy of mind. Queries: contact András Simonyi at bms@philosophy.elte.hu Upcoming talks Past talks Professor Andrew Brook, Institute of Cognitive Science, Carleton University, Ottawa The representational base of consciousness ( doc ppt May 3, Tuesday, 2005, 5 PM, Dept. of Philosophy, CEU, Zrínyi utca 14, 4th floor, room 412. ABSTRACT: Everyone agrees, no matter what else they think about con­sciousness, that it has a representational base. However, there have been relatively few worked-out at­tempts to say what this base might be like. The two best developed are perhaps the higher-order thought (HOT) model of David Rosenthal and the transparency ap­proach of Fred Dretske and others. As we will show, both face serious problems. Our alternative to these models starts from the notion of a self-presenting representation, a representation that presents not only what it is about (if it is about anything; not all representations have an object) but also itself to the representing subject. Zsófia Zvolenszky, Philosophy, New York University, ELTE-MTA Philosophy of Language Research Group

22. Duality Models For Some Nonclassical Problems In The Calculus Of Variations Parametric and nonparametric necessary and sufficient optimality conditions are established for a class of nonconvex variational problems with generalized http://www.hindawi.com/GetArticle.aspx?doi=10.1155/S0161171203303370

23. Evidence For Outer Hair Cell Driven Oscillatory Fluid Flow In The Tunnel Of Cort If these (30,33) Nonclassical models are correct, then ToC oscillatory fluid flow is critical for cochlear amplification. SUPPLEMENTARY MATERIAL http://findarticles.com/p/articles/mi_qa3938/is_200705/ai_n19430588/pg_11

@import url(/css/us/pub_page_article.css); @import url(/css/us/template_503.css); @import url(/css/us/tabs_503.css); @import url(/css/us/fa_bnet.css); @import url(http://i.bnet.com/css/fa.css); BNET Research Center Find 10 Million Articles BNET.com Advanced Search Find in free and premium articles free articles only premium articles only this publication Arts Autos Business Health News Reference Sports Technology Explore Publications in: all Arts Autos Business ... Technology Content provided in partnership with FIND IN free and premium articles free articles only premium articles only this publication Arts Autos Business Health News Reference Sports Technology Advanced Search print share ... link Evidence for Outer Hair Cell Driven Oscillatory Fluid Flow in the Tunnel of Corti Biophysical Journal May 1, 2007 by Karavitaki, K Domenica Mountain, David C < Page 1 Continued from page 10. Previous Next Our experimental data demonstrate that the ToC can support oscillatory fluid flow along the length of the cochlea. The fact that OHC contractions lead to oscillatory fluid flow is not surprising. The novel aspect of our findings is that the fluid does not merely flow back and forth in the radial direction but also appears to have a significant component in the longitudinal direction through the ToC. Using a simple hydromechanical model of the ToC we have shown that a fluid wave in the ToC can travel without significant attenuation for distances larger than the wavelength of the BM traveling wave at its peak. Our findings suggest that OHC somatic motility produces oscillatory fluid flow in the ToC, which results in the long-range longitudinal coupling needed by nonclassical cochlear models. If these (30,33) nonclassical models are correct, then ToC oscillatory fluid flow is critical for cochlear amplification.

24. PDK 1991 171178 BibTeX Valentinas Kriauciukas Nonclassical models for Logic Programs. 179-190 BibTeX Egon Börger, Elvinia Riccobene Logical Operational http://www.informatik.uni-trier.de/~ley/db/conf/pdk/pdk91.html

PDK 1991: Kaiserslautern, Germany Harold Boley Michael M. Richter (Eds.): Processing Declarative Knowledge, International Workshop PDK'91, Kaiserslautern, Germany, July 1-3, 1991, Proceedings. Lecture Notes in Computer Science 567 Springer 1991, ISBN 3-540-55033-X BibTeX DBLP Invited and Special Talks Carlo Zaniolo : Efficient Processing of Declarative Rule-Based Languages for Datebases. 1-16 BibTeX Michel Dorochevsky Oliver Thibault : Has Dedicated Hardware for Prolog a Future? 17-31 BibTeX Chris Moss : Commercial Applications of Large Prolog Knowledge Bases. 32-40 BibTeX Concept Languages I Gerard Ellis : Compiling Conceptual Graphs. 41-55 BibTeX Mark Willems : Subsumption in Knowledge Graphs. 56-66 BibTeX Concept Languages II Franz Baader Bernhard Hollunder : A Terminological Knowledge Representation System with Complete Inference Algorithms. 67-86 BibTeX Herbert Jaeger : An Introduction to Dynamic Concept Systems. 87-106 BibTeX Maurizio Lenzerini Andrea Schaerf : Querying Concept-based Knowledge Bases. 107-123 BibTeX Concept Languages III Alessandro Artale Francesca Cesarini Giovanni Soda : Subsumption Computation on an Object-Oriented Data Model. 124-140

25. MSC 2000 : CC = Mod and higherorder model theory; 03C90 Nonclassical models (Boolean-valued, sheaf, etc. 03E40 Other aspects of forcing and Boolean-valued models http://math-doc.ujf-grenoble.fr/cgi-bin/msc2000.py?L=fr&T=Q&C=msc2000&CC=Mod

26. Phys. Rev. A 11 (1975): K. W. Sarkies And N. E. Frankel - Nonclassical Nucleatio Both classical Van der Waals and Nonclassical freeenergy-model results are given For the Nonclassical model, . - 2v is taken to be zero according to http://link.aps.org/doi/10.1103/PhysRevA.11.1724

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. A 11, 1724 - 1731 (1975) Previous article Next article Issue 5 View Page Images PDF (1167 kB), or Buy this Article Use Article Pack Export Citation: BibTeX EndNote (RIS) Nonclassical nucleation theory K. W. Sarkies and N. E. Frankel School of Physics, University of Melbourne, Parkville, Victoria, 3052 Australia Received 12 September 1974 Gibbs's theory of the formation of nuclei in the metastable phase of a two-phase system was reformulated by Cahn and Hilliard in order to eliminate Gibbs's condition that the nucleus be homogeneous up to a sharp boundary with the outside phase. This paper extends the Cahn-Hilliard theory of nucleation to systems having nonclassical Helmholtz free energies. The results of this study show that nucleation in the metastable region follows a completely different pattern than that predicted by Cahn and Hilliard. Most important is the extension of the range of stability of a fluid system close to its critical point. This is in contrast to the Cahn-Hilliard theory in which the region of stability becomes smaller and disappears as the critical point is approached. Recent experimental results of Huang, Vernon, and Wong give good agreement with our theory.

27. Livre Non Classical Logics And Their Applications To Fuzzy Subsets : A Handbook Nonclassical models and topos-like categories. Presheaves over GL-monoids. Quantales quantales sets. Categories of fuzzy sets with values in a quantale http://www.lavoisier.fr/notice/fr036216.html

Chercher sur Tous les supports Les Livres Les CD-Rom Les Logiciels Plus d'un million de titres à notre catalogue ! Notice Prix indicatif Auteur(s) : HOHLE Date de parution: 12-1994 Langue : ANGLAIS Hardback Commentaire Algebraic foundations of non-classical logics. Alpha-complete MV-algebras. On MV-algebras of continuous functions. Free and projective Heyting and monadic Heyting algebras. Commutative, residuated I-monoids. A proof of the completeness of the infinite-valued calculus of Lukasiewicz with one variable. Non-classical models and topos-like categories. Presheaves over GL-monoids. Quantales : quantales sets. Categories of fuzzy sets with values in a quantale or projectale. Fuzzy logic and categories of fuzzy sets. General aspects of non-classical logics. Prolog extensions to many-valued logics. Epistemological aspects of many-valued logics and fuzzy structures. Ultraproduct theorem and recursive properties of fuzzy logic. Sommaire Preface. Introduction. Part A: Algebraic Foundations of Non-Classical Logics. I.

28. Computational Philosophy: An Annotated Bibliography 1.2c Gödel’s Incompleteness Theorem; 1.2d Complexity Theory; 1.2e Computability Theory; 1.2f NonClassical models/Modes of Computation Analog Computing http://crumpled.com/cp/personal/cpbibliography.html

Computational Philosophy Bibliography (Left off: November 2001, Volume 11, Issue 4 Minds and Machines) Contents: Part 1: Philosophy of computation and information [] Part 2: Computational Philosophy [] Part 3: Philosophical Modeling [] Part 4: Formal Tools [] Part 5: Miscellaneous [] Part 1: Philosophy of computation and information [] 1.1: General 1.2: Computation 1.2a: Classical Models/Modes of Computation (including Automata, Turing Machines and Lambda Calculus) 1.2b: Church-Turing Thesis 1.2c: Gödel’s Incompleteness Theorem 1.2d: Complexity Theory 1.2e: Computability Theory 1.2f: Non-Classical Models/Modes of Computation: Analog Computing 1.2g: Non-Classical Models/Modes of Computation: Stochastic Computing 1.2h: Non-Classical Models/Modes of Computation: Distributed Computing (including Swarm Computing) 1.2i: Non-Classical Models/Modes of Computation: Evolutionary Computing 1.2j: Non-Classical Models/Modes of Computation: Molecular Computing

29. CMDS 11 New developments in continuum theory; non classical models, and discrete vs. continuum models. 6.Granular materials statics and dynamics http://cmm.ensmp.fr/~jeulin/CMDS11

CMDS 11 11th International Symposium on Continuum Models and Discrete Systems Paris (FRANCE), July 3 August Organisation: Centre de Morphologie Mathématique, Ecole des Mines de Paris Fondation des industries minérales, minières et métallurgique s françaises à l' Ecole des Mines de Paris (FIMMM) Last Update: 23 August 2007 Sponsors Commissariat à l'Energie Atomique (CEA) Home Home Background / History Topics Venue Picture Gallery ... ENSMP Background / History The previous Continuum Models and Discrete Systems Symposia of took place in Kielce (Poland, 1975), Mont Gabriel (Canada, 1977), Freudenstadt (Federal Republic of Germany, 1979), Stockholm (Sweden, 1981), Nottingham (United Kingdom, 1985), Dijon (France, 1989), Paderborn (Germany, 1992), Varna (Bulgaria, 1995), Istanbul (Turkey,1998) and Shoresh (Israel, 2003). The broad interdisciplinary character, the limited number of participants (not exceeding 100) and the unofficial and friendly atmosphere, made these meetings well-acknowledged places of highly fruitful contacts and exchange of ideas, methods and results. The purpose of CMDS is to bring together scientists with different backgrounds, working on continuum theories of discrete mechanical and thermodynamical systems in the fields of mathematics, theoretical and applied mechanics, physics, material science and engineering. The spirit of CMDS meetings is to stimulate an extensive and active interdisciplinary research.

30. Access To Articles : Nature Reviews Genetics Or should it eschew existing model species and their research assets in favour of more ecologically appropriate nonclassical models, even if these are less http://www.nature.com/nrg/journal/v4/n8/full/nrg1128.html

nature.com homepage Jump to main content Login ... Browse by subject Search All of nature.com Advanced search Access Most users gain access to full text articles through a site license. This is available to institutional customers only. For further information visit the Librarian Gateway. Full-text articles are also available through a number of other options: I want to purchase this article Register now Price: US$30 In order to purchase this article you must be a registered user. Register now I want to subscribe to Nature Reviews Genetics Select this option to purchase a personal subscription to Nature Reviews Genetics Subscribe now to Nature Reviews Genetics I am already a personal subscriber to Nature Reviews Genetics Personal subscribers to Nature Reviews Genetics can view this article. To do this, you need to associate your subscription with your registration via the My Account page. If you already have an active online subscription, login below to access your account. Enter your e-mail address and password to login to your nature.com

31. ScienceDirect - Journal Of Electroanalytical Chemistry : A Lattice-gas Model For To this end, we again follow two models for treating the metal electrolyte interface a classical model and an approximate nonclassical model derived by http://linkinghub.elsevier.com/retrieve/pii/S0022072897006487

Athens/Institution Login Not Registered? User Name: Password: Remember me on this computer Forgotten password? Home Browse My Settings ... Help Quick Search Title, abstract, keywords Author e.g. j s smith Journal/book title Volume Issue Page Journal of Electroanalytical Chemistry Volume 450, Issue 2 , 1 June 1998, Pages 189-201 Abstract Full Text + Links PDF (578 K) Related Articles in ScienceDirect Dynamics of Br electrosorption on single crystal Ag(100... Journal of Electroanalytical Chemistry Dynamics of Br electrosorption on single crystal Ag(100): a computational study Journal of Electroanalytical Chemistry Volume 493, Issues 1-2 10 November 2000 Pages 68-74 S. J. Mitchell, G. Brown and P. A. Rikvold Abstract We present dynamic Monte Carlo simulations of a lattice-gas model for bromine electrodeposition on single-crystal silver (100). This system undergoes a continuous phase transition between a disordered phase at low electrode potentials and a commensurate c c Abstract Full Text + Links PDF (121 K) Lattice ... Physica A: Statistical Mechanics and its Applications Lattice gas modeling of adsorption on nanotube bundles at criticality Physica A: Statistical Mechanics and its Applications Volume 355, Issues 2-4

32. Semiotics And Control Systems Significant progress now awaits the formulation of nonclassical models, such as might integrate both classical or ordinary reality and quantum reality http://www.beaugrande.com/SemioticsControlSystems.htm

Semiotics and control systems: Toward a non-classical model of communication Robert de Beaugrande Introduction The determinacy assumption between realism and formalism ‘We witness’, according to Anderson, Deely, Krampen, Ransdell, Sebeok, and Uexküll (1984: 18), ‘at every scale, “human” and quantum, similar behaviour in dynamical systems’, be they ‘material systems focusing on energy relations’ or ‘nonmaterial systems focusing on information relations’. However, this factor is so far not sufficiently represented in prevailing theories and models. As the same authorities remark (1984: 15), ‘semiotics has seldom dealt with dynamical systems as a whole; those non-linear, irreversible realities where energy explicitly fuses with information, such as experience, ontogeny, and phylogeny’. Instead, we see ‘the specialization of semiotics in systems seemingly unconstrained by energy relations’. Moreover, due to the endurance of ‘classical’ views of ‘science’, most prevailing conceptions of ‘infor­mation’ have been confined to reductive, non-dynamic, and deter­ministic modes. This state of affairs reflects antecedent dispositions about the relationship between sign processing (semiosis) and reality. Semiotic and linguistic models have classicalised

33. SSRN-Constructive And Classical Models For Results In Economics And Game Theory I discuss why nonclassical models may be of interest and also describe applications of model theory to economics in classical contexts, e.g. non-standard http://papers.ssrn.com/sol3/papers.cfm?abstract_id=551211

34. Publications M.Morzynski, K.Afanasiev, Control of 2D wake instability, Zastowanie nieklasycznych modeli materialow, (Application of Non-Classical models), http://www.wias-berlin.de/people/afanasie/publications.html

Publications E.W. Afanasiev, K.E. Afanasiev, Zentrifugalmuffe, die Erfindung der UdSSR, KL F16D 43/14, 1107, 1990, N. 4848188/27 E.W. Afanasiev, K.E. Afanasiev, Zentrifugalmuffe, Bulletin: Erfindungen und Entdeckungen der UdSSR, N28 (30.07.1992) Zeugnis N 17515355 M.Morzynski, K.Afanasiev, Control of 2-D wake instability, Zastowanie nieklasycznych modeli materialow, (Application of Non-Classical Models), TU Poznan 17-18 October 1996, pp. 139-144. M.Morzynski, K.Afanasiev, F.Thiele, Numerical investigation of 2-D wake stability and control problem, GAMM Jahrestagung, Prague, May 28-31, Z.Angew. Math.Mech. Vol.77,1997,Supplement 2, pp. 625-626. M.Morzynski, K.Afanasiev, F.Thiele, Solution of the eigenvalue problems resulting from global non-parallel flow stability analysis, Comp. Meth. App. Mech. Eng. 169 (1999), pp. 161-176. M.Morzynski, K.Afanasiev, M.Nowak, F.Thiele, Efficient Algorithm for Large Generalized Eigenvalue Problem Solution and Its application to Fluid Flow Stability, Colloquium Dynamics of Machines, Czech Commitee of the European Mechanics Society and Institute of Thermomechanics ASCR, Prague, February 9-10, 1999, pp. 149-154. M.Morzynski, M.Nowak, K.Afanasiev, Linear and Nonlinear Phenomena in the Unsteady Flow around Bluff Bodies, Colloquium Dynamics of Machines, Czech Commitee of the European Mechanics Society and Institute of Thermomechanics ASCR, Prague, February 9-10, 1999, pp. 155-160.

35. Golstein,P While a few classical animal models have helped greatly in this respect, more may be learnt from nonclassical model organisms from all eukaryotic kingdoms. http://lib.bioinfo.pl/auth:Golstein,P

PubMed Papers Reports Books Mesh-terms Authors Users username: password: Register Forgot password Login Register to comment articles, reports and participate in mesh term forums Register to monitor favorite articles, reports, mesh-terms, authors, users Register to publish reports in the BioInfoBank Library and become editor Register to create Your own user record to promote Your scientific activity recommending commenting favorite papers recom. cited Golstein P (P) Golstein P (Philippe) Golstein P (Pierre) Latest Paper: Mol Biol Cell. 2007 Dec 12; : 18077554 The IP3 Receptor Is Required to Signal Autophagic Cell Death. [My paper] David Lam Artemis Kosta Marie-Fran§oise Luciani Pierre Golstein Biochem Biophys Res Commun. 2007 Sep 17; : 17889831 Autophagic or necrotic cell death in the absence of caspase and bcl-2 family members. [My paper] David Lam Jean-Pierre Levraud Marie-Fran§oise Luciani Pierre Golstein How is one to investigate autophagic or necrotic cell death in the absence of interference from the apoptosis machinery? In the protist Dictyostelium, a model for the study of these two cell death types, we previously showed that autophagic cell death does not require paracaspase, the only caspase family member in this organism. In this report, we prepared two distinct paracaspase- atg1- double mutants, and we used them to demonstrate that paracaspase is not required for necrotic cell death either. Also, in silico investigation showed that the genome of Dictyostelium harbored no detectable member of the bcl-2 family and no single BH3 domain-bearing molecules. Altogether, in this model system both autophagic and necrotic cell death could occur, and could be investigated, with no interference from the two main molecular families involved in apoptosis, the caspase and the bcl-2 families.

36. People @ Glasgow Information Retrieval Group The Behavior of Computation of Information Retrieval models (i.e. Behaviorial Information retrieval by ostension, Quantum/nonclassical models of http://ir.dcs.gla.ac.uk/people.html

Text Only The Information Retrieval Group Home Research People Current Members ... LOCAL IR >> Search our site: powered by Labrador Current Members Leader Professor C.J. 'Keith' van Rijsbergen (keith at dcs.gla.ac.uk) Theoretical development of probabilistic and logic-based models, multimedia IR systems, information analysis and access across media, evaluation and usability of IR systems and data mining of large data sets of clinical information. Academic Staff Dr Leif Azzopardi (leif at dcs.gla.ac.uk) The Behavior of Computation of Information Retrieval models (i.e. Behaviorial Computing Science); The study and evaluation of Information Access Systems and their Usage; The development of Peer to Peer and Distributed Information Retrieval systems; Theoretical and Formal Models (in particular Language Models) for Information Retrieval. Dr Joemon Jose (jj at dcs.gla.ac.uk) Context sensitive information retrieval, adaptive information retrieval, personalised information retrieval, implicit feedback based search systems, interactive information retrieval, affective search systems, information retrieval over mobile devices, evaluation of information retrieval systems, multimedia information retrieval (image retrieval, video retrieval, video summarisation and browsing), architectures for information retrieval, peer to peer information retrieval.

37. JSTOR Project Scheduling Recent Models, Algorithms And Applications Part III of the book introduces new, nonclassical models. These include probabilistic models, fuzzy models, contin- uous resources, multi-criteria http://links.jstor.org/sici?sici=0160-5682(200105)52:5<602:PSRMAA>2.0.CO;2-E

38. Recent Papers: Thomson We study the implications for a simple public good model with single peaked preferences of a in classical models as well as in non-classical models, http://www.econ.rochester.edu/Faculty/Thomson_Papers.html

William L. Thomson Recent Papers and Publications William L. Thomson (1993), "The Replacement Principle in Public Good Economies with Single-Peaked Preferences," Economics Letters We study the implications for a simple public good model with single- peaked preferences of a "replacement principle". We apply the principle to situations where the preferences of one of the agents may change. Then, the principle results in a condition used by Moulin in the contex of binary public decision: as a consequence of the replacement, all other agents should be affected in the same direction; they all gain or they all lose. We characterize the family of efficient solutions satisfying the property. It is a subfamily of the family of strategyproof solutions introduced by Moulin under the name of "generalized Condorcet-winner solutions". Key-words : replacement principle, public decision, single-peaked preferences, generalized Condorcet solutions. William L. Thomson (1995) "Population-Monotonic Allocation Rules," in Social Choice, Welfare and Ethics

39. Whittaker And The Aether All of Einstein’s ideas that can be expressed in terms of “the aether” are cited generously, but his ideas involving nonclassical models of space and time http://www.mathpages.com/home/kmath571/kmath571.htm

Whittaker and the Aether aether . The novelty of Einstein’s interpretation was in the idea that the evident relativity of all physical phenomena transcended the properties or behavior of any substance (aether), and was instead a consequence of the structure of space and time. Whittaker was always unsympathetic to this interpretation, as is clear from his preface to the second edition: The whole change in the conception of the ether which the special theory of relativity brought about consisted in taking away from the ether its last mechanical quality This ether may not be thought of as endowed with the quality characteristic of ponderable media, as consisting of parts which may be tracked through time. The idea of motion may not be applied to it. with Whittaker’s conclusion of the chapter in Volume I on mechanical models of the aether (culminating in Kelvin’s vortex sponge Towards the close of the nineteenth century, chiefly under the influence of Larmor, it came to be generally recognised that the aether is an immaterial medium, sui generis, not composed of identifiable elements having definite locations in absolute space We see in these quotations a remarkable concordance in the conception of the aether (to the extent that we might wonder if one was influenced by the other), but a predictable disagreement as to the origin of this conception. Einstein says it was a consequence of special relativity (by which he presumably meant his own version of special relativity as described in his 1905 paper), whereas Whittaker attributes it to Larmor at the end of the nineteenth century, when, he says, “it came to be generally recognized”. However, it should noted that the paragraph in which Whittaker describes these 19th century developments does not appear in the 1910 version of the book. Instead, the chapter on Models of the Aether in the 1910 edition ended with the discussion of Kelvin’s vortex sponge and Whittaker’s comment that “none [of the 19th century mechanical models]

40. Renate Bartsch, Conscsiousness Emerging: The Dynamics Of Perception, Imagination Readers looking for an exhaustive discussion of classical and nonclassical models of cognition may, for example, turn to Marcel and Bisiach (1988) for a http://www.cognitivelinguistics.org/Reviews/bartsch

International Cognitive Linguistics Association * When open a local search file in Internet Explorer on Windows XP SP 2, the content may be blocked. To open the file correctly, please click the Information Bar on the top of the browser window, and select "Allow Blocked Content". * There will not be such problem after you upload the file to a web server. * To display this page, you need a web browser with JavaScript support. Home : Book reviews : Bartsch Book review Consciousness Emerging Bartsch, Renate. 2002. Consciousness Emerging: The Dynamics of Perception, Imagination, Action, Memory, Thought and Language. (Advances in Consciousness Research 39.) Amsterdam/Philadelphia: John Benjamins Reviewed by Daniel Wiechmann, Department of British and American Studies, Friedrich Schiller University, Jena, Germany As its title already suggests, Consciousness Emerging: The Dynamics of Perception, Imagination, Action, Memory, Thought and Language , offers a large-scale point of view covering many phenomena of higher level cognition. In her attempt to explain how the brain brings about all these phenomena and how they are interrelated, the author draws from many sources in consciousness research: neuro-cognitive, cognitive psychological, philosophical, and linguistic. The main thesis of the book is that consciousness arises through an interaction between primary sensorial fields and conceptual maps in synchronized circuits of activation, called episodic maps . Bartsch argues convincingly not only for the view that the workings of neural networks in perception and understanding can bring about expressions in consciousness, but, more importantly, also how this can happen. Furthermore, exploring consciousness from a functional perspective, Bartsch provides the reader with an interesting account of "the hard problem", namely why certain oscillations in relevant cortical areas should be accompanied by consciousness, and hence goes beyond ideas presented for example in Crick and Koch (1990, 1992) and other neurobiological positions that aim at identifying neuronal correlates of consciousness.

41. Skip Navbar Home University Home About Us Open Days Courses Classical and nonclassical mechanical analogues. Non-classical physical interpretations, non-classical models, and non-classical mechanical analogues in http://www.cet.sunderland.ac.uk/webedit/allweb/news/Philosophy_of_Science/Brochu

Skip Navbar Home University Home About Us ... Printable Page Physical Interpretations of Relativity Theory X LONDON: 8th -11 SEPTEMBER, 2006 Physical Interpretations of Relativity Theory X British Society for the Philosophy of Science Physics Dept., Bauman Moscow State Technical University. Calcutta Mathematical Society. Imperial College, LONDON LONDON: 8th -11 SEPTEMBER, 2006 Brochure BRITISH SOCIETY FOR PHILOSOPHY OF SCIENCE C.A.T., UNIVERSITY OF SUNDERLAND "PHYSICAL INTERPRETATIONS OF RELATIVITY THEORY" Imperial College, London 8-11 September 2006 CONFERENCE BROCHURE CONTENTS GENERAL OBJECTIVES OF CONFERENCE p 3 ADDRESSES FOR ALL ENQUIRIES p 3 CONFERENCE WEB SITE ADDRESS p 4 MAJOR SECTIONS OF THE CONFERENCE PROGRAMME p 5 SUBJECTS TO EXAMINED IN CONFERENCE p 6 ORGANIZATION OF PROGRAMME TIMETABLE p 12 CONFERENCE LANGUAGES p 13 p 14 REGISTRATION FEES p 17 p 18 REGISTRATION FORM p 20 GENERAL INFORMATION The conference is sponsored by the British Society for Philosophy of Science, the Physics Department of the Bauman Moscow State Technical University, the Calcutta Mathematical Society and is sponsored and organised with the assistance and support of the School of Computing and Technology ( Prof. Peter Smith

42. Structural Dynamics And Structural Control Nonclassical models have been developed for capturing local effects of the controlled structures, including cross section warping modeling and fulfilment http://www.interdip.polito.it/aeronautica/ricerca/Dynamics_ST.htm

43. Luis Lamb Homepage Knowledge representation and reasoning temporal, knowledge, and nonclassical models and logics. Reasoning under uncertainty. http://www.inf.ufrgs.br/~lamb/

DIC, PhD Provisional Homepage Department of Computing Theory - Institute of Informatics UFRGS Research Interests Logic and Computation Non-classical reasoning; combination of logics; conditional logics; Labelled Deductive Systems ( LDS Applications of logics in computer science and artificial intelligence Natural Computing and Artificial Intelligence Neural computation: connectionist non-classical logics;cognitive learning and reasoning; machine learning. Knowledge representation and reasoning: temporal, knowledge, and non-classical models and logics. Reasoning under uncertainty. Formal methods formal methods in embedded systems. Additional information about my research, including a brief CV and recent publications Click here to see a photograph of myself I have recently co-authored this research monograph on non-classical logics: Compiled Labelled Deductive Systems: A Uniform Presentation of Non-Classical Logics (K. Broda, D. M. Gabbay, Luis C. Lamb, and A. Russo) ISBN 86380 296 6 Research Studies Press , Hertfordshire, England Institute of Physics Publishing, Philadelphia 2004 I have recently co-edited the following volumes: Table of contents, Vol. One

44. AMC KNO Audiologie : Voor 2002 “Cochlear models and minimum phase.” J. Acoust. Soc. Am. 102, 38103813. de Boer, E. (1997). “Classical and non-classical models of the cochlea.” http://www.acamc.nl/wetenschap/publicaties/artikelen/voor-2002.html

Home Patiënten Verwijzers Onderwijs ... Voordrachten Voor 2002 de Boer, E., and Nuttall, A. L. (2001). “Power gain of the ‘Cochlear Amplifier.” In: Physiological and psychological bases of auditory function, edited by D.J. Breebaart, A.J.M. Houtsma, A. Kohlrausch, V.F. Prijs, and R. Schoonhoven (Shaker, Maastricht), pp. 1-7. Comments pp. 7-8. de Boer, E. (2001). “The short-wave model and waves in two directions.” J. Acoust. Soc. Am. 109, 291-293. de Boer, E. and Nuttall, A. L. (2000). “The mechanical waveform of the basilar membrane. III. Intensity effects.” J. Acoust. Soc. Am. 107, 1497-1507. de Boer, E., and Nuttall, A. L. (2000). “The mechanical waveform of the basilar membrane. II. From data to models - and back.” J. Acoust. Soc. Am. 107, 1487-1496. de Boer, E., and Nuttall, A.L. (1999). “The "inverse problem" solved for a three-dimensional model of the cochlea. III. Brushing up the solution method.” J. Acoust. Soc. Am. 105, 3410-3420. de Boer, E. (1998). “A method for forward and inverse solutions of a 3-dimensional model of the cochlea.” J. Acoust. Soc. Am. 103, 3725-3728.

45. 901-938 Systems are further divided into “classical models”, where velocity components are commutable (an example being relativistic rotator), and “nonclassical http://ptp.ipap.jp/link?PTP/25/901

46. AMC KNO Audiologie : Homepage Of Egbert De Boer “Classical and nonclassical models of the cochlea.” J. Acoust. Soc. Am. 101, 2148-2150. de Boer, E. (1997), “Connecting frequency selectivity and http://www.ac-amc.nl/medewerkers/de-boer.html

Home Patiënten Verwijzers Onderwijs ... Research (EN) Homepage of Egbert de Boer Position Emeritus professor Research topics For an overview of the research topics Egbert de Boer has been and still is working on, see the biography of Egbert de Boer. Contact Publications Grosh, K., Zheng, J., de Boer, E., Nuttall, A. L. (2004), “High frequency electromotile responses in the cochlea.” J. Acoust. Soc. Am. 115, 2178-2184. Goodman, S S, Withnell, R. H., de Boer, E., Lilly, D. J., and Nuttall, A. L. (2004), “Cochlear delays measured with amplitude-modulated tone-burst evoked OAEs.” Hearing Res. 188, 57-69. Summers, V., de Boer, E., Nuttall, A. L. (2003), “Basilar-membrane response to multi-component (Schroeder-phase) signals: Understanding intensity effects.” J. Acoust. Soc. Am. 114, 294-306. de Boer, E., Nuttall, A. L., Hu, N., Zou, Y, and Zheng, J. (2005), “The Allen-Fahey experiment extended.” J. Acoust. Soc. Am. 117, 1260-1267. Nuttall, A. L., Grosh, K., Zheng, J., de Boer, E., Zou, Y., and Ren, T. (2004), “Spontaneous basilar membrane oscillation and otoacoustic emission at 15 kHz in a guinea pig.” J. Assoc. Res.Otolaryng. (JARO) 5, 337-349.

47. NBU-COGS: Events: Analogy Workshop 98 College Dublin, Ireland) tonyv@compapp.dcu.ie Principle Differences in Structure Mapping The Contribution of NonClassical models ; Mary Jo Rattermann http://www.nbu.bg/cogs/events/wana98.html

New Bulgarian University Center for Cognitive Science Conferences and Workshops Analogy Workshop Workshop Advances in Analogy Research: Integration of Theory and Data from the Cognitive, Computational, and Neural Sciences Sofia, July 17-20, 1998 Aims: This workshop will be highly interdisciplinary and will make a serious attempt to integrate the knowledge researchers have accumulated on analogy-making in various domains: Artificial Intelligence/Computational Modeling, Cognitive Psychology, Developmental Psychology, Neuropsychology, Philosophy, Cognitive Linguistics, as well as various applications in Education, Legal and Political Reasoning, etc. A serious attempt will be made to integrate all the positive results obtained so far in theories of analogy-making, computational modeling, and experimental work. The workshop participants will participate in numerous formal and informal discussions which we hope will lead to systematization of the knowledge in the field, formulating established facts, open issues, and ideas for new approaches. Key talks: Douglas Hofstadter Indiana University, USA

48. Tree Structure Of LoLaLi Concept Hierarchy Updated On 2004624 231 Nonclassical model (2) . . . . . 246 sheaf model . . . . . 245 boolean valued . . . . 201 set theory (24) + g . . . . . 398 settheoretic definability . 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

49. Peter Suber, "Question-Begging" Let us call the view that arguments establish conclusions the classical model of argument. In this section I sketch a nonclassical model in which arguments http://www.earlham.edu/~peters/writing/bq.htm

This essay originally appeared in Argumentation Peter Suber Question-Begging Under A Non-Foundational Model of Argument Peter Suber Philosophy Department Earlham College Abstract ... Notes Abstract I find (as others have found) that question-begging is formally valid but rationally unpersuasive. More precisely, it ought to be unpersuasive, although it can often persuade. Despite its formal validity, question-begging fails to establish its conclusion; in this sense it fails under a classical or foundationalist model of argument. But it does link its conclusion to its premises by means of acceptable rules of inference; in this sense it succeeds under a non-classical, non-foundationalist model of argument which is spelled out in the essay. However, even for the latter model question-begging fails to link the conclusion to premises that the unconvinced would find more acceptable than the conclusion. The essay includes reflections on the conditions under which the circularity of mutually supporting claims can avoid question-begging and legitimately be persuasive. This paper is an attempt to describe what is objectionable and unobjectionable about begging the question, viewed from the standpoint of a non-classical model of argument.

50. Untitled Document This new aspect of the melodic idiom suggests a different, nonclassical model of major-key pitch space, in which a quasi-adjacency operates between and . http://societymusictheory.org/html/events/abstracts/smt-99.abstracts/oconnell.ht

PROGRAM SESSION INDEX PREVIOUS ... NEXT ABSTRACT [Sat. morning, 13 Nov., 9:00-11:00: Tonal Music, paper 1 of 3] A Brief History of ^6 Jeremy O'Connell (Cornell University) This paper investigates the normative melodic behavior of in music of the eighteenth and nineteenth centuries. The major scale's generally assumes the function of an adjacency to , both in theory and practice. Melodic style of the nineteenth century, however, increasingly exhibited a freer interpretation of scale-degree tendency. In particular, a whole class of situations in which leaps upward to represents a subtle change in melodic sensibility during the Romantic era. This new aspect of the melodic idiom suggests a different, "non-classical" model of major-key pitch space, in which a quasi-adjacency operates between and . The incongruity between "classical" and "non-classical" models accounts for the rhetorical effect of certain moments in pieces by Berlioz, Brahms, Tchaikovsky, and others. This paper includes a sampling of theoretical accounts of the major scale; musical analyses, which shed new light on the relevance of existing theoretical models; and a discussion of plagal cadences, which furnish a simple means of gauging the change I describe. ARB: 19/28/99

51. Publications: Computational Model Temporal Synchrony, Dynamic Bindings, and Shruti a representational but nonclassical model of reflexive reasoning, L. Shastri. To appear, Behavioral and http://www.cog-tech.com/Publications/PubsCompMod.htm

The Company The People What We Do Publications Publications on Computation Model of Reasoning Automated Knowledge Acquisition Biases in Decision Making Critical Thinking Theory Computational Model of Reasoning ... Publications by Major Research Area Army Research Institute Training Critical Thinking for The Battlefield. Volume III: Modeling and Simulation of Battlefield Critical Thinking. Arlington, VA: Cognitive Technologies, Inc. Office of Naval Research, Arlington, VA, and National Science Foundation Connectionist symbol processing: Dead or alive? Neural Computing Surveys 2 , pp. 26-28. Grannes, D.J., Shastri, L., Narayanan, S. and Feldman, J.A. (1997). "A Connectionist Encoding of Schemas and Reactive Plans.' Proceedings of the Cognitive Science Society Conference, Stanford, August 1997. Shastri, L and Mani, D.R. (1997) "Massively parallel knowledge representation and reasoning: Taking a cue from the brain". In Parallel Processing for Artificial Intelligence 3 (Eds) Geller, J., Kitano, H. and Suttner, C. Elsevier Science. Shastri, L.