Natural language, sortal reducibility and generalized quantifiers
- 期刊名称The Journal of Symbolic Logic
- 作者Keenan, Edward L.
- 卷第58卷
- 期第1期
- 印刷ISSN0022-4812
- 电子ISSN1943-5886
- 文件大小767.09KB
- 发表时间1993-03
- DOI10.2307/2275339
- 页码314-325
Recursion-closed algebraic theoriesJean H. Gallier · 1981
Tree pushdown automataKarl M. Schimpf; Jean H. Gallier · 1985
Reductions in tree replacement systemsJean H. Gallier; Ronald V. Book · 1985
On the existence of optimal fixpointsJean H. Gallier · Theory of Computing Systems · 1979-1980
Continuation semantics for flowgraph equationsWilliam F. Dowling; Jean H. Gallier · 1986
Building exact computation sequencesAlex Pelin; Jean H. Gallier · 1987
Deterministic finite automata with recursive calls and DPDAsJean H. Gallier; Salvatore La Torre; Supratik Mukhopadhyay · 2003
Complete sets of transformations for general E-unificationJean H. Gallier; Wayne Snyder · 1989
Computability and λ-DefinabilityA. M. Turing · The Journal of Symbolic Logic · 1937
Definability and Decision Problems in ArithmeticJulia Robinson · The Journal of Symbolic Logic · 1949
Arithmetical Problems and Recursively Enumerable PredicatesMartin Davis · The Journal of Symbolic Logic · 1953
The Interpretability Logic of Peano ArithmeticAlessandro Berarducci · The Journal of Symbolic Logic · 1990
Steps Toward a Constructive NominalismNelson Goodman and W. V. Quine · The Journal of Symbolic Logic · 1947
A Completeness Theorem in Modal LogicSaul A. Kripke · The Journal of Symbolic Logic · 1959
Models and RealityHilary Putnam · The Journal of Symbolic Logic · 1980
A Theory of Restricted Quantification ITheodore Hailperin · The Journal of Symbolic Logic · 1957