fusion theory challenges efforts to see theory as inhibiting by presenting an approach that is innovative, eclectic, and subtle in order to draw out competing and constellating ideas and opinions. This collected volume of essays examines fusion theory and demonstrates how the theory can be applied to the reading of various works of Indian English novelists.

We show, under the assumption that factoring is hard, that a model of PV exists in which the polynomial hierarchy does not collapse to the linear hierarchy; that a model of S21 exists in which NP is not in the second level of the linear hierarchy; and that a model of S21 exists in which the polynomial hierarchy collapses to the linear hierarchy. Our methods are model-theoretic. We use the assumption about factoring to get a model in which the weak (...) pigeonhole principle fails in a certain way, and then work with this failure to obtain our results. As a corollary of one of the proofs, we also show that in S21 the failure of WPHP (for Σb1 definable relations) implies that the strict version of PH does not collapse to a finite level. (shrink)

We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in , it characterizes the consequences of and that natural restrictions of it characterize the consequences of and of the bounded arithmetic hierarchy. We also show that over V0 it characterizes the consequences of V1 and hence that, in some sense, a miniaturized version of the principle gives a new characterization of the consequences of . Throughout our search (...) problems are “type-2” NP search problems, which take second-order objects as parameters. (shrink)

The theory , axiomatized by the induction scheme for sharply bounded formulae in Buss’ original language of bounded arithmetic , has recently been unconditionally separated from full bounded arithmetic S2. The method used to prove the separation is reminiscent of those known from the study of open induction.We make the connection to open induction explicit, showing that models of can be built using a “nonstandard variant” of Wilkie’s well-known technique for building models of IOpen. This makes it possible to transfer (...) many results and methods from open to sharply bounded induction with relative ease.We provide two applications: the Shepherdson model of IOpen can be embedded into a model of , which immediately implies some independence results for ; extended by an axiom which roughly states that every number has a least 1 bit in its binary notation, while significantly stronger than plain , does not prove the infinity of primes. (shrink)

Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic [3] we show that there exists a number n such that ⋃m Sm (the union of the bounded arithmetic theories Sm) does not prove the Herbrand consistency of the finitely axiomatizable theory $S_{3}^{n}$.

The paper discusses the notion of finite model truth definitions (or FM-truth definitions), introduced by M. Mostowski as a finite model analogue of Tarski's classical notion of truth definition. We compare FM-truth definitions with Vardi's concept of the combined complexity of logics, noting an important difference: the difficulty of defining FM-truth for a logic ᵍ does not depend on the syntax of L, as long as it is decidable. It follows that for a natural ᵍ there exist FM-truth definitions whose (...) evaluation is much easier than the combined complexiy of ᵍ would suggest. We apply the general theory to give a complexity-theoretical characterization of the logics for which the $\Sigma_{m}^{d}$ classes (prenex classes of higher order logics) define FM-truth. For any $d \geq 2.m \geq 1$ we construct a family $\{[\Sigma_{m}^{d}]^{\leg\kappa}\}\kappa\in\omega$ of syntactically defined fragments of $\Sigma_{m}^{d}$ which satisfy this characterization. We also use the $[\Sigma_{m}^{d}]\leg\kappa$ classes to give a refinement of known results on the complexity classes captured by $\Sigma_{m}^{d}$ . We close with a few simple corollaries, one of which gives a sufficient condition for the existence, given a vocabulary $\sigma$ , of a fixed number $\kappa$ such that model checking for all first order sentences over $\sigma$ can be done in deterministic time $n^{\kappa}$. (shrink)

One of the most influential views in privacy scholarship is that privacy protects individual autonomy. On the early liberal view, the exercise of autonomy requires detachment from social and political life and privacy facilitates it. This view of privacy still informs current legal and political practice. As this view of privacy presupposes a tension between privacy and society, it is responsible for the underrating of privacy in legal and political practice. Over the last decades, liberal reflection on autonomy has shifted (...) from the early liberal understanding of autonomy as calling for detachment from social life to the idea of autonomy as socially embedded. This development has brought about a corresponding adjustment in the liberal concept of privacy: privacy has come to be seen as a social rather than merely an individual interest. The social turn in thinking about privacy has gone a long way to change the problematic image of privacy in legal and political practice. It has not gone far enough, however, to draw conclusions regarding the political relevance of privacy. I argue that we should understand autonomy as politically embedded. Revised along these lines, privacy has a political value: when we claim privacy, we do not make a claim to withdraw from political life, but rather make a claim to protect certain forms of political engagement. (shrink)

