Gramaticalização e (inter)subjetivização na modalização em português: um estudo de pode ser

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

An alternative approach for quasi-truth

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

O estatuto lexical das preposições sob e sobre

This paper describes the prepositions sob and sobre in the Functional Discourse Grammar framework (HENGEVELD; MACKENZIE, 2008) aiming at checking their lexical or grammatical status on the basis of classification criteria postulated by Keizer (2007). The following aspects point to their lexical status : (i) they consist of an Ascription Subact; (ii) they contain a specific content on the vertical axis signaling inferiority and superiority position in relation to a limit; (iii) they are not required by any predicate, but they are predicates by themselves, which require complementation by an argument playing Reference semantic function; (iv) they may be combined with de, em, para and por; which are genuine grammatical prepositions; and, finally, (v) they are not subjected to any phonological process of reduction and fusion.

Orações subjetivas: variância e invariância de padrões na fala e na escrita

This work investigates the variance and invariance of subject clauses patterns in spoken and written contemporary Brazilian Portuguese. I analyze four parameters (category and semantic class of matrix predicate, form of embedded clause and mood-tense correlation between matrix and embedded clauses) and show that there is less variance in speech patterns.

O desenvolvimento da expressão modalizadora “pode ser”. um caso de (inter)subjetivização no português

Based on a functionalist approach, this paper analyzes the modalized expression pode ser as a complement-taking predicate which embeds a proposition (pode ser1) and as an independent structure (pode ser2), in contemporary written and spoken Brazilian Portuguese texts. We aim to identify degrees of (inter)subjectivity, revealing a process of (inter)subjectification (TRAUGOTT, 2010 among others). The analysis carried out in this paper is supported by parameters of (inter)subjectivity of modal elements (TRAUGOTT; DASHER, 2002) and by the notion of modality as a multifunctional category, serving not only to encodethe speaker’s attitude regarding the modalized content, but also as a pragmatic strategy, as a regulator of communicative situation. The exam reveals pode ser as a strongly demanded structure in interaction, a fairly requested set and also productive and useful for interpersonal relationships. The examination of semantic, discursive and morphosyntactic properties indicates a shift from syntax (pode ser1) to discourse (pode ser2), interpreted as a development of (inter)subjectification.

Trajetórias de mudança dos predicados acabar, acontecer e começar sob perspectiva discursivo-funcional

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

De Hegel a Marx: da inflexão ontológica à antítese direta

We will deal with the Marxian criticism to the Hegelian notion of "being". it will be shown that historicity and objectivity are determinations of this category (and that categories are always.,forms of being, determinations of existence). So, the analogy between the Hegelian logic and the Marxian theory may sometimes, hide essential aspects of the materialist comprehension of history Here, we intend to prove that, by questioning the treatment dispensed to the matter of being by Hegel, Marx criticizes the Hegelian inversion between subject and predicate in a way that, although dialoguing with Hegel, his conception is the exact opposite at the same time.

As construções verbais paratáticas: gramaticalização em italiano

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

The SB-index and the HSB-index: efficient indices for spatial data warehouses

Spatial data warehouses (SDWs) allow for spatial analysis together with analytical multidimensional queries over huge volumes of data. The challenge is to retrieve data related to ad hoc spatial query windows according to spatial predicates, avoiding the high cost of joining large tables. Therefore, mechanisms to provide efficient query processing over SDWs are essential. In this paper, we propose two efficient indices for SDW: the SB-index and the HSB-index. The proposed indices share the following characteristics. They enable multidimensional queries with spatial predicate for SDW and also support predefined spatial hierarchies. Furthermore, they compute the spatial predicate and transform it into a conventional one, which can be evaluated together with other conventional predicates by accessing a star-join Bitmap index. While the SB-index has a sequential data structure, the HSB-index uses a hierarchical data structure to enable spatial objects clustering and a specialized buffer-pool to decrease the number of disk accesses. The advantages of the SB-index and the HSB-index over the DBMS resources for SDW indexing (i.e. star-join computation and materialized views) were investigated through performance tests, which issued roll-up operations extended with containment and intersection range queries. The performance results showed that improvements ranged from 68% up to 99% over both the star-join computation and the materialized view. Furthermore, the proposed indices proved to be very compact, adding only less than 1% to the storage requirements. Therefore, both the SB-index and the HSB-index are excellent choices for SDW indexing. Choosing between the SB-index and the HSB-index mainly depends on the query selectivity of spatial predicates. While low query selectivity benefits the HSB-index, the SB-index provides better performance for higher query selectivity.

Interpreting Judgements using Knowledge Representation Methods and Computational Models of Argument

The goal of the present research is to define a Semantic Web framework for precedent modelling, by using knowledge extracted from text, metadata, and rules, while maintaining a strong text-to-knowledge morphism between legal text and legal concepts, in order to fill the gap between legal document and its semantics. The framework is composed of four different models that make use of standard languages from the Semantic Web stack of technologies: a document metadata structure, modelling the main parts of a judgement, and creating a bridge between a text and its semantic annotations of legal concepts; a legal core ontology, modelling abstract legal concepts and institutions contained in a rule of law; a legal domain ontology, modelling the main legal concepts in a specific domain concerned by case-law; an argumentation system, modelling the structure of argumentation. The input to the framework includes metadata associated with judicial concepts, and an ontology library representing the structure of case-law. The research relies on the previous efforts of the community in the field of legal knowledge representation and rule interchange for applications in the legal domain, in order to apply the theory to a set of real legal documents, stressing the OWL axioms definitions as much as possible in order to enable them to provide a semantically powerful representation of the legal document and a solid ground for an argumentation system using a defeasible subset of predicate logics. It appears that some new features of OWL2 unlock useful reasoning features for legal knowledge, especially if combined with defeasible rules and argumentation schemes. The main task is thus to formalize legal concepts and argumentation patterns contained in a judgement, with the following requirement: to check, validate and reuse the discourse of a judge - and the argumentation he produces - as expressed by the judicial text.

Explicit mathematics and operational set theory: some ontological comparisons

We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth TPT which proves totality exactly for the polynomial time computable functions. TPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system TPT has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic. The proof that the theory TPT is feasible is not easy. It is not possible to apply a standard realisation approach. For this reason we develop a new realisation approach whose realisation functions work on directed acyclic graphs. In this way, we can express and manipulate realisation information more efficiently.

Against Logically Possible World-Relativized Existence

The thesis that entities exist in, at, or in relation to logically possible worlds is criticized. The suggestion that actually nonexistent fictional characters might nevertheless exist in nonactual merely logically possible worlds runs afoul of the most general transworld identity requirements. An influential philosophical argument for the concept of world-relativized existence is examined in Alvin Plantinga’s formal development and explanation of modal semantic relations. Despite proposing an attractive unified semantics of alethic modality, Plantinga’s argument is rejected on formal grounds as supporting materially false actual existence assertions in the case of actually nonexistent objects in the framework of Plantinga’s own underlying classical predicate-quantificational logic.

Unfolding Feasible Arithmetic and Weak Truth

In this paper we continue Feferman’s unfolding program initiated in (Feferman, vol. 6 of Lecture Notes in Logic, 1996) which uses the concept of the unfolding U(S) of a schematic system S in order to describe those operations, predicates and principles concerning them, which are implicit in the acceptance of S. The program has been carried through for a schematic system of non-finitist arithmetic NFA in Feferman and Strahm (Ann Pure Appl Log, 104(1–3):75–96, 2000) and for a system FA (with and without Bar rule) in Feferman and Strahm (Rev Symb Log, 3(4):665–689, 2010). The present contribution elucidates the concept of unfolding for a basic schematic system FEA of feasible arithmetic. Apart from the operational unfolding U0(FEA) of FEA, we study two full unfolding notions, namely the predicate unfolding U(FEA) and a more general truth unfolding UT(FEA) of FEA, the latter making use of a truth predicate added to the language of the operational unfolding. The main results obtained are that the provably convergent functions on binary words for all three unfolding systems are precisely those being computable in polynomial time. The upper bound computations make essential use of a specific theory of truth TPT over combinatory logic, which has recently been introduced in Eberhard and Strahm (Bull Symb Log, 18(3):474–475, 2012) and Eberhard (A feasible theory of truth over combinatory logic, 2014) and whose involved proof-theoretic analysis is due to Eberhard (A feasible theory of truth over combinatory logic, 2014). The results of this paper were first announced in (Eberhard and Strahm, Bull Symb Log 18(3):474–475, 2012).

Inversion, Obviation, and Animacy in Native Languages of the Americas: Elements for a Cross-linguistic Survey

Native languages of the Americas whose predicate and clause structure reflect nominal hierarchies show an interesting range of structural diversity not only with respect to morphological makeup of their predicates and arguments but also with respect to the factors governing obviation status. The present article maps part of such diversity. The sample surveyed here includes languages with some sort of nonlocal (third person acting on third person) direction-marking system.