We introduce an atomic formula ${\vec{y} \bot_{\vec{x}}\vec{z}}$ intuitively saying that the variables ${\vec{y}}$ are independent from the variables ${\vec{z}}$ if the variables ${\vec{x}}$ are kept constant. We contrast this with dependence logic ${\mathcal{D}}$ based on the atomic formula = ${(\vec{x}, \vec{y})}$ , actually equivalent to ${\vec{y} \bot_{\vec{x}}\vec{y}}$ , saying that the variables ${\vec{y}}$ are totally determined by the variables ${\vec{x}}$ . We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ gives rise to a natural logic capable of formalizing basic intuitions about independence and dependence. (...) We show that ${\vec{y} \bot_{\vec{x}}\vec{z}}$ can be used to give partially ordered quantifiers and IF-logic an alternative interpretation without some of the shortcomings related to so called signaling that interpretations using = ${(\vec{x}, \vec{y})}$ have. (shrink)

Gerechtigkeit gilt als Kardinaltugend für ein gutes und richtiges Leben. Was aber bedeutet sie inhaltlich und wie lässt sie sich begründen? Der gedankliche Mittelpunkt der Darstellung ist die epochale Neubestimmung der Gerechtigkeit durch John Rawls. Seine Theorie der Gerechtigkeit hat zu vielen Diskussionen, Weiterführungen und Gegenentwürfen Anlass gegeben, die exemplarisch vorgestellt und vier Fragestellungen zugeordnet werden: Ist ein Gesellschaftsvertrag als Grundvoraussetzung der Theorie unabdingbar? Muss nicht die Gemeinschaft als Ort der Gerechtigkeitsvorstellungen stärker betont werden? Ist der Stellenwert, den Rawls der (...) Gleichheit zuschreibt, angemessen? Gewährt er der Freiheit einen adäquaten Raum? Den Abschluss bildet ein argumentationsethischer situationsbezogener Ansatz. (shrink)

Guarded fragments of first-order logic were recently introduced by Andreka, van Benthem and Nemeti; they consist of relational first-order formulae whose quantifiers are appropriately relativized by atoms. These fragments are interesting because they extend in a natural way many propositional modal logics, because they have useful model-theoretic properties and especially because they are decidable classes that avoid the usual syntactic restrictions (on the arity of relation symbols, the quantifier pattern or the number of variables) of almost all other known decidable (...) fragments of first-order logic. Here, we investigate the computational complexity of these fragments. We prove that the satisfiability problems for the guarded fragment (GF) and the loosely guarded fragment (LGF) of first-order logic are complete for deterministic double exponential time. For the subfragments that have only a bounded number of variables or only relation symbols of bounded arity, satisfiability is EXPTIME-complete. We further establish a tree model property for both the guarded fragment and the loosely guarded fragment, and give a proof of the finite model property of the guarded fragment. It is also shown that some natural, modest extensions of the guarded fragments are undecidable. (shrink)

We identify the computational complexity of the satisfiability problem for FO 2 , the fragment of first-order logic consisting of all relational first-order sentences with at most two distinct variables. Although this fragment was shown to be decidable a long time ago, the computational complexity of its decision problem has not been pinpointed so far. In 1975 Mortimer proved that FO 2 has the finite-model property, which means that if an FO 2 -sentence is satisfiable, then it has a finite (...) model. Moreover, Mortimer showed that every satisfiable FO 2 -sentence has a model whose size is at most doubly exponential in the size of the sentence. In this paper, we improve Mortimer's bound by one exponential and show that every satisfiable FO 2 -sentence has a model whose size is at most exponential in the size of the sentence. As a consequence, we establish that the satisfiability problem for FO 2 is NEXPTIME-complete. (shrink)

It is a classical result of Mortimer that $L^2$ , first-order logic with two variables, is decidable for satisfiability. We show that going beyond $L^2$ by adding any one of the following leads to an undecidable logic:– very weak forms of recursion, viz.¶(i) transitive closure operations¶(ii) (restricted) monadic fixed-point operations¶– weak access to cardinalities, through the Härtig (or equicardinality) quantifier¶– a choice construct known as Hilbert's $\epsilon$ -operator.In fact all these extensions of $L^2$ prove to be undecidable both for satisfiability, (...) and for satisfiability in finite structures. Moreover most of them are hard for $\Sigma^1_1$ , the first level of the analytical hierachy, and thus have a much higher degree of undecidability than first-order logic. (shrink)

From time to time medical ethicists bemoan the loss of a religious perspective in medical ethics. The discipline had its origins in the thinking of explicitly religious thinkers such as Paul Ramsey and Joseph Fletcher. Furthermore, many of those who contributed to the early development of the discipline had training in theology. One thinks of Daniel Callahan, Richard McCormick, Albert Jonsen, Sam. Banks. As the discipline becomes more and more self-reflective, with attention being paid to methodological and conditional concerns, it (...) is only natural that the roots are due for a reexamination. The time has therefore come for some reassessment. The first steps here are taken in the form of a dialogue between the coauthors to clarify authentic contributions and weed out unauthentic ones. (shrink)

