{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":47,"n_cols":5,"rows_kept":47,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[12,2,12,3],[13,2,13,3],[17,2,17,3],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[25,4,25,5],[26,2,26,3],[27,2,27,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[36,2,36,3],[37,2,37,3],[40,2,40,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910828755803321"]
[null,null,"Autore",null,"Tangora Martin C."]
[null,null,"Titolo",null,"Computing the homology of the lambda algebra / / Martin C. Tangora"]
[null,null,"Pubbl/distr/stampa",null,"Providence, Rhode Island : , : American Mathematical Society, , 1985"]
[{"$nulls":4},"©1985"]
[null,null,"ISBN",null,"1-4704-0750-7"]
[null,null,"Descrizione fisica",null,"1 online resource (174 p.)"]
[null,null,"Collana",null,"Memoirs of the American Mathematical Society, , 0065-9266 ; ; Number 337"]
[null,null,"Disciplina",null,"514"]
[null,null,"Soggetti",null,"Lambda algebra - Data processing"]
[{"$nulls":4},"Adams spectral sequences - Data processing"]
[{"$nulls":4},"Homotopy groups - Data processing"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"November 1985, Volume 58, Number 337 (third of four numbers).\""]
[null,null,null,"Nota di bibliografia","Includes bibliographical references."]
[null,null,"Nota di contenuto",null,"\"\"Table of Contents\"\"; \"\"Chapter 1: Introduction\"\"; \"\"Chapter 2: The lambda algebra\"\"; \"\"2.1. The defining structure of the lambda algebra\"\"; \"\"2.2. Generating tables of relations and differentials\"\"; \"\"2.3. Digression: the Adem relations in the Steenrod algebra\"\"; \"\"2.4. Ordering\"\"; \"\"2.5. Corollaries to the structure formulas\"\"; \"\"2.6. Tri-grading when p is odd\"\"; \"\"2.7. The endomorphism Î?\"\"; \"\"2.8. Cutting the work in half: odd endings\"\"; \"\"2.9. Remarks on the image of J and vanishing lines\"\"; \"\"2.10. The \"\"unstable\"\" algebras and the EHP sequence\"\""]
[{"$nulls":4},"\"\"2.11. Some comments on the search for differentials\"\"\"\"2.12. The size of the lambda algebra\"\"; \"\"Table 2.1: Actual counts, p=2, odd-ending monomials\"\"; \"\"2.13. Euler characteristic check\"\"; \"\"Chapter 3: The algorithms and the Curtis table\"\"; \"\"3.1. Terminology\"\"; \"\"3.2. The tables do not include certain towers\"\"; \"\"3.3. Preliminary algorithm\"\"; \"\"3.4. Obvious tags and invisible listings\"\"; \"\"3.5. The LTO (leading-term-only) algorithm\"\"; \"\"3.6. Some perverse examples\"\"; \"\"3.7. Finiteness\"\"; \"\"3.8. Correctness\"\"; \"\"3.9. Shortcuts\"\"; \"\"3 9 1. No small target\"\"; \"\"3 9.2. Truncation\"\""]
[{"$nulls":4},"\"\"3 9.3. Cycle initials\"\"\"\"3 9.4. Visible products \"\"; \"\"3.9.5. A certain pattern for p=2\"\"; \"\"3.9.6. A useful pattern for p=2 or p=3\"\"; \"\"3.9.7. Verticals, p=2\"\"; \"\"3.9.8. Some patterns for p=3\"\"; \"\"3.9.9. Verticals, p=3\"\"; \"\"3.9.10. Product with Î»l, p=3\"\"; \"\"3.10 Using extraneous information\"\"; \"\"Chapter 4: Implementation and experience\"\"; \"\"4.1. The "]
[{"$nulls":4},"SNOBOL language\"\"; \"\"4.2. Stop and restart;  output\"\"; \"\"4.3. Choice of algorithm\"\"; \"\"4.4. Time and storage constraints\"\"; \"\"4.5. Data representation\"\"; \"\"4.6. The sample program\"\"; \"\"4.7. Execution profiles\"\""]
[{"$nulls":4},"\"\"4.8. Growth rate of the calculation\"\"\"\"Table 4.1. CPU time for each t, p=2\"\"; \"\"Table 4.2. CPU time for each t, p=3\"\"; \"\"4.9. Bad cases\"\"; \"\"4.10. Recent developments\"\"; \"\"Figure 4.1: Snobol program, p=2\"\"; \"\"Chapter 5: Related programs\"\"; \"\"5.1. The lambda algebra\"\"; \"\"5.2. Table-processing programs\"\"; \"\"5.3. Various programs for Curtis tables\"\"; \"\"5.4. Execution profiles\"\"; \"\"5.5. Product structure\"\"; \"\"Chapter 6: The tables\"\"; \"\"6.1. Tables 1 and 2: Curtis tables for p=2\"\"; \"\"6.2. Tables 3 and 4: Curtis tables for p=3\"\"; \"\"6.3. Tables 5 and 6: Curtis tables for p=3, lambdas only\"\""]
[{"$nulls":4},"\"\"Table 1: p=2, stable\"\"\"\"Table 2: p=2, Curtis table\"\"; \"\"Table 3: p=3, stable\"\"; \"\"Table 4: p=3, Curtis table\"\"; \"\"Table 5: p=3 lambdas only, stable\"\"; \"\"Table 6: p=3 lambdas only, Curtis table\"\"; \"\"Bibliography\"\""]
[null,"2.","Record Nr.",null,"UNINA9910968477303321"]
[null,null,"Autore",null,"Seuren Pieter A. M"]
[null,null,"Titolo",null,"The logic of language / / Pieter A.M. Seuren"]
[null,null,"Pubbl/distr/stampa",null,"Oxford, : Oxford University Press, 2010"]
[null,null,"ISBN",null,"9780191571794"]
[{"$nulls":4},"0191571792"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"xv, 428 p. : ill"]
[null,null,"Collana",null,"Language from within ; ; v.2"]
[null,null,"Disciplina",null,"401.43"]
[null,null,"Soggetti",null,"Language and logic"]
[{"$nulls":4},"Psycholinguistics"]
[{"$nulls":4},"Semantics"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Intro -- Contents -- Preface -- Abbreviations and symbols -- 1 Logic and entailment -- 1.1 What is a logic and why do we need one in the study of language? -- 1.2 The definition of entailment -- 1.2.1 The general concept of entailment -- 1.2.2 The specific concept of logical entailment -- 1.3 The referential independence of logic: no truth-value gaps -- 1.4 Logical form and L-propositions -- 1.5 The Bivalence Principle, sentence types, and utterance tokens -- 1.6 Some problems with the assignment of truth values -- 2 Logic: a new beginning -- 2.1 Entailment, contrariety and contradiction: the natural triangle -- 2.2 Internal negation and duality: the natural square and the Boethian square -- 2.3 Logical operators as predicates -- 2.3.1 Meaning postulates -- 2.3.2 Boolean algebra and the operators of propositional calculus -- 2.3.3 Valuation space modelling: a formal definition -- 2.3.4 Satisfaction conditions of the propositional operators -- 2.3.5 Satisfaction conditions of the quantifiers -- 2.4 Internal negation, the Conversions and De Morgan's laws -- 2.4.1 The internal negation again -- 2.4.2 The Conversions and De Morgan's laws -- 3 Natural set theory and natural logic -- 3.1 Introductory observations -- 3.2 Some set-theoretic principles of natural cognition -- 3.2.1 A résumé of standard set theory -- 3.2.2 The restrictions imposed by NST -- 3.3 Consequences for set-theoretic and (meta)logical relations and functions -- 3.3.1 Consequences for set-theoretic relations and functions -- 3.3.2 Consequences for (meta)logical relations and functions -- 3.4 The basic-natural systems of logic -- 3.4.1 Basic-"]
[{"$nulls":4},"natural predicate logic: the necessity of a cognitive base -- 3.4.2 Hamilton's predicate logic -- 3.4.3 Basic-natural propositional logic -- 3.5 Neither *nand nor *nall: NST predicts their absence."]
[{"$nulls":4},"3.5.1 The problem and the solution proposed by pragmaticists -- 3.5.2 Preliminary objections -- 3.5.3 The main objection and a stronger solution -- 3.5.4 Parallel lexical gaps in epistemic-modal and causal logic? -- 4 Logical power, Abelard, and empirical success rates -- 4.1 Aristotelian predicate calculus rescued from undue existential import -- 4.2 The notion of logical power -- 4.2.1 The logical power of propositional calculus -- 4.2.2 The logical power of Aristotelian-Boethian predicate calculus -- 4.2.3 The logical power of standard modern predicate calculus -- 4.2.4 The logical power of Aristotelian-Abelardian predicate calculus -- 4.3 Distributive quantifiers -- 4.4 Predicate logics and intuitions: a scale of empirical success -- 5 Aristotle, the commentators, and Abelard -- 5.1 A recapitulation of ABPC -- 5.2 The not quite Aristotelian roots of ABPC -- 5.2.1 Aristotle's own predicate logic -- 5.2.2 The ancient commentators -- 5.2.3 The Square representation -- 5.2.4 An aside on Horn's and Parsons' proposal as regards the O-corner -- 5.2.5 Logic and mysticism: what made logic popular? -- 5.3 Abelard's remedy -- 6 The functionality of the Square and of BNPC -- 6.1 How to isolate the cases with a null F-class: the purpose of space 4 -- 6.2 Extreme values are uninformative in standard modern predicate calculus -- 6.3 The functionality of excluding extreme values -- 6.4 The functionality of BNPC -- 6.5 Conclusion -- 7 The context-sensitivity of speech and language -- 7.1 What is context-sensitivity? -- 7.2 Discourse domains -- 7.2.1 The commitment domain and further subdomains -- 7.2.2 The Principle of Maximal Unity -- 7.3 Conditions for text coherence -- 7.3.1 Consistency -- 7.3.2 Informativity -- 7.3.3 Subdomain hierarchies: subsidiary subdomains -- 7.4 Open parameters in lexical meaning -- 8 Discourse incrementation."]
[{"$nulls":4},"8.1 The incrementation procedure -- 8.1.1 Singular entity addresses and address closure -- 8.1.2 Plurality and quantification -- 8.1.3 Subordinate subdomains -- 8.2 Instructions -- 8.2.1 Conjunction -- 8.2.2 Negation -- 8.2.3 Disjunction -- 8.2.4 Conditionals -- 9 Primary and donkey anaphora -- 9.1 Introduction -- 9.2 Reference by anaphora -- 9.3 Primary anaphora: bound variable or external anaphor? -- 9.4 Donkey sentences -- 9.4.1 The problem -- 9.4.2 The history of the problem -- 9.5 The reference-fixing algorithm -- 9.6 The solution -- 9.6.1 Donkey anaphora under disjunction -- 9.6.2 Donkey anaphora in conditionals -- 9.6.3 Donkey anaphora under universal quantification -- 10 Presupposition and presuppositional logic -- 10.1 Presupposition as an anchoring device -- 10.1.1 Some early history -- 10.1.2 The Russell tradition -- 10.1.3 The Frege-Strawson tradition -- 10.2 The origin and classification of presuppositions -- 10.3 Operational criteria for the detection of presuppositions -- 10.4 Some data that were overlooked -- 10.5 Presupposition projection -- 10.5.1 What is presupposition projection? -- 10.5.2 Projection from lexical subdomains -- 10.5.3 Projection from instructional subdomains -- 10.5.4 Summary of the projection mechanism -- 10.6 The presuppositional logic of the propositional operators -- 10.7 The presuppositional logic of quantification -- 10.7.1 The presuppositional version of the Square and of SMPC -- 10.7.2 The presuppositional version of BNPC -- 10.7.3 The victorious Square -- 10.8 The attempt at equating anaphora with presupposition -- 11 Topic-comment modulation -- 11.1 What is topic-comment modulation? -- 11.1.1 The Aristotelian origin of topic-comment modulation -- 11.1.2 The discovery of the problem in the nineteenth century -- 11.1.3 The "]
[{"$nulls":4},"dynamics of discourse: the question-answer game."]
[{"$nulls":4},"11.2 Phonological, grammatical, and semantic evidence for TCM -- 11.3 The comment-predicate Be[sub(v)] -- 11.4 Only, even, and Neg-Raising -- 11.5 Why TCM is a semantic phenomenon: the SSV test -- Bibliography -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- J -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- Z."]
[null,null,null,"Sommario/riassunto","This book opens a new perspective on logic. After analyzing the functional adequacy of natural predicate logic and standard modern logic for natural linguistic interaction, the author develops a general theory of discourse-bound interpretation, covering such topics as discourse incrementation, anaphora, presupposition and topic-comment structure."]