Da linguística gerativa à gramática categorial : sujeitos lexicais em infinitivos controlados

Orientadores: Marcelo Esteban Coniglio, Sonia Maria Lazzarini CyrinoTese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências HumanasResumo: A presente tese situa-se na interface da lógica e da linguística; o seu objeto de estudo são os pronomes lexicais em sentenças de controle em três línguas Românicas: Português, Italiano e Espanhol. Esse assunto tem recebido mais atenção na linguística gerativa, especialmente nos anos recentes, do que na gramática de cunho lógico. Talvez como consequência disso, há ainda muito a ser entendido sobre essas estruturas linguísticas e as suas propriedades lógicas. Essa tese tenta preencher as lacunas na literatura \--- ou, pelo menos, avançar nessa direção \--- colocando questões que não foram suficientemente exploradas até agora. Para tal efeito avançamos duas perguntas-chaves, uma linguística e a outra lógica. Elas são, respectivamente: Qual é o estatuto sintático dos pronomes lexicais em estruturas de controle? E: Quais são os mecanismos disponíveis, em uma gramática lógica livre de contração, para se reusar recursos semânticos? A tese divide-se, consequentemente, em duas partes: linguística gerativa e gramática categorial. Na Parte I revisamos algumas das principais teorias de controle gerativistas e a recente discussão acerca das cláusulas infinitivas com sujeito lexical. Na Parte II revisamos a literatura categorial, atendendo principalmente às propostas acerca das estruturas de controle e dos pronomes anafóricos. Em última instância, mostraremos que as propostas linguísticas e lógicas prévias precisam ser modificadas para se explicar o fenômeno linguístico em questão. Com efeito, nos capítulos finais de cada uma das partes avançamos propostas alternativas que, a nosso ver, resultam mais adequadas que as suas rivais. Mais específicamente, na Parte I avançamos uma proposta linguística na linha do cálculo de controle T/Agr de Landau. Na Parte II apresentamos duas propostas categoriais, uma na linha do cálculo categorial combinatório e a outra, na gramática lógica de tipos. Finalmente mostramos a implementação da última proposta em um analisador sintático e de demonstração categorialAbstract: The present thesis lies at the interface of logic and linguistics; its object of study are control sentences with overt pronouns in Romance languages (European and Brazilian Portuguese, Italian and Spanish). This is a topic that has received considerably more attention on the part of linguists, especially in recent years, than from logicians. Perhaps for this reason, much remains to be understood about these linguistic structures and their underlying logical properties. This thesis seeks to fill the lacunas in the literature \--- or at least take steps in this direction \--- by way of addressing a number of issues that have so far been under-explored. To this end we put forward two key questions, one linguistic and the other logical. These are, respectively: What is the syntactic status of the surface pronoun? And: What are the available mechanisms to reuse semantic resources in a contraction-free logical grammar? Accordingly, the thesis is divided into two parts: generative linguistics and categorial grammar. Part I starts by reviewing the recent discussion within the generative literature on infinitive clauses with overt subjects, paying detailed attention to the main accounts in the field. Part II does the same on the logical grammar front, addressing in particular the issues of control and of anaphoric pronouns. Ultimately, the leading accounts from both camps will be found wanting. The closing chapter of each of Part I and Part II will thus put forward alternative candidates, that we contend are more successful than their predecessors. More specifically, in Part I we offer a linguistic account along the lines of Landau's T/Agr theory of control. In Part II we present two alternative categorial accounts: one based on Combinatory Categorial Grammar, the other on Type-Logical Grammar. Each of these accounts offers an improved, more fine-grained perspective on control infinitives featuring overt pronominal subjects. Finally, we include an Appendix in which our type-logical proposal is implemented in a categorial parser/theorem-prover (categorial parser/theorem-prover)DoutoradoFilosofiaDoutora em Filosofia2013/08115-1, 2015/09699-2FAPESPCAPE

Lexical information from a minimalist point of view