Exploratory analysis is an area of increasing interest in the computational linguistics arena. Pragmatically speaking, exploratory analysis may be paraphrased as natural language processing by means of analyzing large corpora of text. Concerning the analysis, appropriate means are statistics, on the one hand, and artificial neural networks, on the other hand. As a challenging application area for exploratory analysis of text corpora we may certainly identify text databases, be it information retrieval or information filtering systems. With this paper we present (...) recent findings of exploratory analysis based on both statistical and neural models applied to legal text corpora. Concerning the artificial neural networks, we rely on a model adhering to the unsupervised learning paradigm. This choice appears naturally when taking into account the specific properties of large text corpora where one is faced with the fact that input-output-mappings as required by supervised learning models cannot be provided beforehand to a satisfying extent. This is due to the fact of the highly changing contents of text archives. In a nutshell, artificial neural networks count for their highly robust behavior regarding the parameters for model optimization. In particular, we found statistical classification techniques much more susceptible to minor parameter variations than unsupervised artificial neural networks. In this paper we describe two different lines of research in exploratory analysis. First, we use the classification methods for concept analysis. The general goal is to uncover different meanings of one and the same natural language concept. A task that, obviously, is of specific importance during the creation of thesauri. As a convenient environment to present the results we selected the legal term of neutrality, which is a perfect representative of a concept having a number of highly divergent meanings. Second, we describe the classification methods in the setting of document classification. The ultimate goal in such an application is to uncover semantic similarities of various text documents in order to increase the efficiency of an information retrieval system. In this sense, document classification has its fixed position in information retrieval research from the very beginning. Nowadays renewed massive interest in document classification may be witnessed due to the appearance of large-scale digital libraries. (shrink)

The contextual contributions to meaning are at the core of the debate about the semantics/pragmatics distinction, one of the liveliest topics in current philosophy of language and linguistics. The controversy between semantic minimalists and contextualists regarding context and semantic content is a conspicuous example of the debate's relevance. This collection of essays, written by leading philosophers as well as talented young researchers, offers new approaches to the ongoing discussion about the status of lexical meaning and the role of context dependence (...) in linguistic theorizing. It covers a broad range of issues in semantics and pragmatics such as presuppositions, reference, lexical meaning, discourse relations and information structure, negation, and metaphors. The book is an essential reading for philosophers, linguists, and graduate students of philosophy of language and linguistics. (shrink)

We show that the existential preservation theorem fails for two-variable first-order logic FO2. It is known that for all k ≥ 3, FOk does not have an existential preservation theorem, so this settles the last open case, answering a question of Andreka, van Benthem, and Németi. In contrast, we prove that the homomorphism preservation theorem holds for FO2.

We establish a general hierarchy theorem for quantifier classes in the infinitary logic L∞ωωon finite structures. In particular, it is shown that no infinitary formula with bounded number of universal quantifiers can express the negation of a transitive closure.This implies the solution of several open problems in finite model theory: On finite structures, positive transitive closure logic is not closed under negation. More generally the hierarchy defined by interleaving negation and transitive closure operators is strict. This proves a conjecture of (...) Immerman.We also separate the expressive power of several extensions of Datalog, giving new insight in the fine structure of stratified Datalog. (shrink)

Bd. 1-2. Medizinische Schriften.--Bd. 3. Philosophische Schriften.--Bd. 4. Theologische, religionsphilosophische und sozialpolitische Schriften.--Bd. 5. Pansophische, magische und gabalische Schriften.

In the study of Pali metres, abundant research has been conducted on the establishment of rules and taxonomy, and scanning of unscanned verses. In comparison, the stylistic aspects of metres have been somewhat neglected. When the audiences listen to verses with their ears only set for metrical rules but not also the interplay of various rhythmic patterns, they fail to fully capture the aesthetic beauty and the very philosophical messages embedded in them. Taking the verses in the Dasanipata of the (...) Theragatha as examples, this article focuses on the stylistic interplay of rhythmic uniformity and change in the expression of core messages in a Pali poem. It aims to unveil the poets’ strategies in the use of various types of metres and prosodic elements (opening, trimetre break, caesura and cadence) to create the narrative style of each poem and draw the audiences’ attention to the Buddha’s key teachings in the verses. (shrink)

Science and technology policy is often confronted with issues that are both complex and controversial and which have to be decided upon in a delicate constellation of policy-makers, experts, stakeholders, non-governmental organizations and the public. One attempt to deal with such a complex problem is via citizen involvement. Participatory technology assessment (pTA) already goes back to several decades, and countries have made various experiences. While in some countries, governments established technology assessment organizations, which also included pTA in their methodological portfolio, (...) others primarily rely on experts to make decisions on science and technology policy. In a third group of countries non-state actors, such as social scientists, experimented with pTA. However, they were often unable to link these experiments to policy-making. This paper deals with the question of why this variation exists and compares the use of pTA in Switzerland and Austria. Despite similarities between the two countries, both had quite different experiences with pTA so far. Whereas several pTAs have been carried out in Switzerland until today, Austrian pTAs have remained infrequent. The aim of this paper is to explain this difference as a result of different ways of policy-making which affect the use and chances of pTA. (shrink)