The present paper—taking the example of the English translation of the Hungarian Civil Code of 2013—aims to give an overview on the legal and terminology-related challenges and pitfalls that might occur during the process of translating a civil code with civil law traditions into the language of the common law world. An attempt is made to categorise terminology-related conceptual problems and elaborate how the different types of translation methods could be applied; moreover, how a kind of legal-linguistic checks-and-balances can be (...) achieved through the well-dosed combination, having also the ratio of similarities to differences of legal concepts behind the respective terms in mind. Legal translators must act beyond the role of a simple translator: they must be comparatists, being aware of the legal origin of the relevant concepts and using the methods of comparative private law and translation studies at the same time, since both law and language are system-bound and are heavily influenced by the cultural and social environment. The authors strive to identify the significance of those problems from the perspective of how language-related aspects can perform some fine-tuning on the comparative methodology and findings, whether they are barriers only or provide also an opportunity to verify or refute prima facie comparative results. Comparative law—no doubt—supports legal translation, but their relationship is reciprocal: legal-linguistic subjects and problems emerging in the course of legal translation supply valuable feedback and further sources of inspiration. (shrink)

Let ${\mathbb{BRL}}$ denote the variety of commutative integral bounded residuated lattices (bounded residuated lattices for short). A Boolean retraction term for a subvariety ${\mathbb{V}}$ of ${\mathbb{BRL}}$ is a unary term t in the language of bounded residuated lattices such that for every ${{\bf A} \in \mathbb{V}, t^{A}}$ , the interpretation of the term on A, defines a retraction from A onto its Boolean skeleton B(A). It is shown that Boolean retraction terms are equationally definable, in the sense that there (...) is a variety ${\mathbb{V}_{t} \subsetneq \mathbb{BRL}}$ such that a variety ${\mathbb{V} \subsetneq \mathbb{BRL}}$ admits the unary term t as a Boolean retraction term if and only if ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ . Moreover, the equation s(x) = t(x) holds in ${\mathbb{V}_{s} \cap \mathbb{V}_{t}}$ . The radical of ${{\bf A} \in \mathbb{BRL}}$ , with the structure of an unbounded residuated lattice with the operations inherited from A expanded with a unary operation corresponding to double negation and a a binary operation defined in terms of the monoid product and the negation, is called the radical algebra of A. To each involutive variety ${\mathbb{V} \subseteq \mathbb{V}_{t}}$ is associated a variety ${\mathbb{V}^{r}}$ formed by the isomorphic copies of the radical algebras of the directly indecomposable algebras in ${\mathbb{V}}$ . Each free algebra in such ${\mathbb{V}}$ is representable as a weak Boolean product of directly indecomposable algebras over the Stone space of the free Boolean algebra with the same number of free generators, and the radical algebra of each directly indecomposable factor is a free algebra in the associated variety ${\mathbb{V}^{r}}$ , also with the same number of free generators.A hierarchy of subvarieties of ${\mathbb{BRL}}$ admitting Boolean retraction terms is exhibited. (shrink)

It is known that, on average, people adapt their choice of memory strategy to the subjective utility of interaction. What is not known is whether an individual's choices are boundedly optimal. Two experiments are reported that test the hypothesis that an individual's decisions about the distribution of remembering between internal and external resources are boundedly optimal where optimality is defined relative to experience, cognitive constraints, and reward. The theory makes predictions that are tested against data, not fitted to it. The (...) experiments use a no-choice/choice utility learning paradigm where the no-choice phase is used to elicit a profile of each participant's performance across the strategy space and the choice phase is used to test predicted choices within this space. They show that the majority of individuals select strategies that are boundedly optimal. Further, individual differences in what people choose to do are successfully predicted by the analysis. Two issues are discussed: the performance of the minority of participants who did not find boundedly optimal adaptations, and the possibility that individuals anticipate what, with practice, will become a bounded optimal strategy, rather than what is boundedly optimal during training. (shrink)

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental result in semantics. (...) Her development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

We study, within the framework of intuitionistic logic, two well-known general results of bounded arithmetic. Firstly, Parikh's theorem on the existence of bounding terms for the provably total functions. Secondly, the result which states that adding the scheme of bounded collection to bounded theories does not yield new II2 consequences.