We show that the arithmetical theory -INDx5, formalized in the language of Buss, i.e. with x/2 but without the MSP function x/2y, does not prove that every nontrivial divisor of a power of 2 is even. It follows that this theory proves neither NP=coNP nor.

The paper presents the theological and philosophical category of Deus absconditus and shows it in the perspective of Nicholas of Cusa’s ideas contained in his dialogue De Deo Abscondito. The hidden God is the totally transcendent God that is beyond creation both ontologically and logically. Deus absconditus is God that cannot be the object of rational cognition and positive knowledge, hence the only way to acquire any knowledge of him is the method of negative theology. Therefore, the hidden God is (...) the subject of mystical epistemology. Cusanus’s Deus absconditus is also called Truth and as such he is not only incomprehensible, but also incommunicable. God’s transcendence, rational unintelligibility and inexpressibility are the aspects which the considerations presented in this paper build on. (shrink)

Quality in clinical research may be defined as compliance with requirements together with credibility and reliability of the data obtained. Sponsors usually apply Quality Management Systems (QMS) to ensure, control, maintain, and improve quality. These systems encompass several preventive measures, tools, and controls. Standard QMS applied by clinical research sponsors may be based on ISO 9000.

We use finite model theory to prove:Let m ≥ 2. Then: If there exists k such that NP ⊆ σmTIME ∩ ΠmTIME, then for every r there exists kr such that PNP[nr] ⊆ σmTIME ∩ ΠmTIME; If there exists a superpolynomial time-constructible function f such that NTIME ⊆ Σpm ∪ Πpm, then additionally PNP[nr] ⊈ Σpm ∪ Πpm.This strengthens a result by Mocas [M96] that for any r, PNP[nr] ⊈ NEXP.In addition, we use FM-truth definitions to give a simple sufficient (...) condition for the σ11 arity hierarchy to be strict over finite models. (shrink)

Inferential erotetic logic and inquisitive semantics give accounts of questions and model various aspects of questioning. In this paper we concentrate upon connections between inquisitiveness, being the core concept of INQ, and question raising, characterized in IEL by means of the concepts of question evocation and erotetic implication. We consider the basic system InqB of INQ, remain at the propositional level and show, inter alia, that: a disjunction of all the direct answers to an evoked question is always inquisitive; a (...) formula is inquisitive if, and only if it evokes a yes–no question whose affirmative answer expresses a possibility for the formula; inquisitive formulas evoke questions whose direct answers express all the possibilities for the formulas, and each question erotetically implies a question whose direct answers express the possibilities for the direct answers to the implying question. (shrink)

This article provides an insight into the expression of reportative evidentiality in Spanish scientific articles published between 1799 and 1920. Central to the discussion is the presence and specificity of sources in reportative constructions. While contemporary scientific discourse prioritizes the use of specific, reportative-quotative evidentials, this is not a constant feature of articles analyzed in this study. In order to trace this historical variation, we established a classification of reportative constructions according to the specificity of the evidence they convey and (...) we conducted both qualitative and quantitative analyses. According to our results, different specificity patterns were prominent in different temporal stages of the period under review. We argue that this can be interpreted in light of the growth and changing practices of the scientific community. (shrink)

We investigate a generalization of discrete-time integrator. Proposed linear discrete-time integrator is characterised by the variable, fractional order of integration/summation. Graphical illustrations of an analysis of particular vector matrices are presented. In numerical examples, we show relations between the order functions and element responses.

We prove that: • if there is a model of I∆₀ + ¬ exp with cofinal Σ₁-definable elements and a Σ₁ truth definition for Σ₁ sentences, then I∆₀ + ¬ exp +¬BΣ₁ is consistent, • there is a model of I∆₀ Ω₁ + ¬ exp with cofinal Σ₁-definable elements, both a Σ₂ and a ∏₂ truth definition for Σ₁ sentences, and for each n > 2, a Σ n truth definition for Σ n sentences. The latter result is obtained by (...) constructing a model with a recursive truth-preserving translation of Σ₁ sentences into boolean combinations of $\exists \sum {\begin{array}{*{20}{c}} h \\ 0 \\ \end{array} } $ sentences. We also present an old but previously unpublished proof of the consistency of I∆₀ + ¬ exp + ¬BΣ₁ under the assumption that the size parameter in Lessan's ∆₀ universal formula is optimal. We then discuss a possible reason why proving the consistency of I∆₀ + ¬ exp + ¬BΣ₁ unconditionally has turned out to be so difficult. (shrink)

