k --Universal Finite Graphs

This paper investigates the class of k-universal finite graphs, a local analog of the class of universal graphs, which arises naturally in the study of finite variable logics. The main results of the paper, which are due to Shelah, establish that the class of k-universal graphs is not definable by an infinite disjunction of first-order existential sentences with a finite number of variables and that there exist k-universal graphs with no k-extendible induced subgraphs

Introduction to the Ignatian Pedagogical Paradigm: An Online Course for Librarians

This article discusses the development and delivery of a three-week asynchronous online course in Jesuit history, education, and the Ignatian Pedagogical Paradigm (IPP) for librarians working in Association of Jesuit Colleges and University (AJCU) institutions. Created by two instruction librarians and one instructional designer from a pair of AJCU institutions, the course explores incorporating the IPP—a contemplative learning model—into a one-shot, single class library instruction session. Included is a practical description of the development, revision, marketing, and success of the online course, along with a list of the class contents. Over three course offerings in 2017 and 2018, thirty-one participants discussed readings and videos, and shared ideas about their current teaching practices. They reflected on how the IPP, or at least some elements of it, might become part of their teaching, despite the time and content constraints. Other topics included the Association of College and Research Libraries (ACRL) “Framework for Information Literacy in Higher Education,” critical librarianship, and social justice. The intent of the article is to raise awareness of the course for interested librarians and to offer guidance to anyone working to develop an online course related to Ignatian pedagogy and teaching

Morpheme combinatorics of compound words through Box Embeddings

In this study I probe the combinatoric properties of Japanese morphemes that participate in compounding. By representing morphemes through box embeddings (Vilnis et al., 2018; Patel et al., 2020; Li et al., 2019), a model learns preferences for one morpheme to combine with another in two-member compounds. These learned preferences are represented by the degree to which the box-hyperrectangles for two morphemes overlap in representational space. After learning, these representations are applied to test how well they encode a speaker’s knowledge of the properties of each morpheme that predict the plausibility of novel compounds in which they could occur

Inflectional paradigms as interacting systems

In the framework of Gradient Symbolic Computation, (Smolensky and Goldrick, 2016), we present a model that predicts correct forms in complex inflectional paradigms through a single underlying form for a lexeme along with underlying forms for certain morphosyntactic combinations. Output-Output Correspondence constraints (Burzio, 1996; Benua, 1997; Burzio, 1999) capture interdependencies between forms in different paradigm cells. Our model avoids complex sets of rules as well as the need to index lexemes to inflectional classes. Instead, the ways that an exponent can vary across lexemes derive from a lexeme\u27s underlying representation, which can contain partially-activated blends of segments. This approach takes advantage of a blurring of the distinction between stems and affixes and evaluates MAX Faithfulness constraints across a whole paradigm rather than separately for each word form. We present a neural-based gradient ascent algorithm for learning weights and activations that correctly predict output forms, by optimizing the Harmony of a whole paradigm