Corporate social responsibility has been intensively discussed in business ethics literature, whereas the social responsibility of private consumers appears to be less researched. However, there is also a growing interest from business ethicists and other scholars in the field of consumer social responsibility. Nevertheless, previous discussions of ConSR reveal the need for a viable conceptual basis for understanding the social responsibility of consumers in an increasingly globalized market economy. Moreover, evolutionary aspects of human morality seem to have been neglected despite (...) the fact that private consumers are undoubtedly human beings. In addition to that, empirical studies suggest that many consumers believe themselves to be responsible but do not act according to their alleged values or attitudes. This raises the question of what deters them from doing so. Therefore, the contribution of this conceptual paper is threefold: we conceptualize ConSR in terms of a combination of a Max Weber-inspired approach with the social connection approach to shared responsibility proposed by Iris Marion Young; shed light on the previously neglected implications of an evolutionarily induced bounded morality for ConSR, and identify potential obstacles to socially responsible consumption, particularly against the backdrop of shared social responsibility and bounded morality. In this latter respect, the paper focuses specifically on the obstacles of low moral intensity, moral stupefaction, informational complexity, and the lack of perceived consumer effectiveness. In sum, the paper advances knowledge in the field of ConSR by using a transdisciplinary, literature-based approach. (shrink)

We determine the exact bounds for the length of an arbitrary reduction sequence of a term in the typed λ-calculus with β-, ξ- and η-conversion. There will be two essentially different classifications, one depending on the height and the degree of the term and the other depending on the length and the degree of the term.

Is there such a thing as bounded rationality? I first try to make sense of the question, and then to suggest which of the disambiguated versions might have answers. We need an account of bounded rationality that takes account of detailed contingent facts about the ways in which human beings fail to perform as we might ideally want to. But we should not think in terms of rules or norms which define good responses to an individual's limitations, but rather (...) in terms of desiderata, situations that limited agents can hope to achieve, and corresponding virtues of achieving them. We should not take formal theories defining optimal behavior in watered-down bounded form, even though they can impose enormous computational or cognitive demands. (shrink)

This paper exploits the modified simple equation and dynamical system schemes to integrate the Klein–Gordon model amid quadratic nonlinearity arising in nonlinear optics, quantum theories, and solid state physics. By implementing the modified simple equation technique, we develop some disguise adaptation of analytical solutions in terms of hyperbolic, exponential, and trigonometric functions with some special parameters. We apply the dynamical system to bifurcate the model and draw distinct phase portraits on unlike parametric constraints. Following each orbit of all phase (...) portraits, we originate bounded and unbounded solitary, periodic, and periodic rogue-type wave solutions of the KG model. These two schemes extract widespread classes of solitary, periodic, and periodic rogue-type wave solutions for the KG model jointly due to restrictions on parameters. We also analyze the effect of parameters on the obtained wave solutions and discuss why and when it changes its nature. We illustrate some dynamical features of the acquired solutions via the 3D, 2D, and contour graphics. (shrink)

The notion of “bounded rationality” was introduced by Simon as an appropriate framework for explaining how agents reason and make decisions in accordance with their computational limitations and the characteristics of the environments in which they exist (seen metaphorically as two complementary scissor blades).We elaborate on how bounded rationality is usually conceived in psychology and on its relationship with logic. We focus on the relationship between heuristics and some non-monotonic logical systems. These two categories of cognitive tools share fundamental features. (...) As a step further, we show that in some cases heuristics themselves can be formalized from this logic perspective. We have therefore two main aims: on the one hand, to demonstrate the relationship between the bounded rationality programme and logic, understood in a broad sense; on the other hand, to provide logical tools of analysis of already known heuristics. This may lead to results such as the characterization of fast and frugal binary trees in terms of their associated logic program here provided. (shrink)

The notion of bounded rationality has recently gained considerable popularity in the behavioural and social sciences. This article surveys the different usages of the term, in particular the way ‘anomalosus’ behavioural phenomena are elicited, how these phenomena are incorporated in model building, and what sort of new theories of behaviour have been developed to account for bounded rationality in choice and in deliberation. It also discusses the normative relevance of bounded rationality, in particular as a justifier of non‐standard reasoning and (...) deliberation heuristics. For each of these usages, the overview discusses the central methodological problems. (shrink)

We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies ψ₁, ψ₂,... s.t. every K-proof of ψi must have a number of proof-lines exponential in terms of the size of ψi. The result extends, for the same sequence of K-tautologies, to the systems K4, Gödel—Löb's logic, S and S4. We also determine some speed-up relations between different systems of modal logic on formulas of modal-depth (...) one. (shrink)

