Search

The underlying uncertainty in digital humanities research data affects decision-making and persists during a project's lifecycle. This uncertainty is inevitable since most empirical claims cannot be assessed against an absolute truth (Drucker 2011; Binder et al. 2014). This situation has been previously recognized together with the need to report the degrees of uncertainty that accompany such claims (Blau 2011). Although TEI makes it possible to annotate text with notions of certainty or precision, examples of actual projects taking advantage of this are scarce. There are many possible explanations for uncertainty's lack of visibility in computationally supported humanities research; among them, the need for tools speciffically designed to address the goal of defining and managing uncertainty stands out. Thus, efforts to provide technical support for humanities research should focus on managing and making uncertainty more transparent, rather than removing it. Another challenge is the fact that there is no agreement on a generic taxonomy for the different types of uncertainty that researchers may face. Various researchers across disciplines, working on varying projects and data sets, can use different categories to classify the uncertainties present in a particular case. In this paper, we introduce a collaborative platform for collective annotation of TEI data sets. We briefly present the flexible taxonomy of uncertainty used in the platform and describe two data sets used for its testing. Then we describe use cases of annotations available on the platform, and how they translate into TEI annotations. Creating and interpreting annotations with and without uncertainty should now be easier, especially for researchers who do not know TEI markup. [ABSTRACT FROM AUTHOR]

This paper introduces the Electronic Repository of Greater Poland Oaths, eROThA (1386–1446), a digitisation project of a diplomatic edition of mediaeval land court oaths recorded in Latin and Old Polish, resulting in a small, lightly tagged specialised bilingual corpus. We present the background, aims, design and methodology of the project. We also discuss the problems and limitations entrenched in turning a printed diplomatic edition into a machine-readable diplomatic edition equipped with a new interpretative layer that is sensitive to the switches between Latin and Old Polish. In addition to the automatic annotation of code-switched items on the basis of typographic characteristics of the printed edition, flexible coding of recurrent language and discourse boundary phenomena has been introduced manually to account for linguistically ambiguous or neutral forms. The project offers a fully multilingual corpus, as well as customised Polish-only and Latin-only datasets, and enables filtered metadata searches in the online front-end. Overall, the report presents a methodology for constructing multilingual corpora in the context of legal cultures in medieval Central Europe that may be extrapolated to datasets originating in other periods and regions. [ABSTRACT FROM AUTHOR]

We study the sequent system mentioned in the author's work as CyInFL with 'intuitionistic' sequents. We explore the connection between this system and symmetric constructive logic of Zaslavsky and develop an algebraic semantics for both of them. In contrast to the previous work, we prove the strong completeness theorem for CyInFL with 'intuitionistic' sequents and all of its basic variants, including variants with contraction. We also show how the defined classes of structures are related to cyclic involutive FL-algebras and Nelson FLew-algebras. In particular, we prove the definitional equivalence of symmetric constructive FLewc-algebras (algebraic models of symmetric constructive logic) and Nelson FLew-algebras (algebras introduced by Spinks and Veroff , as the termwise equivalent definition of Nelson algebras). Because of the strong completeness theorem that covers all basic variants of CyInFL with 'intuitionistic' sequents, we rename this sequent system to symmetric constructive full Lambek calculus ( [ABSTRACT FROM AUTHOR]

We prove the decidability of the extension CyInDFL of DFL (Distributive Full Lambek Calculus), in which the involutive law is derivable under the assumption of cyclicity. So far, the decidability of this logic has been an open problem (Galatos et al., 2007, Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Elsevier).We present a Gentzen-style consecution calculus which is complete with respect to the class of cyclic involutive distributive full Lambek algebras (CyInDFL). It is an extension of the system DFL introduced by the author (2009, Stud. Log., 91, 201–216).We prove the cut elimination theorem for this system, and give a procedure of building a finite proof-search tree for any consecution. [ABSTRACT FROM PUBLISHER]