19 found
Order:
  1.  23
    A Parsing Method for Montague Grammars.Joyce Friedman & David S. Warren - 1978 - Linguistics and Philosophy 2 (3):347 - 372.
    The main result in this paper is a method for obtaining derivation trees from sentences of certain formal grammars. No parsing algorithm was previously known to exist for these grammars.Applied to Montague's PTQ the method produces all parses that could correspond to different meanings. The technique directly addresses scope and reference and provides a framework for examining these phenomena. The solution for PTQ is implemented in an efficient and useful computer program.
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  2.  18
    Λ-Normal Forms in an Intensional Logic for English.Joyce Friedman & David S. Warren - 1980 - Studia Logica 39 (2-3):311 - 324.
    Montague [7] translates English into a tensed intensional logic, an extension of the typed -calculus. We prove that each translation reduces to a formula without -applications, unique to within change of bound variable. The proof has two main steps. We first prove that translations of English phrases have the special property that arguments to functions are modally closed. We then show that formulas in which arguments are modally closed have a unique fully reduced -normal form. As a corollary, translations of (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  3.  5
    An Unlabeled Bracketing Solution to the Problem of Conjoined Phrases in Montague's PTQ.Joyce Friedman - 1979 - Journal of Philosophical Logic 8 (1):151 - 169.
    Although Montague claims that the system of The proper treatment of quantification in ordinary English includes some conjunction and disjunction, the rules for other grammatical constructions do not take conjunction or disjunction into account, and in general fail either syntactically or semantically when one of their arguments is so formed. Using an unlabeled bracketing of syntactic structure and recursive definitions, we have been able to rewrite the rules so that correct results are obtained.These results should provide a firmer basis for (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  4.  2
    Kallick Bruce. A Decision Procedure Based on the Resolution Method. Information Processing 68, Proceedings of IFIP Congress 1968, Organized by the International Federation for Information Processing, Edinburgh, 5–10 August 1968, Volume 1, Mathematics, Software, Edited by Morrell A. J. H., North-Holland Publishing Company, Amsterdam 1969, Pp. 269–275. [REVIEW]Joyce Friedman - 1973 - Journal of Symbolic Logic 38 (4):656.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  5.  10
    Erratum.Joyce Friedman & David S. Warren - 1979 - Linguistics and Philosophy 3 (1):139 -.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  6.  2
    Review: Hao Wang, Wayne A. Kalenich, Formalization and Automatic Theorem-Proving. [REVIEW]Joyce Friedman - 1974 - Journal of Symbolic Logic 39 (2):350-350.
  7.  1
    Dunham B., Fridshal R., and Sward G. L.. A Non-Heuristic Program for Proving Elementary Logical Theorems. English, with French, German, Russian, and Spanish Summaries. Information Processing, Proceedings of the International Conference on Information Processing, Unesco, Paris 15–20 June 1959, Unesco, Paris, R. Oldenbourg, Munich, and Butterworths, London, 1960, Pp. 282–285.Dunham B., Fridshal R., and North J. H.. Exploratory Mathematics by Machine. Recent Developments in Information and Decision Processes, Edited by Machol Robert E. And Gray Paul, The Macmillan Company, New York 1962, Pp. 149–160.Dunham B. And North J. H.. Theorem Testing by Computer. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N. Y., April 24, 25, 26, 1962, Microwave Research Symposia Series Vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, Pp. 173–177. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  8.  1
    Wang Hao. Formalization and Automatic Theorem-Proving. Information Processing 1965, Proceedings of IFIP Congress 65, Organized by the International Federation for Information Processing, New York City, May 24–29, 1965, Volume 1, Edited by Kalenich Wayne A., Spartan Books, Inc., Washington, D.C., and Macmillan and Co., Ltd., London, 1965, Pp. 51–58. [REVIEW]Joyce Friedman - 1974 - Journal of Symbolic Logic 39 (2):350.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  9.  2
    Review: Bruce Kallick, A Decision Procedure Based on the Resolution Method. [REVIEW]Joyce Friedman - 1973 - Journal of Symbolic Logic 38 (4):656-656.
  10.  1
    Review: Michael O. Rabin, Hao Wang, Words in the History of a Turing Machine with a Fixed Input. [REVIEW]Joyce Friedman - 1969 - Journal of Symbolic Logic 34 (3):508-508.
  11.  1
    Some Results in Church's Restricted Recursive Arithmetic.Joyce Friedman - 1957 - Journal of Symbolic Logic 22 (4):337-342.
  12.  1
    Review: Alonzo Church, Application of Recursive Arithmetic to the Problem of Circuit Synthesis. [REVIEW]Joyce Friedman - 1963 - Journal of Symbolic Logic 28 (4):289-290.
  13.  1
    Review: B. Dunham, R. Fridshal, G. L. Sward, A Non-Heuristic Program for Proving Elementary Logical Theorems; B. Dunham, R. Fridshal, J. H. North, Exploratory Mathematics by Machine; B. Dunham, J. H. North, Theorem Testing by Computer. [REVIEW]Joyce Friedman - 1967 - Journal of Symbolic Logic 32 (2):266-266.
  14. A Computational Treatment of Case Grammar.Joyce Friedman - 1973 - In Jaakko Hintikka (ed.), Approaches to Natural Language. D. Reidel Publishing. pp. 134--152.
  15. A Decision Procedure for Computations of Finite Automata.Joyce Friedman - 1965 - Journal of Symbolic Logic 30 (2):248-249.
    Direct download  
     
    Export citation  
     
    My bibliography  
  16. A Semi-Decision Procedure for the Functional Calculus.Joyce Friedman - 1964 - Journal of Symbolic Logic 29 (2):101-101.
  17. Church Alonzo. Application of Recursive Arithmetic to the Problem of Circuit Synthesis Summaries of Talks Presented at the Summer Institute for Symbolic Logic Cornell University, 1957, 2nd Edn., Communications Research Division, Institute for Defense Analyses, Princeton, N. J., 1960, Pp. 3–50. 3a-45a. [REVIEW]Joyce Friedman - 1963 - Journal of Symbolic Logic 28 (4):289-290.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  18. Expressing Logical Formulas in Natural Language.Joyce Friedman - 1981 - In Jeroen Groenendijk (ed.), Formal Methods in the Study of Language. U of Amsterdam. pp. 113--130.
     
    Export citation  
     
    My bibliography  
  19. Rabin Michael O. And Wang Hao. Words in the History of a Turing Machine with a Fixed Input. Journal of the Association for Computing Machinery, Vol. 10 , Pp. 526–527. [REVIEW]Joyce Friedman - 1969 - Journal of Symbolic Logic 34 (3):508.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography