Towards a semantic typology of specific determiners

This paper investigates properties of a class of determiners which can be loosely la- belled specific in that their distribution falls in between maximally-quantifying definite determiners and indefinites which only contribute existential quantification. Based on a sample which includes data from Buryat, Komi, Mari, Mordvin, and Turkish, I propose that suffixal determiners form a semantically natural class in that their distribution can be modelled by means of a relational component in the semantics of the determiners which relates the denotation of the noun to an antecedent. I derive the observed distributional differences between languages from the range of values available for the interpretation of this component. In particular, whether a relation of identity falls within the range of val- ues has consequences for whether a suffixal determiner triggers existence presupposition, which, in turn, has consequences both for the interpretation of the DP in question and for the inter-paradigm competition in a language

Relation-Changing Logics as Fragments of Hybrid Logics

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to hybrid logic along with an implementation. In general, these logics are undecidable, but we use our translations to identify decidable fragments. We also compare the expressive power of relation-changing modal logics with hybrid logics.Comment: In Proceedings GandALF 2016, arXiv:1609.0364

Automata theory in nominal sets

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an automorphism group of the alphabet. In the process, we generalize nominal sets due to Gabbay and Pitts

Using Visualization to Support Data Mining of Large Existing Databases

In this paper. we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provide visual support not only for the query specification process. but also for evaluating query results and. thereafter, refining the query accordingly. The main idea of our system is to represent as many data items as possible by the pixels of the display device. By arranging and coloring the pixels according to the relevance for the query, the user gets a visual impression of the resulting data set and of its relevance for the query. Using an interactive query interface, the user may change the query dynamically and receives immediate feedback by the visual representation of the resulting data set. By using multiple windows for different parts of the query, the user gets visual feedback for each part of the query and, therefore, may easier understand the overall result. To support complex queries, we introduce the notion of approximate joins which allow the user to find data items that only approximately fulfill join conditions. We also present ideas how our technique may be extended to support the interoperation of heterogeneous databases. Finally, we discuss the performance problems that are caused by interfacing to existing database systems and present ideas to solve these problems by using data structures supporting a multidimensional search of the database

Satisfiability for relation-changing logics

Relation-changing modal logics (RC for short) are extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula. These languages are equipped with dynamic modalities that are able e.g. to delete, add and swap edges in the model, both locally and globally. We study the satisfiability problem for some of these logics.We first show that they can be translated into hybrid logic. As a result, we can transfer some results from hybrid logics to RC. We discuss in particular decidability for some fragments. We then show that satisfiability is, in general, undecidable for all the languages introduced, via translations from memory logics.Fil: Areces, Carlos Eduardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; ArgentinaFil: Fervari, Raul Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; ArgentinaFil: Hoffmann, Guillaume Emmanuel. Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía y Física. Sección Ciencias de la Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; ArgentinaFil: Martel, Mauricio. Universitat Bremen; Alemani

A Behavioral Account of the Labor Market: The Role of Fairness Concerns

In this paper, we argue that important labor market phenomena can be better understood if one takes (i) the inherent incompleteness and relational nature of most employment contracts and (ii) the existence of reference-dependent fairness concerns among a substantial share of the population into account. Theory shows and experiments confirm, that even if fairness concerns were only to exert weak effects in one-shot interactions, repeated interactions greatly magnify the relevance of such concerns on economic outcomes. We also review evidence from laboratory and field experiments examining the role of wages and fairness on effort, derive predictions from our approach for entry-level wages and incumbent workers' wages, confront these predictions with the evidence, and show that reference-dependent fairness concerns may have important consequences for the effects of economic policies such as minimum wage laws.fairness, contracts, wages, effort, experiments