Quantifiers in TIME and SPACE : computational complexity of generalized quantifiers in natural language
暂无分享,去创建一个
[1] Jeroen Groenendijk,et al. Dynamic predicate logic , 1991 .
[2] Fenrong Liu,et al. Modelling Simultaneous games with Concurrent Dynamic logic , 2007 .
[3] Jan Tore Lønning,et al. Plurals and Collectivity , 1997, Handbook of Logic and Language.
[4] Alexis Manaster-Ramer,et al. Dutch as a formal language , 1987 .
[5] Anna Szabolcsi,et al. Variation, Distributivity, and the Illusion of Branching , 1997 .
[6] J. Büchi. Weak Second‐Order Arithmetic and Finite Automata , 1960 .
[7] Jaakko Hintikka,et al. Paradigms For Language Theory And Other Essays , 1997 .
[8] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[9] P. Blackburn,et al. Book Reviews: The Proper Treatment of Events, by Michiel van Lambalgen and Fritz Hamm , 2005, CL.
[10] Rosella Gennari,et al. Mapping Inferences: Constraint Propagation and Diamond Satisfaction , 2002 .
[11] Sigrid Beck,et al. The Semantics Of Different: Comparison Operator And Relational Adjective , 2000 .
[12] Russell Impagliazzo,et al. A personal view of average-case complexity , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.
[13] Johan van Benthem,et al. Language in action , 1991, J. Philos. Log..
[14] Martin Stokhof,et al. Information in natural language , 2008 .
[15] P. Lorenzen. Einführung in die operative Logik und Mathematik , 1955 .
[16] Annabel Cormack,et al. On ‘Formal Games and Forms for Games’ , 1980 .
[17] Noam Chomsky,et al. वाक्यविन्यास का सैद्धान्तिक पक्ष = Aspects of the theory of syntax , 1965 .
[18] Johan van Benthem,et al. Extensive Games as Process Models , 2002, J. Log. Lang. Inf..
[19] Renate Bartsch,et al. The Semantics and Syntax of Number and Numbers , 1973 .
[20] Kasia M. Jaszczolt. Semantics and Pragmatics: Meaning in Language and Discourse , 2002 .
[21] Juha Kontinen,et al. Extensions of MSO and the monadic counting hierarchy , 2011, Inf. Comput..
[22] H. Levesque. Logic and the complexity of reasoning , 1988 .
[23] James Rogers,et al. A descriptive approach to language-theoretic complexity , 1998 .
[24] J. Hintikka,et al. Game-Theoretical Semantics , 1997 .
[25] D. Over,et al. Studies in the Way of Words. , 1989 .
[26] M. Dummett. Truth and other enigmas , 1978 .
[27] Yoad Winter,et al. From Semantic Restrictions to Reciprocal Meanings , 2005 .
[28] Luca Trevisan,et al. Average-Case Complexity , 2006, Found. Trends Theor. Comput. Sci..
[29] Johan van Benthem,et al. The semantics of variety in categorial grammar , 1988 .
[30] Wilfrid Hodges,et al. Compositional Semantics for a Language of Imperfect Information , 1997, Log. J. IGPL.
[31] Gilad Ben-Avi,et al. A Characterization of Monotonicity with Collective Quantifiers , 2004, Electron. Notes Theor. Comput. Sci..
[32] Johan van Benthem,et al. Logic Games are Complete for Game Logics , 2003, Stud Logica.
[33] Paul Dekker,et al. A Guide to Dynamic Semantics , 2008 .
[34] Neil Tennant. Formal games and forms for games , 1981 .
[35] Robert May,et al. Interpreting logical form , 1989 .
[36] Yiannis N. Moschovakis,et al. Sense and denotation as algorithm and value , 1993 .
[37] Geoffrey K. Pullum,et al. Natural languages and context-free languages , 1982 .
[38] Lauri Hella. Logical Hierarchies in PTIME , 1996, Inf. Comput..
[39] D. Hofstadter. Gödel, Escher, Bach , 1979 .
[40] Stuart M. Shieber,et al. Evidence against the context-freeness of natural language , 1985 .
[41] Marcus Schaefer. Graph Ramsey theory and the polynomial hierarchy , 1999, STOC '99.
[42] J. Austin. How to do things with words , 1962 .
[43] P. Vitányi,et al. Minimum Description Length Model Selection - Problems and Extensions , 2001 .
[44] Daniela Isac,et al. I-Language: An Introduction to Linguistics as Cognitive Science , 2008 .
[45] Robert Stalnaker,et al. Ways a World Might Be: Metaphysical and Anti-Metaphysical Essays , 2003 .
[46] Eric Sven Ristad. The language complexity game , 1993 .
[47] J. Piaget. The Psychology Of Intelligence , 1951 .
[48] Pavel Tichý,et al. The Foundations of Frege's Logic , 1988 .
[49] K. Schulz,et al. Minimal models in semantics and pragmatics : free choice, exhaustivity, and conditionals , 2007 .
[50] R. Carnap. Meaning and necessity : a study in semantics and modal logic , 1948 .
[51] P. Kugel,et al. Thinking may be more than computing , 1986, Cognition.
[52] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[53] Saul A. Kripke,et al. Frege's Theory of Sense and Reference: Some Exegetical Notes , 2008 .
[54] Menachem Magidor,et al. Compact extensions of L(Q) , 1977 .
[55] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[56] R. McNaughton,et al. Counter-Free Automata , 1971 .
[57] A. Church. An Unsolvable Problem of Elementary Number Theory , 1936 .
[58] Nina Gierasimczuk,et al. The Problem of Learning the Semantics of Quantifiers , 2007, TbiLLC.
[59] David Marr,et al. VISION A Computational Investigation into the Human Representation and Processing of Visual Information , 2009 .
[60] J. Paris. A Mathematical Incompleteness in Peano Arithmetic , 1977 .
[61] Leonid Libkin,et al. Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.
[62] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[63] Theo M. V. Janssen,et al. Independent Choices and the Interpretation of IF Logic , 2002, J. Log. Lang. Inf..
[64] Iris van Rooij,et al. The Tractable Cognition Thesis , 2008, Cogn. Sci..
[65] Uwe Reyle,et al. From Discourse to Logic - Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory , 1993, Studies in linguistics and philosophy.
[66] C. K. Ogden,et al. The Meaning of Meaning , 1923 .
[67] Apostolos Syropoulos,et al. Hypercomputation: Computing Beyond the Church-Turing Barrier , 2008 .
[68] Nina Gierasimczuk,et al. Hintikka's Thesis revisited , 2007 .
[69] Frank Plumpton Ramsey,et al. On a Problem of Formal Logic , 1930 .
[70] J. Spencer. Ramsey Theory , 1990 .
[71] M. Alexander,et al. Principles of Neural Science , 1981 .
[72] Haipeng Luo,et al. The properties of self-complementary graphs and new lower bounds for diagonal Ramsey numbers , 2002, Australas. J Comb..
[73] Neil Immerman,et al. Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.
[74] J. Spencer. Ten lectures on the probabilistic method , 1987 .
[75] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[76] M. E. Counihan,et al. Looking for logic in all the wrong places: An investigation of language, literacy and logic in reasoning , 2008 .
[77] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[78] Marcello Frixione,et al. Tractable Competence , 2001, Minds and Machines.
[79] Mats Rooth,et al. Generalized Conjunction and Type Ambiguity , 2008 .
[80] A. Baddeley. Working Memory, Thought, and Action , 2007 .
[81] Marcin Mostowski,et al. Computational complexity of the semantics of some natural language constructions , 2004, Ann. Pure Appl. Log..
[82] Alexander Petrus Maria van den Bosch,et al. Rationality in discovery: a study of logic, cognition, computation and neuropharmacology , 2001 .
[83] Ian Pratt-Hartmann,et al. Fragments of Language , 2004, J. Log. Lang. Inf..
[84] Jörg Flum,et al. Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.
[85] Maarten Marx,et al. Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.
[86] E. de Haas,et al. Logics for OO Information Systems: A Semantic Study of Object Orientation from a Categorial Substructural Perspective , 2001 .
[87] Pavel Pudlák,et al. A Note on Applicability of the Incompleteness Theorem to Human Mind , 1999, Ann. Pure Appl. Log..
[88] I. Rooij. Tractable cognition : complexity theory in cognitive psychology , 2003 .
[89] Yiannis N. Moschovakis,et al. A Logical Calculus of Meaning and Synonymy , 2006 .
[90] Willard Van Orman Quine,et al. Word and Object , 1960 .
[91] J. Lucas. Minds, Machines and Gödel , 1961, Philosophy.
[92] M. Dalrymple,et al. Reciprocal Expressions and the Concept of Reciprocity , 1998 .
[93] Michael Ruisdael Bennett,et al. Some extensions of a montague fragment of English , 1974 .
[94] Pavel Tichý,et al. Intension in terms of Turing machines , 1969 .
[95] Christopher Culy,et al. The complexity of the vocabulary of Bambara , 1985 .
[96] Iris van Rooij,et al. Sources of complexity in subset choice , 2005 .
[97] Francien Dechesne,et al. Signalling in IF games: a tricky business , 2005 .
[98] Jaroslav Peregrin. Meaning : the dynamic turn , 2003 .
[99] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[100] David Kaplan,et al. On the logic of demonstratives , 1979, J. Philos. Log..
[101] Reinhard Muskens,et al. Sense and the Computation of Reference , 2005 .
[102] Lawrence S. Moss,et al. Applications of modal logic in linguistics , 2007, Handbook of Modal Logic.
[103] John K. Tsotsos. Analyzing vision at the complexity level , 1990, Behavioral and Brain Sciences.
[104] Philippe Schlenker. Scopal Independence: A Note on Branching and Wide Scope Readings of Indefinites and Disjunctions , 2006, J. Semant..
[105] David Lewis. Convention: A Philosophical Study , 1986 .
[106] Roger Penrose,et al. Shadows of the mind - a search for the missing science of consciousness , 1994 .
[107] Richard Montague. Pragmatics and intensional logic , 1970 .
[108] Merlijn Sevenster,et al. Branches of imperfect information : logic, games, and computation , 2002 .
[109] L. Wittgenstein. Tractatus Logico-Philosophicus , 2021, Nordic Wittgenstein Review.
[110] C. I. Lewis,et al. The Semantic Conception of Truth and the Foundations of Semantics , 1944 .
[111] Martin Otto,et al. Bounded Variable Logics and Counting , 1997 .
[112] Johan van Benthem,et al. The Tree of Knowledge in Action: Towards a Common Perspective , 2006, Advances in Modal Logic.
[113] Jouko A. Väänänen,et al. Dependence Logic - A New Approach to Independence Friendly Logic , 2007, London Mathematical Society student texts.
[114] Howard Lasnik,et al. Reciprocity and plurality , 1991 .
[115] A. Church. Outline of a Revised Formulation of the Logic of Sense and Denotation (Part II) , 1973 .
[116] Georg Gottlob,et al. Succinctness as a Source of Complexity in Logical Formalisms , 1999, Ann. Pure Appl. Log..
[117] Robin Clark,et al. Is it logical to count on quantifiers? Dissociable neural networks underlying numerical and logical quantifiers , 2009, Neuropsychologia.
[118] Robert C. Berwick,et al. Computational complexity and natural language , 1987 .
[119] Johan van Benthem,et al. Towards a Computational Semantics , 1987 .
[120] R. May. Logical Form: Its Structure and Derivation , 1985 .
[121] David J. Chalmers,et al. A Computational Foundation for the Study of Cognition , 2011 .
[122] Seinosuke Toda,et al. PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..
[123] William A. Ladusaw. Polarity sensitivity as inherent scope relations , 1980 .
[124] Yuri Gurevich. The Value, if any, of Decidability , 1995, Bull. EATCS.
[125] B. Russell. The Principles of Mathematics , 1938 .
[126] E. Spelke,et al. Ontological categories guide young children's inductions of word meaning: Object terms and substance terms , 1991, Cognition.
[127] Ian Pratt-Hartmann,et al. Computational Complexity in Natural Language , 2010 .
[128] Paul Benacerraf,et al. God, The Devil, And Gödel , 1967 .