Simplicity as a methodological orientation applies to linguistic theory just as to any other field of research: ‘Occam’s razor’ is the label for the basic heuristic maxim according to which an adequate analysis must ultimately be reduced to indispensible specifications. In this sense, conceptual economy has been a strict and stimulating guideline in the development of Generative Grammar from the very beginning. Halle’s (1959) argument discarding the level of taxonomic phonemics in order to unify two otherwise separate phonological processes is an early characteristic example; a more general notion is that of an evaluation metric introduced in Chomsky (1957, 1975), which relates the relative simplicity of alternative linguistic descriptions systematically to the quest for explanatory adequacy of the theory underlying the descriptions to be evaluated. Further proposals along these lines include the theory of markedness developed in Chomsky and Halle (1968), Kean (1975, 1981), and others, the notion of underspecification proposed e.g. in Archangeli (1984), Farkas (1990), the concept of default values and related notions. An important step promoting this general orientation was the idea of Principles and Parameters developed in Chomsky (1981, 1986), which reduced the notion of language particular rule systems to universal principles, subject merely to parametrization with restricted options, largely related to properties of particular lexical items. On this account, the notion of a simplicity metric is to be dispensed with, as competing analyses of relevant data are now supposed to be essentially excluded by the restrictive system of principles

Kleene Algebra of Partial Predicates