We show how to extract effective bounds Φ for $\bigwedge u^1 \bigwedge v \leq_\gamma tu \bigvee w^\eta G_0$ -sentences which depend on u only (i.e. $\bigwedge u \bigwedge v \leq_\gamma tu \bigvee w \leq_\eta \Phi uG_0$ ) from arithmetical proofs which use analytical assumptions of the form \begin{equation*}\tag{*}\bigwedge x^\delta\bigvee y \leq_\rho sx \bigwedge z^\tau F_0\end{equation*} (γ, δ, ρ, and τ are arbitrary finite types, η ≤ 2, G0 and F0 are quantifier-free, and s and t are closed terms). If (...) τ ≤ 2, (*) can be weakened to $\bigwedge x^\delta, z^\tau\bigvee y \leq_\rho sx \bigwedge \tilde{z} \leq_\tau z F_0$ . This is used to establish new conservation results about weak König's lemma. Applications to proofs in classical analysis, especially uniqueness proofs in approximation theory, will be given in subsequent papers. (shrink)

Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, and revise their beliefs by incorporating a new belief which may be inconsistent with their previous beliefs. An influential theory of belief change proposed by Alchourron, G¨ardenfors and Makinson (AGM) [1] describes postulates which a rational belief revision and contraction operations should satisfy. The AGM postulates have been perceived (...) as characterising idealised rational reasoners, and the corresponding belief change operations are considered unsuitable for implementable agents due to their high computational cost [3]. The main result of this paper is showing that an efficient (linear time) belief contraction operation nevertheless satisfies all but one of the AGM postulates for contraction. This contraction operation is defined for a realistic rule-based agent which can be seen as a reasoner in a very weak logic; although the agent’s beliefs are deductively closed with respect to this logic, checking consistency and tracing dependencies between beliefs is not computationally expensive. Finally, we give a non-standard definition of belief revision in terms of contraction for our agent. (shrink)

The leading question of this paper is: Where does the normativity of the ethics of science and technology come from? This is a challenging question given that the traditional reservoirs of convenience (like metaphysical universalism) are no longer at our disposal the way they used to be. The paper is divided into eight sections: (1) It is specified what challenges a non-foundationalist justification and normativity has to meet. (2) A three-dimensional conception of responsibility is developed based on the human triangular (...) I–We–World relations. (3) The concepts of bounded responsibility and bounded ethics of science and technology are formulated. (4) The principle of reflective equilibrium is introduced as a principle of rationality, and it is shown how this principle generates rational and reasonable justifications in the ethics of science and technology. (5) Against this background, a reconception of internal and external responsibilities of science is given. (6) The type of responsibility demanded is exemplified by today’s climate research. (7) The paper argues for a hand-in-hand model of uncertainties in the sciences and for ethical obligations to preserve the conditions of human life on earth. The ethical argument is spelled out in terms of ethical care, preservation, and precaution. (8) Additionally, some arguments are developed to answer the question of why it is reasonable at all to preserve human life on earth. (shrink)

Decision theory seems to offer a very attractive normative framework for individual and social choice under uncertainty. The decisionmaker should think of her choice situation, at any given moment, in terms of a set of possible outcomes, that is, specifications of the possible consequences of choice, described in light of the decisionmaker's goals; a set of possible actions; and a "state set" consisting of possible prior "states of the world." It is this framework for choice which provides the foundation (...) for expected utility theory, as demonstrated in the work of Leonard Savage. Problems arise, however, when the decisionmaker is boundedly rational: when the mental process of thinking about outcomes, actions, and states is itself expensive and time consuming. In the case of the unboundedly rational decisionmaker, decision theory enjoins her to employ maximally specific outcomes; to consider all possible actions; and to use a set of mutually exclusive and collective exhaustive states, each of which is sufficiently finely specified so that each action, together with each state, yields one and only one maximally specific outcome. In the case of the boundedly rational decisionmaker, this procedure is either infeasible or, if feasible, irrational. This paper presents the problem of bounded rationality. It surveys possible solutions, none of which are found to be attractive. And it concludes by discussing the difficulties that the problem of bounded rationality poses for the welfarist program for legal scholarship presented by Louis Kaplow and Steven Shavell in their book, Fairness versus Welfare. (shrink)