The article engages with the video installation Madame B by Mieke Bal and Michelle Williams Gamaker. The work was premiered in the city of Łódź in Poland. The author makes use of the exhibition brochure by two artists published by the Museum of Modern Art, and the recording of a seminar held by Bal and Williams Gamaker after launching their work. The article focuses on the innovative audiovisual interpretation of Flaubert’s famous novel. Basing the argument on the concept of framing (...) created by Bal, the author applies it to Bal and Williams Gamaker’s exhibition by relating it to the history and culture of the Polish location where it was first shown. Above all, however, the article discusses the importance of quotation and indistinction in Madame B, where the artists quote from : Louise Bourgeois, Maya Deren, Artemisia Gentileschi, Charlotte Perkins Gilman, William Kentridge and Sol LeWitt. (shrink)

D’Aquino et al. (J Symb Log 75(1):1–11, 2010) have recently shown that every real-closed field with an integer part satisfying the arithmetic theory IΣ4 is recursively saturated, and that this theorem fails if IΣ4 is replaced by IΔ0. We prove that the theorem holds if IΣ4 is replaced by weak subtheories of Buss’ bounded arithmetic: PV or ${\Sigma^b_1-IND^{|x|_k}}$ . It also holds for IΔ0 (and even its subtheory IE 2) under a rather mild assumption on cofinality. On the other hand, (...) it fails for the extension of IOpen by an axiom expressing the Bézout property, even under the same assumption on cofinality. (shrink)

The concept of cooperative question-responses as an extension of cooperative behaviours used by interfaces for databases and information systems is proposed. A procedure to generate question-responses based on question dependency and erotetic search scenarios is presented. The procedure is implemented in Prolog.

Author: Kołodziejczyk Sebastian Tomasz Title: ON THE MUTUAL RELATIONSHIP BETWEEN THE CONCEPT OF BEING AND THE PLURALITY OF METAPHYSICAL DISCOURSES (O związkach między wielością dyskursów metafizycznych a pojęciem bytu) Source: Filo-Sofija year: 2011, vol:.15, number: 2011/4, pages: 865-880 Keywords: METAPHYSICS, ARISTOTLE, BEING, CONCEPT OF BEING, CATEGORIES, UNIVERSALS, PARTICULARS, PARTICULARITY Discipline: PHILOSOPHY Language: POLISH Document type: ARTICLE Publication order reference (Primary author’s office address): E-mail: www:The aim of the paper is to argue that there is a mutual relationship between the concept (...) of being as it is conceived of in the classical Aristotelian metaphysics and the plurality of possible metaphysical discourses. That thesis is rooted in the inherent ambiguity of the concept of being and some consequences connected therewith. Three forms of metaphysical thinking are taken into account: the metaphysics of formal interpretation of the concept of being, metaphysics of existential determination of being, and metaphysics of the material content of every conceptual representation of being. (shrink)

Much of the debate concerning political obligation deals with the question of which, if any, moral principles could make obedience to the directives of the government a matter of obligation. What makes political obligation political has not received attention in the literature on the topic. In this article I argue that the lack of systematic reflection on what makes political obligation political is responsible for the failure of a number of influential theories of political obligation. I demonstrate this failure using (...) the consent theory of political obligation as my major example. I conclude my analysis by formulating some positive conditions that a successful principle of political obligation should satisfy. (shrink)

Written by a select international group of leading privacy scholars, Social Dimensions of Privacy endorses and develops an innovative approach to privacy. By debating topical privacy cases in their specific research areas, the contributors explore the new privacy-sensitive areas: legal scholars and political theorists discuss the European and American approaches to privacy regulation; sociologists explore new forms of surveillance and privacy on social network sites; and philosophers revisit feminist critiques of privacy, discuss markets in personal data, issues of privacy in (...) health care and democratic politics. The broad interdisciplinary character of the volume will be of interest to readers from a variety of scientific disciplines who are concerned with privacy and data protection issues. (shrink)

Rethinks the existing definitions of aesthetics and ethics and the relations between them.

In the paper I try to sketch the pragmatic centrality of the three Aristotle’s properties for bridging the gap between the obscurity and comprehensibility of metaphors.

For any n, we construct a model of in which each formula is equivalent to an formula.

Principal Component Analysis is one of the data mining methods that can be used to analyze multidimensional datasets. The main objective of this method is a reduction of the number of studied variables with the mainte- nance of as much information as possible, uncovering the structure of the data, its visualization as well as classification of the objects within the space defined by the newly created components. PCA is very often used as a preliminary step in data preparation through the (...) creation of independent components for further analysis. We used the PCA method as a first step in analyzing data from IVF. The next step and main purpose of the analysis was to create models that predict pregnancy. Therefore, 805 different types of IVF cy- cles were analyzed and pregnancy was correctly classified in 61-80% of cases for different analyzed groups in obtained models. (shrink)