We show that the set of all partial predicates over a set D together with the disjunction, conjunction, and negation operations, defined in accordance with the truth tables of S.C. Kleene’s strong logic of indeterminacy [17], forms a Kleene algebra. A Kleene algebra is a De Morgan algebra [3] (also called quasi-Boolean algebra) which satisfies the condition x ∧¬:x ⩽ y ∨¬ :y (sometimes called the normality axiom). We use the formalization of De Morgan algebras from [8]. The term “Kleene algebra” was introduced by A. Monteiro and D. Brignole in [3]. A similar notion of a “normal i-lattice” had been previously studied by J.A. Kalman [16]. More details about the origin of this notion and its relation to other notions can be found in [24, 4, 1, 2]. It should be noted that there is a different widely known class of algebras, also called Kleene algebras [22, 6], which generalize the algebra of regular expressions, however, the term “Kleene algebra” used in this paper does not refer to them. Algebras of partial predicates naturally arise in computability theory in the study on partial recursive predicates. They were studied in connection with non-classical logics [17, 5, 18, 32, 29, 30]. A partial predicate also corresponds to the notion of a partial set [26] on a given domain, which represents a (partial) property which for any given element of this domain may hold, not hold, or neither hold nor not hold. The field of all partial sets on a given domain is an algebra with generalized operations of union, intersection, complement, and three constants (0, 1, n which is the fixed point of complement) which can be generalized to an equational class of algebras called DMF-algebras (De Morgan algebras with a single fixed point of involution) [25]. In [27] partial sets and DMF-algebras were considered as a basis for unification of set-theoretic and linguistic approaches to probability. Partial predicates over classes of mathematical models of data were used for formalizing semantics of computer programs in the composition-nominative approach to program formalization [31, 28, 33, 15], for formalizing extensions of the Floyd-Hoare logic [7, 9] which allow reasoning about properties of programs in the case of partial pre- and postconditions [23, 20, 19, 21], for formalizing dynamical models with partial behaviors in the context of the mathematical systems theory [11, 13, 14, 12, 10].Korniłowicz Artur - Institute of Informatics, University of Białystok, PolandIvanov Ievgen - Taras Shevchenko National University, Kyiv, UkraineNikitchenko Mykola - Taras Shevchenko National University, Kyiv, UkraineRaymond Balbes and Philip Dwinger. Distributive Lattices. University of Missouri Press, 1975.T.S. Blyth and J. Varlet. Ockham Algebras. Oxford science publications. Oxford University Press, 1994.Diana Brignole and Antonio Monteiro. Caractérisation des algèbres de Nelson par des egalités. Instituto de Matemática, Universidad Nacional del Sur, Argentina, 1964.Roberto Cignoli. Injective de Morgan and Kleene algebras. Proceedings of the American Mathematical Society, 47(2):269–278, 1975.J.P. Cleave. A Study of Logics. Oxford logic guides. Clarendon Press, 1991. ISBN 9780198532118.J.H. Conway. Regular algebra and finite machines. Chapman and Hall mathematics series. Chapman and Hall, 1971.R.W. Floyd. Assigning meanings to programs. Mathematical aspects of computer science, 19(19–32), 1967.Adam Grabowski. Robbins algebras vs. Boolean algebras. Formalized Mathematics, 9(4): 681–690, 2001.C.A.R. Hoare. An axiomatic basis for computer programming. Commun. ACM, 12(10): 576–580, 1969.Ievgen Ivanov. On the underapproximation of reach sets of abstract continuous-time systems. In Erika Ábrahám and Sergiy Bogomolov, editors, Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis, SNR@ETAPS 2017, Uppsala, Sweden, 22nd April 2017, volume 247 of EPTCS, pages 46–51, 2017. doi:10.4204/EPTCS.247.4.Ievgen Ivanov. On representations of abstract systems with partial inputs and outputs. In T. V. Gopal, Manindra Agrawal, Angsheng Li, and S. Barry Cooper, editors, Theory and Applications of Models of Computation – 11th Annual Conference, TAMC 2014, Chennai, India, April 11–13, 2014. Proceedings, volume 8402 of Lecture Notes in Computer Science, pages 104–123. Springer, 2014. ISBN 978-3-319-06088-0. doi:10.1007/978-3-319-06089-7_8.Ievgen Ivanov. On local characterization of global timed bisimulation for abstract continuous-time systems. In Ichiro Hasuo, editor, Coalgebraic Methods in Computer Science – 13th IFIP WG 1.3 International Workshop, CMCS 2016, Colocated with ETAPS 2016, Eindhoven, The Netherlands, April 2–3, 2016, Revised Selected Papers, volume 9608 of Lecture Notes in Computer Science, pages 216–234. Springer, 2016. ISBN 978-3-319-40369-4. doi:10.1007/978-3-319-40370-0_13.Ievgen Ivanov, Mykola Nikitchenko, and Uri Abraham. On a Decidable Formal Theory for Abstract Continuous-Time Dynamical Systems, pages 78–99. Springer International Publishing, 2014. ISBN 978-3-319-13206-8. doi:10.1007/978-3-319-13206-8_4.Ievgen Ivanov, Mykola Nikitchenko, and Uri Abraham. Event-based proof of the mutual exclusion property of Peterson’s algorithm. Formalized Mathematics, 23(4):325–331, 2015. doi:10.1515/forma-2015-0026.Ievgen Ivanov, Mykola Nikitchenko, and Volodymyr G. Skobelev. Proving properties of programs on hierarchical nominative data. The Computer Science Journal of Moldova, 24(3):371–398, 2016.J. A. Kalman. Lattices with involution. Transactions of the American Mathematical Society, 87(2):485–485, February 1958. doi:10.1090/s0002-9947-1958-0095135-x.S.C. Kleene. Introduction to Metamathematics. North-Holland Publishing Co., Amsterdam, and P. Noordhoff, Groningen, 1952.S. Körner. Experience and Theory: An Essay in the Philosophy of Science. International library of philosophy and scientific method. Routledge & Kegan Paul, 1966.Artur Kornilowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the algebra of nominative data in Mizar. In Maria Ganzha, Leszek A. Maciaszek, and Marcin Paprzycki, editors, Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, September 3–6, 2017., pages 237–244, 2017. ISBN 978-83-946253-7-5. doi:10.15439/2017F301.Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. An approach to formalization of an extension of Floyd-Hoare logic. In Vadim Ermolayev, Nick Bassiliades, Hans-Georg Fill, Vitaliy Yakovyna, Heinrich C. Mayr, Vyacheslav Kharchenko, Vladimir Peschanenko, Mariya Shyshkina, Mykola Nikitchenko, and Aleksander Spivakovsky, editors, Proceedings of the 13th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer, Kyiv, Ukraine, May 15–18, 2017, volume 1844 of CEUR Workshop Proceedings, pages 504–523. CEUR-WS.org, 2017.Artur Korniłowicz, Andrii Kryvolap, Mykola Nikitchenko, and Ievgen Ivanov. Formalization of the Nominative Algorithmic Algebra in Mizar, pages 176–186. Springer International Publishing, 2018. ISBN 978-3-319-67229-8. doi:10.1007/978-3-319-67229-8_16.Dexter Kozen. On Kleene algebras and closed semirings, pages 26–47. Springer Berlin Heidelberg, 1990. doi:10.1007/BFb0029594.Andrii Kryvolap, Mykola Nikitchenko, and Wolfgang Schreiner. Extending Floyd-Hoare Logic for Partial Pre- and Postconditions, pages 355–378. Springer International Publishing, 2013. ISBN 978-3-319-03998-5. doi:10.1007/978-3-319-03998-5_18.Antonio Monteiro and Luiz Monteiro. Axiomes indépendants pour les algèbres de Nelson, de Łukasiewicz trivalentes, de de Morgan et de Kleene. Notas de lógica matemática, (40): 1–11, 1996.Maurizio Negri. Three valued semantics and DMF-algebras. Boll. Un. Mat. Ital. B (7), 10(3):733–760, 1996.Maurizio Negri. DMF-algebras: representation and topological characterization. Boll. Unione Mat. Ital. Sez. B Artic. Ric. Mat. (8), 1(2):369–390, 1998.Maurizio Negri. Partial probability and Kleene logic, 2013.M.S. Nikitchenko and S.S. Shkilniak. Mathematical logic and theory of algorithms. Publishing house of Taras Shevchenko National University of Kyiv, Ukraine (in Ukrainian), 2008.M.S. Nikitchenko and S.S. Shkilniak. Applied logic. Publishing house of Taras Shevchenko National University of Kyiv, Ukraine (in Ukrainian), 2013.Mykola Nikitchenko and Stepan Shkilniak. Algebras and logics of partial quasiary predicates. Algebra and Discrete Mathematics, 23(2):263–278, 2017.Nikolaj S. Nikitchenko. A composition nominative approach to program semantics. Technical Report IT-TR 1998-020, Department of Information Technology, Technical University of Denmark, 1998.Helena Rasiowa. An Algebraic Approach to Non-Classical Logics. North Holland, 1974.Volodymyr G. Skobelev, Mykola Nikitchenko, and Ievgen Ivanov. On algebraic properties of nominative data and functions. In Vadim Ermolayev, Heinrich C. Mayr, Mykola Nikitchenko, Aleksander Spivakovsky, and Grygoriy Zholtkevych, editors, Information and Communication Technologies in Education, Research, and Industrial Applications – 10th International Conference, ICTERI 2014, Kherson, Ukraine, June 9–12, 2014, Revised Selected Papers, volume 469 of Communications in Computer and Information Science, pages 117–138. Springer, 2014. ISBN 978-3-319-13205-1. doi:10.1007/978-3-319-13206-8_6.261112