Let $R$ be a (finite) rewrite system over a (finite) signature. Let $\succ$ be a strict well-founded termination ordering on the set of terms in question so that the rules of $R$ are reducing under $\succ$ . Then $R$ is terminating. In this article it is proved for a certain class of far reaching termination orderings (of order type reaching up to the first subrecursively inaccessible ordinal, i.e. the proof-theoretic ordinal of $ID_{<\omega}$ ) that – under some reasonable assumptions (...) which are met in current applications – the derivation lengths function for $R$ is bounded by a function from the slow growing hierarchy of level determined by the order type of the underlying termination ordering. This result is a (correction of the proof of and a) strong generalization of theorem 8.1 in Cichon's article Termination orderings and complexity characterisations. Leeds, Proof Theory 1990, (Aczel, Simmons, and Wainer, editors), Cambridge University Press 1992, 171-193. (shrink)

The appearance of negative terms in quasiprobability representations of quantum theory is known to be inevitable, and, due to its equivalence with the onset of contextuality, of central interest in quantum computation and information. Until recently, however, nothing has been known about how much negativity is necessary in a quasiprobability representation. Zhu :120404, 2016) proved that the upper and lower bounds with respect to one type of negativity measure are saturated by quasiprobability representations which are in one-to-one correspondence with (...) the elusive symmetric informationally complete quantum measurements. We define a family of negativity measures which includes Zhu’s as a special case and consider another member of the family which we call “sum negativity.” We prove a sufficient condition for local maxima in sum negativity and find exact global maxima in dimensions 3 and 4. Notably, we find that Zhu’s result on the SICs does not generally extend to sum negativity, although the analogous result does hold in dimension 4. Finally, the Hoggar lines in dimension 8 make an appearance in a conjecture on sum negativity. (shrink)

The author deals with both philosophical and dramatic texts in addressing this question. These texts formulate the impossibility of acting in terms of the difficulty of the passage à l'acte, which each inflects differently.

If quantum mechanics is correct and there is a finite upper bound for the speed of causal influences (e.g., the speed of light), then quantum mechanics is complete (i.e., it does not admit a more detailed description in terms of hidden variables). Here I show that the conclusion holds if we replace the assumption of bounded velocity by the assumption that there is a finite upper bound to the memory a finite physical system can store (e.g., the Holevo bound). (...) On the way to this conclusion I first show that, although the quantum violation of an inequality valid for any non-contextual model can be explained with a classical contextual model, the inequality can be promoted to a Bell inequality in which, if the model is contextual, then it must be also non-local. This suggests that there is something non-classical in any contextual explanation of the individual systems, and leads us to the question of which are the minimum resources (and specifically memory) any contextual explanation should consume. (shrink)

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

A sequent calculus with the subformula property has long been recognised as a highly favourable starting point for the proof theoretic investigation of a logic. However, most logics of interest cannot be presented using a sequent calculus with the subformula property. In response, many formalisms more intricate than the sequent calculus have been formulated. In this work we identify an alternative: retain the sequent calculus but generalise the subformula property to permit specific axiom substitutions and their subformulas. Our investigation leads (...) to a classification of generalised subformula properties and is applied to infinitely many substructural, intermediate, and modal logics. We also develop a complementary perspective on the generalised subformula properties in terms of logical embeddings. This yields new complexity upper bounds for contractive-mingle substructural logics and situates isolated results on the so-called simple substitution property within a general theory. (shrink)

The theories Si1 and Ti1 are the analogues of Buss' relativized bounded arithmetic theories in the language where every term is bounded by a polynomial, and thus all definable functions grow linearly in length. For every i, a Σbi+1-formula TOPi, which expresses a form of the total ordering principle, is exhibited that is provable in Si+11 , but unprovable in Ti1. This is in contrast with the classical situation, where Si+12 is conservative over Ti2 w. r. t. Σbi+1-sentences. The independence (...) results are proved by translations into propositional logic, and using lower bounds for corresponding propositional proof systems. (shrink)

Rationality has been a principle widely assumed in economics from early on. In contrast, rationality in the formation of economic expectations is rather new. Since the term “rational expectations” has meanwhile become a kind of slogan for diverse issues in economics as in related fields, there is some danger of authors’ not always being aware of the true meaning of this technical term. Sometimes it is used, in a context where expectation formation about uncertain events is essential, as if rational (...) expectations solved this fundamental problem. (shrink)

We characterize the collapse of Buss' bounded arithmetic in terms of the provable collapse of the polynomial time hierarchy. We include also some general model-theoretical investigations on fragments of bounded arithmetic.

V i 2 ⊢A iff for some term t :S i 2 ⊢ “2 i exists→ A”, a bounded first-order formula, i ≥1. V i 2 is not Π b 1 -conservative over S i 2 . Any model of V 2 not satisfying Exp satisfies the collection scheme BΣ 0 1 . V 1 3 is not Π b 1 -conservative over S 2.