Intrauterine insemination is one of many treatments provided to infertility patients. Many factors such as, but not limited to, quality of semen, the age of a woman, and reproductive hormone levels contribute to infertility. Therefore, the aim of our study is to establish a statistical probability concerning the prediction of which groups of patients have a very good or poor prognosis for pregnancy after IUI insemination. For that purpose, we compare the results of two analyses: Cluster Analysis and Kohonen Neural (...) Networks. The k-means algorithm from the clustering methods was the best to use for selecting patients with a good prognosis but the Kohonen Neural Networks was better for selecting groups of patients with the lowest chances for pregnancy. (shrink)

The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an application of the SP-method is a sequence of questions, called a Socratic transformation. Our aim is to give a method of translation of Socratic transformations into trees. We address this issue both conceptually and by providing certain algorithms. We show that the trees which correspond to successful Socratic transformations—that is, to Socratic proofs—may be regarded, after a slight modification, as Gentzen-style proofs. (...) Thus proof-search for some Gentzen-style calculi can be performed by means of the SP-method. At the same time the method seems promising as a foundation for automated deduction. (shrink)

Doktryna Bożej prostoty przez wieki znajdowała się w sercu teologii chrześcijańskiej. W dojrzałej myśli św. Tomasza z Akwinu prostota zajmuje pośród Boskich atrybutów uprzywilejowane miejsce. Byt prosty — czy też całkowicie prosty — to taki, który nie posiada żadnych części czy składników. To, że Bóg jest całkowicie prosty, oznacza, że nie wykazuje On żadnego z siedmiu wyszczególnionych przez Tomasza złożeń. Argumenty, jakimi św. Tomasz uzasadnia tezę o Bożej prostocie, podzielić można na cztery typy, które nazwałem: argumentem z braku możności, argumentem (...) z uprzedniości części wobec całości, argumentem z uprzedniego twórcy oraz argumentem z doskonałości. Wszystkie one za punkt wyjścia przyjmują utożsamienie Boga z pierwszą przyczyną wszystkich rzeczy. Dodają do tego charakterystyczne dla siebie przesłanki. Pierwszy — że pierwsza przyczyna nie posiada możności, a każdy byt złożony musi ją posiadać. Drugi — że wszystko, co złożone jest zależne od swoich części, a pierwsza przyczyna nie jest od niczego zależna. Trzeci — że wszystko, co złożone wymaga czynnika sprawczego lub wyjaśnienia, a pierwsza przyczyna go nie posiada. Czwarty — że pierwsza przyczyna jest bytem doskonale dobrym, a byt taki nie może być złożony. W świetle przeprowadzonych analiz pierwsze dwa rozumowania wydają się niezadowalające. Trzeci zaś dowód stanowi dobre uzasadnienie dla rozważanej tezy, a czwarty może służyć za dodatkowe, choć słabsze, jej uzasadnienie. (shrink)

Presented paper is my reply to Prof. Andrzej Biłat’s review of the book Przewodnik po metafizyce (A Companion to Metaphysics) edited by myself and published by WAM Press. It contains answers to both general and particular remarks and comments risen by Prof. Biłat.

The crisis of metaphysics has many roots. One of them is recognized to be a kind of semantic failure. It lies in the fact that the meaning and reference of metaphysical propositions as well as metaphysical terms seems to be problematic. This diagnosis was first established by I. Kant and then repeated by some of the XXth century philosophers. In this paper I will show what role is played by what I called the Requirement of Reference (RR) in the analysis (...) of the metaphysical discourse. I will argue that the RR draws the limitations for the conceptual and propositional schemata of metaphysics and, at the same time, prevents metaphysics from making de re assertions and utterances. I shall also examine in this light some of Ludwig Wittgenstein's theses from Tractatus and Philosophical Investigations in order to argue that two sorts of metaphysical considerations are possible despite of the above-mentioned criticism. One of them is the analysis of what might be shown but cannot be expressed in language. The other is the deep analysis of the conceptual schemata that constitute the foundations of human thought. (shrink)

The classical arguments against metaphysics provided by Immanuel Kant, neopositivists and recently by analytical philosophers focus on the problem of meaning. In my paper I would like to shed a little bit of light on different dimensions of this problem in the metaphysical discourse and make a proposition how to overcome the difficulties that arise from this kind of discourse.

The classical arguments against metaphysics provided by Immanuel Kant, neopositivists and recently by analytical philosophers focus on the problem of meaning. In my paper I would like to shed a little bit of light on different dimensions of this problem in the metaphysical discourse and make a proposition how to overcome the difficulties that arise from this kind of discourse.