The Case of Korean -ko siph-

학위논문(석사) -- 서울대학교대학원 : 인문대학 언어학과, 2023. 8. 고희정.This study focuses on the desiderative construction -ko siph- in Korean and the case alternation between nominative and accusative case found on the object in the -ko siph- construction. These constructions exhibit the characteristics typical of the WANT class volitionals, and several unique properties that goes beyond the realm of desideratives in general, setting it apart not only from other desiderative constructions within Korean but also from those found across languages. In this paper, we present compelling evidence in favor of the size difference approach over the complex predicate approach or the prolepsis approach in accounting for the structural case alternation found in the -ko siph- construction. Specifically, we posited the presence of an incomplete, deprived VoiceR in the Nominative Object Construction and a complete, fully functioning Voice in the Accusative Object Construction. In addition, we propose that the key to the difference in scope interpretation, which correlates with the alternating structural case marker in the -ko siphconstruction, is the type mismatch theory. Instead of explaining the scope property within the narrow syntax, we argue that the burden of the explanation should be placed on the semantic type mismatch at LF. The findings will also be extended to the -ki silh- construction in the last part of this paper, which is the exact antonym of the -ko siph- construction semantically. Overall, the analysis presented here is expected to contribute to our understanding of the WANT class desideratives and the case alteration phenomenon observed in Korean syntax.본 연구에서는 한국어 소망구문 -고 싶의 목적어에 나타나는 격 교체 현상 및 이 격 교체 현상과 밀접한 관련을 가지며 나타나는 현상들에 주목하였다. 그 중에서도 특히 작용역 해석 및 부가어와 술어의 제약, 통사적 이동에 있어서의 제약 등이 -고 싶 구문의 격교체 현상과 유관한 것으로 분석된다. -고 싶 구문은 전형적인 원하다 부류 소망술어의 성격을 띄고 있음과 동시에 격교체 현상 혹은 주어 1인칭 제약과 같은 다른 언어나 한국어의 소망술어에서 일반적으로 볼 수 없는 특징 또한 가지고 있어 면밀한 분석의 필요성이 제기된다. 본 연구는 -고 싶 구문의 격 교체 현상 및 그에 수반한 여러 현상을 설명하는 데에 있어 복합술어분석(complex predicate approach)이나 예변구문 분석(prolepsis approach)에 비해 투사 범주의 크기 차이 분석(size difference approach)이 유리하다는 사실을 주장한다. 보다 구체적으로는 주격 목적어 구문에는 불완전한 재구조화 태 핵(VoiceR head)이, 대격 목적어 구문에는 제 기능을 완전히 갖춘 태 핵(Voice head)가 존재한다는 가설을 지지한다. 이에 더해, 격 표지에 따라 -고 싶- 구문에서 달라지는 작용역 해석(Scope interpretation)의 차이는 유형 불일치 이론(type mismatch theory)를 통해 설명될 수 있는 것으로 제시되었다. 이에 따르면 목적어의 격112 표지가 교체 됨에 따라 바뀌는 작용역 해석 상의 특징은 협소 통사부에서 설명되기 보다는 논리형식(LF)에서의 의미 유형사이의 차이로 귀결된다. -고 싶 구문에서 목적어 상의 격 교체가 만들어내는 차이는 의미론적으로 -고 싶과 반의어 관계에 있는 -기 싫에서도 확장 및 적용되며, 이 두 구문의 보문 형태표지 -기와 -고가 한국어에서 접속법(subjunctive mood)표지로 분석되어온 요소와 동질적임을 주장한다. 종국적으로 본 연구의 분석은 한국어 통사론에서 소망구문 -고 싶의 성격을 규명함과 동시에 유사한 구문들에 나타나는 격 교체 현상의 이해에 기여할 것으로 기대된다.Chapter 1. Introduction 1 1.1. Brief summary of the proposal 1 1.2. What is the desiderative construction? 2 1.3. Overview 9 Chapter 2. Revivew of the previous literature 11 2.1. Complex predicate approach 11 2.1.1. Chang and Jo (1991) 11 2.1.2. S.-W. Kim (1996) 14 2.1.3. Kim and Maling (1998) 16 2.1.4. J.-H. Uhm (2003) 18 2.2. Prolepsis approach 22 2.3. Size difference approach 26 2.3.1. K.-Y. Choi (2009) 27 2.3.2. H.-K. Jung (2011) 30 Chapter 3. The Proposal 35 3.1. The core innovations 35 3.2. Accusative Object Construction 40 3.3. Nominative Object Construction 49 Chapter 4. Rethinking case and scope 56 4.1. Case Theory 56 4.1.1. Voice Restructuring in NOC 56 4.1.2. T as a multiple NOM case licenser 67 4.2. Scope puzzle demystified: Insights from type mismatch theory 71 Chapter 5. Lower predicates: Key players in object choice 76 5.1. Evidence from entailment relation 76 5.2. Specificity requirement 79 Chapter 6. Drawing Parallels: The connection between the -ko siph- and the -ki silh- 91 6.1. Commonalities 92 6.2. Technical implementation: head movement approach 96 Chapter 7. Conclusion 104 References 107 국문초록 112석

On Left and Right Dislocation: A Dynamic Perspective

The paper argues that by modelling the incremental and left-right process of interpretation as a process of growth of logical form (representing logical forms as trees), an integrated typology of left-dislocation and right-dislocation phenomena becomes available, bringing out not merely the similarities between these types of phenomena, but also their asymmetry. The data covered include hanging topic left dislocation, clitic left dislocation, left dislocation, pronoun doubling, expletives, extraposition, and right node raising, with each set of data analysed in terms of general principles of tree growth. In the light of the success in providing a characterisation of the asymmetry between left and right periphery phenomena, a result not achieved in more wellknown formalisms, the paper concludes that grammar formalisms should model the dynamics of language processing in time.Articl