We give an exponential lower bound on the number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL-tautologies A1,A2,… s.t. every IL-proof of Ai must have a number of proof-lines exponential in terms of the size of Ai. We show that the results do not apply to the system of classical logic and we obtain an exponential speed-up between classical and intuitionistic logic.

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; it is not always possible to ‘α-convert a bound variable symbol’ or to ‘quotient by α-equivalence’; the notion of unifier is not based just on substitution.Permissive nominal terms closely resemble nominal terms but (...) they recover these properties, and in particular the ‘always fresh’ and ‘always rename’ properties. In the permissive world, freshness contexts are elided, equality is fixed, and the notion of unifier is based on substitution alone rather than on nominal terms’ notion of unification based on substitution plus extra freshness conditions.We prove that expressivity is not lost moving to the permissive case and provide an injection of nominal terms unification problems and their solutions into permissive nominal terms problems and their solutions.We investigate the relation between permissive nominal unification and higher-order pattern unification. We show how to translate permissive nominal unification problems and solutions in a sound, complete, and optimal manner, in suitable senses which we make formal. (shrink)

Introduction: Congenital myasthenic syndromes refer to a heterogenic group of neuromuscular transmission disorders. CMS-subtypes are diverse regarding exercise intolerance and muscular weakness, varying from mild symptoms to life-limiting forms with neonatal onset. Long-term follow-up studies on disease progression and treatment-response in pediatric patients are rare.Patients and Methods: We analyzed retrospective clinical and medication data in a cohort of 32 CMS-patients including the application of a standardized, not yet validated test to examine muscular strength and endurance in 21 patients at the (...) last follow-up. Findings obtained in our cohort were compared with long-term follow-up studies of CMS-cohorts from the literature by considering the underlying molecular mechanisms. Outcomes of CMS-ST were compared to results of normal clinical assessment.Results: Thirty-two pediatric patients with defects in eight different CMS-genes were followed by a median time of 12.8 years. Fifty-nine percentage of patients manifested with first symptoms as neonates, 35% as infants. While 53% of patients presented a reduced walking distance, 34% were wheelchair-bound. Even under adequate therapy with pyridostigmine and 3,4-diaminopyridine, CHAT-mutations led to the progression of muscular weakness partly in combination with persistent respiratory and bulbar symptoms. RAPSN, CHRND, and CHRNB1 patients with neonatal manifestation, early respiratory problems, and bulbar symptoms showed a good and maintained treatment response. CHAT and CHRNE patients required higher PS dosages, whereas RAPSN patients needed a lower mean dosage at the last follow-up. The benefits of short-term medication and long-term progression of symptoms were highly dependent on the specific genetic defect. CMS-ST was carried out in 17/21 patients, determined affected muscle groups including bulbar and ocular symptoms, some of which were not reported by the patients.Conclusions: Our findings and comparison with the literature- suggest a better treatment-response and less severe progression of symptoms present in patients suffering from mutations in CMS-genes directly associated with receptor deficiency, while patients with defects leading to synaptopathy and presynaptic defects tend to have worse outcomes. Assessment of affected muscular groups and clinical symptoms by CMS-ST may be a useful tool for optimal therapeutic management of the patients, especially for future clinical studies. (shrink)

We investigate the possibility to characterize (multi) functions that are Σ b i -definable with small i (i = 1, 2, 3) in fragments of bounded arithmetic T 2 in terms of natural search problems defined over polynomial-time structures. We obtain the following results: (1) A reformulation of known characterizations of (multi)functions that are Σ b 1 - and Σ b 2 -definable in the theories S 1 2 and T 1 2 . (2) New characterizations of (multi)functions that (...) are Σ b 2 - and Σ b 3 -definable in the theory T 2 2 . (3) A new non-conservation result: the theory T 2 2 (α) is not ∀Σ b 1 (α)-conservative over the theory S 2 2 (α). To prove that the theory T 2 2 (α) is not ∀Σ b 1 (α)-conservative over the theory S 2 2 (α), we present two examples of a Σ b 1 (α)-principle separating the two theories: (a) the weak pigeonhole principle WPHP (a 2 , f, g) formalizing that no function f is a bijection between a 2 and a with the inverse g, (b) the iteration principle Iter (a, R, f) formalizing that no function f defined on a strict partial order ( $\{0,\dots,a\}$ , R) can have increasing iterates. (shrink)

