-
In this paper we investigate the fragment of intuitionistic
logic which only uses conjunction (meet) and implication, using nite
duality for distributive lattices and universal models. We give a description
of the nitely generated universal models of this fragment and give a
complete characteriza...
-
-
We present a technique called event mapping that allows to project text representations into event lists, produce an event table, and derive quantitative conclusions to compare the text representations. The main application of the technique is the case where two classes of text representations ha...
-
We investigate proof theoretic properties of logical systems via
algebraic methods. We introduce a calculus for deriving
multiple-conclusion rules and show that it is a Hilbert style
counterpart of hyper-sequent calculi. Using step-algebras we develop a
criterion establishing the bounded proof pr...
-
In this article we investigate the positive, i.e.\ $\neg,\bot$-free formulas of intuitionistic propositional and predicate logic, IPC and IQC, and minimal logic, MPC and MQC. For each formula $\varphi$ of IQC we define the positive formula $\varphi^+$ that represents the positive content of $\var...
-
Keywords: modal logic; second order set theory; inner models; cofinal subframe formulas
-
We introduce stable canonical rules and prove that each normal modal rule system is axiomatizable by stable canonical rules. This solves an open problem of Jerabek [13, p. 1204]. We apply these results to construct finite refutation patterns for each modal formula that is not derivable in the bas...
-
We introduce a general framework for reasoning about dynamic processes within social networks, such as diffusion phenomena. First, we define the new Dynamic Social Networks Logic, a dynamic extension of standard hybrid modal logic. We then provide a complete axiomatization for this logic and give...
-
The generalized models for higher-order logics introduced by Leon
Henkin, and their multiple offspring over the years, have become a
standard tool in many areas of logic. Even so, discussion has
persisted about their technical status, and perhaps even their
conceptual legitimacy. This paper gives...
-
Crowdsourcing is an important tool, e.g., in computational
linguistics and computer vision, to effciently label large
amounts of data using nonexpert annotators. The individual
annotations collected need to be aggregated into a single
collective annotation. The hope is that the quality of
this ...
-
We investigate methods for aggregating the judgements
of multiple individuals in a linguistic annotation task into
a collective judgement. We define several aggregators
that take the reliability of annotators into account and
thus go beyond the commonly used majority vote, and
we empirically anal...