Lewisian Genuine Realism about possible worlds is often deemed unable to accommodate impossible worlds and reap the benefits that these bestow to rival theories. This thesis explores two alternative extensions of GR into the terrain of impossible worlds. It is divided in six chapters. Chapter I outlines Lewis’ theory, the motivations for impossible worlds, and the central problem that such worlds present for GR: How can GR even understand the notion of an impossible world, given Lewis’ reductive theoretical framework? Since (...) the desideratum is to incorporate impossible worlds into GR without compromising Lewis’ reductive analysis of modality, Chapter II defends that analysis against objections. The rest of the thesis is devoted to incorporating impossible worlds into GR. Chapter III explores GR-friendly impossible worlds in the form of set-theoretic constructions out of genuine possibilia. Then, Chapters IV-VI venture into concrete impossible worlds. Chapter IV addresses Lewis’ objection against such worlds, to the effect that contradictions true at impossible worlds amount to true contradictions tout court. I argue that even if so, the relevant contradictions are only ever about the non-actual, and that Lewis’ argument relies on a premise that cannot be nonquestion- beggingly upheld in the face of genuine impossible worlds in any case. Chapter V proposes that Lewis’ reductive analysis can be preserved, even in the face of genuine impossibilia, if we differentiate the impossible from the possible by means of accessibility relations, understood non-modally in terms of similarity. Finally, Chapter VI counters objections to the effect that there are certain impossibilities, formulated in Lewis’ theoretical language, which genuine impossibilia should, but cannot, represent. I conclude that Genuine Realism is still very much in the running when the discussion turns to impossible worlds. (shrink)

In this paper we study with proof-theoretic methods the function(al) s provably recursive relative to Ramsey's theorem for pairs and the cohesive principle (COH). Our main result on COH is that the type 2 functional provably recursive from $RCA_0 + COH + \Pi _1^0 - CP$ are primitive recursive. This also provides a uniform method to extract bounds from proofs that use these principles. As a consequence we obtain a new proof of the fact that $WKL_0 + \Pi _1^0 - (...) CP + COH$ is $\Pi _1^0 $ -conservative over PRA. Recent work of the first author showed that $\Pi _1^0 + CP + COH$ is equivalent to a weak variant of the Bolzano-Weierstraß principle. This makes it possible to use our results to analyze not only combinatorial but also analytical proofs. For Ramsey's theorem for pairs and two colors $\left( {RT_2^2 } \right)$ we obtain the upper bounded that the type 2 functionals provable recursive relative to $RCA_0 + \sum\nolimits_2^0 {IA + RT_2^2 } $ are in T₁. This is the fragment of Gödel's system T containing only type 1 recursion—roughly speaking it consists of functions of Ackermann type. With this we also obtain a uniform method for the extraction of T₁-bounds from proofs that use RT2..... Moreover, this yields a new proof of the fact that $WKL_0 + \sum\nolimits_2^0 {IA} + RT_2^2 $ is $\Pi _1^0 $ -conservative over $RCA_0 + \sum\nolimits_2^0 { - IA} $ . The results are obtained in two steps: in the first step a term including Skolem functions for the above principles is extracted from a given proof. This is done using Gödel's functional interpretation. After this the term is normalized, such that only specific instances of the Skolem functions are used. In the second step this term is interpreted using $\Pi _1^0 $ -comprehension. The comprehension is then eliminated in favor of induction using either elimination of monotone Skolem functions (for COH) or Howard's ordinal analysis of bar recursion (for $RT_2^2 $. (shrink)

The canonical pair of a proof system P is the pair of disjoint NP sets where one set is the set of all satisfiable CNF formulas and the other is the set of CNF formulas that have P-proofs bounded by some polynomial. We give a combinatorial characterization of the canonical pairs of depth d Frege systems. Our characterization is based on certain games, introduced in this article, that are parametrized by a number k, also called the depth. We show that (...) the canonical pair of a depth d Frege system is polynomially equivalent to the pair (Ad+2,Bd+2) where Ad+2 (respectively, Bd+1) are depth d+1 games in which Player I (Player II) has a positional winning strategy. Although this characterization is stated in terms of games, we will show that these combinatorial structures can be viewed as generalizations of monotone Boolean circuits. In particular, depth 1 games are essentially monotone Boolean circuits. Thus we get a generalization of the monotone feasible interpolation for Resolution, which is a property that enables one to reduce the task of proving lower bounds on the size of refutations to lower bounds on the size of monotone Boolean circuits. However, we do not have a method yet for proving lower bounds on the size of depth d games for d>1. (shrink)

Multiple explanatory frameworks may be required to provide an adequate account of human cognition. This paper embeds the classical account within a neural network framework, exploring the encoding of syntacticallystructured objects over the synchronicdiachronic characteristics of networks. Synchronic structure is defined in terms of temporal binding and the superposition of states. To accommodate asymmetric relations, synchronic structure is subject to the type uniqueness constraint. The nature of synchronic structure is shown to underlie Xbar theory that characterizes the phrasal structure (...) of human languages. The derivation differentiates core Xbar properties from languagespecific properties. (shrink)

Bodily sensations are mental states typically suitable to be reported in judgments in which a first-person indexical is used to qualify the felt body. In other words, subjects typically have a sense of bodily ownership for the body that they feel in bodily sensations. This paper puts forward, firstly, three desiderata that theories on the sense of bodily ownership should meet. Secondly, it assesses two views that account for the sense of bodily ownership in terms of the spatial content (...) of bodily sensations, appealing to a notion of a sense of boundedness, and argues that they do not meet the goals defined. (shrink)

SummaryThe contrasting economic and technological histories of Japan, China, and India prior to 1914 are very often explained in socio-cultural terms. It is too easily assumed that culturally Japan was somehow more ‘prone’ to development along Western lines than were either of China and India. This paper addresses the socalled ‘failure’ of economic modernization in China and India in terms of socioeconomic processes and mechanisms. Knowledge and machinery were transferred to all three nations prior to 1914. But only (...) in Japan were conditions favourable to the subsequent adoption, diffusion, and adaptation of technologies. A major argument is that officialdom in China and India was not unwary or dissolute but merely hamstrung through a removal of effective sovereignty over decision making. The reduction of sovereignty was of greater importance than the supposed retardative impact of deeply held cultural traits. (shrink)

Bound-constrained optimization has wide applications in science and engineering. In the last two decades, various evolutionary algorithms were developed under the umbrella of evolutionary computation for solving various bound-constrained benchmark functions and various real-world problems. In general, the developed evolutionary algorithms belong to nature-inspired algorithms and swarm intelligence paradigms. Differential evolutionary algorithm is one of the most popular and well-known EAs and has secured top ranks in most of the EA competitions in the special session of the IEEE Congress on (...) Evolutionary Computation. In this paper, a customized differential evolutionary algorithm is suggested and applied on twenty-nine large-scale bound-constrained benchmark functions. The suggested C-DE algorithm has obtained promising numerical results in its 51 independent runs of simulations. Most of the 2013 IEEE-CEC benchmark functions are tackled efficiently in terms of proximity and diversity. (shrink)

This paper is concerned with implicit computational complexity of the exptime computable functions. Modifying the lexicographic path order, we introduce a path order EPO. It is shown that a termination proof for a term rewriting system via EPO implies an exponential bound on the lengths of derivations. The path order EPO is designed so that every exptime function is representable as a term rewrite system compatible with EPO (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim).

A generalization of the standard n-person game is presented, with flexible information requirements suitable for players constrained by bounded rationality. Strategies (complete contingency plans) are replaced by "policies," i. e., end-mean pairs of candidate goals and "controls" (partial contingency plans). The existence of individual objective functions over the joint policy choice set is axiomatized in terms of primitive preference and probability orders. Conditions are given for the existence of pure policy Nash equilibrium points in n-person games, and pure policy (...) Nash bargaining and equilibrium threat solutions in 2-person policy games. Connectedness of the policy and payoff sets is not required. (shrink)

The bounded arithmetic theories R2i, S2i, and T2i are closely connected with complexity theory. This paper is motivated by the questions: what are the Σi+1b-definable multifunctions of R2i? and when is one theory conservative over another? To answer these questions we consider theories , and where induction is restricted to prenex formulas. We also define which has induction up to the 0 or 1-ary L2-terms in the set τ. We show and and for . We show that the -multifunctions (...) of are FPΣip and that those of are FPΣip. For -definability we get FPΣi+k+1p for all these theories. Write for the set of terms 2min,t) where ℓ is a finite product of terms in τ and tL2. We prove and we show - INDτ provided τO2. This gives a proof theoretic proof that S2iΔi+1b-LIND and -LLIND solving an open problem. For τO2, we define using weak replacement axioms and show . We show if or if or if where τ′ has an unbounded term then PH=B. We separate PΣip from PΣip for behaved ℓ and deduce theory separations. We lastly introduce a notion of a model separating two theories and derive some consequences. (shrink)

Bernard Stiegler's account of technology as constitutive of the human as such is without precedent. However, Stiegler's work must also be understood in terms of its explicit appropriations from the thought of Jacques Derrida. An important, yet overlooked, context for framing Stiegler's relation to Derrida is the question of nonhuman life thought in terms of différance . As I argue, Stiegler's account does not unfold the most profound implications of Derrida's understanding of nonhuman life as différance . While (...) Stiegler describes human life as prosthetic and in default of origin, there is no treatment of the way in which nonhuman life is also aporetic and constituted in terms of its relatedness to exteriority. I conclude with a reconsideration of Stiegler's work from the perspective of Derrida's richer account of nonhuman life as différance in order to bring to light an anthropocentric aspect of Stiegler's work. (shrink)

In any variety of bounded integral residuated lattice-ordered commutative monoids the class of its semisimple members is closed under isomorphic images, subalgebras and products, but it is not closed under homomorphic images, and so it is not a variety. In this paper we study varieties of bounded residuated lattices whose semisimple members form a variety, and we give an equational presentation for them. We also study locally representable varieties whose semisimple members form a variety. Finally, we analyze the relationship with (...) the property “to have radical term”, especially for k-radical varieties, and for the hierarchy of varieties k>0 defined in Cignoli and Torrens. (shrink)

In this contribution, Sharon Todd moves beyond the bounds of what she calls “strong” instrumentalism (one that posits education in a mechanistic fashion and operates politically through a marrying of national educational policies with economic interests) and explores the intrinsic purpose of educational practice specifically through an aesthetic lens. Todd considers how two art projects by the feminist art collective Sisters Hope offer a way of theorizing instrumentalism in a “weak” sense — that is, an instrumentalism that sees pedagogical practices (...) not in terms of social function, but as that which gives form to specifically educational (not social or economic) ideas. She does this by drawing parallels between education and art as fields of practice, informed by notions of experience, relation, and formation/transformation. Drawing on John Dewey's aesthetics and Nicolas Bourriaud's relational aesthetics, Todd argues how these notions are central to an understanding of “weak” instrumentalism in education. (shrink)

This paper presents proof that Buss's S22 can prove the consistency of a fragment of Cook and Urquhart's PV from which induction has been removed but substitution has been retained. This result improves Beckmann's result, which proves the consistency of such a system without substitution in bounded arithmetic S12. Our proof relies on the notion of "computation" of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and (...) either its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven. This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss's S12. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies. (shrink)

We develop here the general treatment arising from the Bethe-Salpeter equation for a two-particle bound system in which at least one of the particles is spinless. It is shown that a natural two-component formalism can be formulated for describing the propagators of scalar particles. This leads to a formulation of the Bethe-Salpeter equation in a form very reminiscent of the fermion-fermion case. It is also shown, that using this two-component formulation for spinless particles, the perturbation theory can be systematically developed (...) in a manner similar to that of fermions. Quantum electrodynamics for scalar particles is then developed in the two component formalism, and the problem of bound states, in which one of the constituent particles is spinless, is examined by means of the means of the Bethe-Salpeter equation. For this case, the Bethe-Salpeter equation is cast into a form which is convenient to perform a Foldy-Woutyhuysen transformation which we carry out, keeping the lowest-order relativistic corrections to the nonrelativistic equation. The results are compared with the corresponding fermion-fermion case. It is shown, as might have been expected, that the only spin-independent terms that occur for the fermion-fermion system which do not occur for bound scalar particle cases, is the zitterbewegung contribution. The relevance of the above considerations for systems that are essentially bound by electromagnetic interactions, such as kaonic hydrogen, is discussed. (shrink)

Simple game experiments of the reward allocation, dictator and ultimatum type are used to demonstrate that true explanations of social phenomena cannot conceivably be derived in terms of the perfect rationality concept underlying neo-classical economics. We explore in some depth, if speculatively, how experimental game theory might bring us closer to a new synthesis or at least the nucleus of a general theory of ‘games and boundedly rational economic behavior’ with enhanced explanatory power.

We prove that there are two involutions defined by monadic terms that characterize Monadic Algebras. We further prove that the variety of Monadic Algebras is the smallest variety of Interior Algebras where these involutions give rise to an interpretation from the variety of Bounded Distributive Lattices into it.