We prove that the determinacy of Gale-Stewart games whose winning sets are accepted by realtime 1-counter Büchi automata is equivalent to the determinacy of analytic Gale-Stewart games which is known to be a large cardinal assumption. We show also that the determinacy of Wadge games between two players in charge ofω-languages accepted by 1-counter Büchi automata is equivalent to the analytic Wadge determinacy. Using some results of set theory we prove that one can effectively construct a 1-counter Büchi automatonand a (...) Büchi automatonsuch that: There exists a model of ZFC in which Player 2 has a winning strategy in the Wadge gameW,L()); There exists a model of ZFC in which the Wadge gameW,L()) is not determined. Moreover these are the only two possibilities, i.e. there are no models of ZFC in which Player 1 has a winning strategy in the Wadge gameW,L()). (shrink)

We prove that, for any natural number \, we can find a finite alphabet \ and a finitary language L over \ accepted by a one-counter automaton, such that the \-power $$\begin{aligned} L^\infty :=\{ w_0w_1\ldots \in \Sigma ^\omega \mid \forall i\in \omega ~~w_i\in L\} \end{aligned}$$is \-complete. We prove a similar result for the class \.

We prove that, for any natural number n≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n\ge 1$$\end{document}, we can find a finite alphabet Σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Sigma $$\end{document} and a finitary language L over Σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Sigma $$\end{document} accepted by a one-counter automaton, such that the ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-power L∞:={w0w1…∈Σω∣∀i∈ωwi∈L}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\begin{aligned} (...) L^\infty :=\{ w_0w_1\ldots \in \Sigma ^\omega \mid \forall i\in \omega ~~w_i\in L\} \end{aligned}$$\end{document}is Πn0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Pi }}^0_n$$\end{document}-complete. We prove a similar result for the class Σn0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varvec{\Sigma }}^0_n$$\end{document}. (shrink)

For the claim that the satisfaction of certain conditions is sufficient for the application of some concept to serve as part of the (`reductive') analysis of that concept, we require the conditions to be specified without employing that very concept. An account of the application conditions of a concept not meeting this requirement, we call analytically circular. For such a claim to be usable in determining the extension of the concept, however, such circularity may not matter, since if the concept (...) figures in a certain kind of intensional context in the specification of the conditions, the satisfaction of those conditions may not itself depend on the extension of the concept. We put this by saying that although analytically circular, the account may yet not be inferentially circular. (shrink)

We consider the modal logic of non-contingency in a general setting, without making special assumptions about the accessibility relation. The basic logic in this setting is axiomatized, and some of its extensions are discussed, with special attention to the expressive weakness of the language whose sole modal primitive is non-contingency , by comparison with the usual language based on necessity.

This paper considers the question: what becomes of the notion of a logic as a way of codifying valid arguments when the customary assumption is dropped that the premisses and conclusions of these arguments are statements from some single language? An elegant treatment of the notion of a logic, when this assumption is in force, is that provided by Dana Scott's theory of consequence relations; this treatment is appropriately generalized in the present paper to the case where we do not (...) make this assumption of linguistic homogeneity. Several applications of the resulting concept of a heterogeneous logic are suggested, but the main emphasis is on the formal development. One topic touched on is a certain contrast between the boolean and the intensional sentence-connectives in this more general setting. (shrink)

A.N. Prior once showed that on certain apparently reasonable assumptions, a thesis sometimes associated with the name of Hume to the effect that no set of factual statements can ever entail an evaluative statement, is quite untenable. We assume only that there is at least one statement of each kind, and that the negation of a factual statement is factual — a principle we may call ‘N'. Now consider the disjunction F V E of some factual with some evaluative statement. (...) Since the disjunction is entailed by F, a factual statement, it must, if principle H is correct, be classified as factual. But by N, ∽ F is also factual, and this together with F V E entails E, thus violating H since E was exhypothesi an evaluative statement. (shrink)

An account of desire as a species of belief may owe its appeal to the details of its proposal as to precisely what sort of beliefs desires are to be identified with, and its downfall may be due to those details it does provide. For example, it may be proposed that the desire that α is in fact the belief that it ought to be that α, or is morally good or desirable that it should be the case that α. (...) Here the appeal might be that of forging a link between the holding of a moral belief and the acknowledgment that one has a reason for acting a certain way; and the shortcoming of the suggestion is its evident implausibility: even if the ‘necessity’ direction could be established, having a desire hardly seems sufficient for the holding of any such belief. Again: it might be proposed, perhaps simply to bring some order into the realm of propositional attitudes by reducing some to others, that the belief with which we should identify a’s desire that α is a’s belief that he will or would be happy if α. This proposed identification can be seen to be incorrect by consideration of examples such as the following, due to J. Gosling. An aging and ailing parent might forego numerous pleasures in order that his children should reap the benefits of his saving and have a good start in life – perhaps by receiving an expensive education – after his impending death. Oearly he may want that they should so benefit even if he does not believe in an after-death existence in which he might come to know of, and so take pleasure in, his children’s subsequent well-being. So his wanting that they should prosper cannot consist in his believing that he will be happy if/when they do, since he has no expectation of even being in existence in that eventuality. As Gosling puts it, there is a clear difference between thinking that something’s coming about will bring one pleasure, on the one hand, and viewing the prospect of its coming about with pleasure, on the other. (shrink)

Several intrinsic/extrinsic distinctions amongst properties, current in the literature, are discussed and contrasted. The proponents of such distinctions tend to present them as competing, but it is suggested here that at least three of the relevant distinctions (including here that between non-relational and relational properties) arise out of separate perfectly legitimate intuitive considerations: though of course different proposed explications of the informal distinctions involved in any one case may well conflict. Special attention is paid to the question of whether a (...) single notion of property is capable of supporting the various distinctions. (shrink)

An analogy between functional dependencies and implicational formulas of sentential logic has been discussed in the literature. We feel that a somewhat different connexion between dependency theory and sentential logic is suggested by the similarity between Armstrong's axioms for functional dependencies and Tarski's defining conditions for consequence relations, and we pursue aspects of this other analogy here for their theoretical interest. The analogy suggests, for example, a different semantic interpretation of consequence relations: instead of thinking ofB as a consequence of (...) a set of formulas {A1,...,A n} whenB is true on every assignment of truth-values on which eachA i is true, we can think of this relation as obtaining when every pair of truth-value assignments which give the same truth-values toA 1, the same truth-values toA 2,..., and the same truth-values toA n, also make the same assignment in respect ofB. We describe the former as the consequence relation inference-determined by the class of truth-value assignments (valuations) under consideration, and the latter as the consequence relation supervenience-determined by that class of assignments. Some comparisons will be made between these two notions. (shrink)

A.N. Prior once showed that on certain apparently reasonable assumptions, a thesis sometimes associated with the name of Hume to the effect that no set of factual statements can ever entail an evaluative statement, is quite untenable. We assume only that there is at least one statement of each kind, and that the negation of a factual statement is factual — a principle we may call ‘N'. Now consider the disjunction F V E of some factual with some evaluative statement. (...) Since the disjunction is entailed by F, a factual statement, it must, if principle H is correct, be classified as factual. But by N, ∽ F is also factual, and this together with F V E entails E, thus violating H since E was exhypothesi an evaluative statement. (shrink)

Tarski 1968 makes a move in the course of providing an account of ?definitionally equivalent? classes of algebras with a businesslike lack of fanfare and commentary, the significance of which may accordingly be lost on the casual reader. In ?1 we present this move as a response to a certain difficulty in the received account of what it is to define a function symbol (or ?operation symbol?). This difficulty, which presents itself as a minor technicality needing to be got around (...) especially for the case of symbols for zero-place functions (for ?distinguished elements?), has repercussions?not widely recognised?for the account of functional completeness in sentential logic. A similarly stark comment in Church 1956 reveals an appreciation of this difficulty, though not every subsequent author on the topic has taken the point. We fill out this side of the picture in ?2. The discussion of functional completeness in ?2 is supplemented by some remarks on what is involved in defining a connective, which have been included in an Appendix. The emphasis throughout is on conceptual clarification rather than on proving theorems, and the main body of the paper may be regarded as an elaboration on the remarks just mentioned by Tarski and Church. The Appendix (?3) is intended to be similarly clarificatory, though this time with some corrective intent, of remarks made in and about Makinson 1973. (shrink)

The adverse reaction to Hempel's 'ravens paradox' embodied in giving it that description is compared with the usual reaction of experimental subjects to the Wason selection task.

For the claim that the satisfaction of certain conditions is sufficient for the application of some concept to serve as part of the (‘reductive’) analysis of that concept, we require the conditions to be specified without employing that very concept. An account of the application conditions of a concept not meeting this requirement, we call analytically circular. For such a claim to be usable in determining the extension of the concept, however, such circularity may not matter, since if the concept (...) figures in a certain kind of intensional context in the specification of the conditions, the satisfaction of those conditions may not itself depend on the extension of the concept. We put this by saying that although analytically circular, the account may yet not be inferentially circular. (shrink)

This paper is about a support information management system for a wind power producer having an energy storage system and participating in a day-ahead electricity market. Energy storage can play not only a leading role in mitigation of the effect of uncertainty faced by a WP producer, but also allow for conversion of wind energy into electric energy to be stored and then released at favourable hours. This storage provides capability for arbitrage, allowing an increase on profit of a WP (...) producer, but must be supported by a convenient problem formulation. The formulation proposed for the support information management system is based on an approach of stochasticity written as a mixed integer linear programming problem. WP and market prices are considered as stochastic processes represented by a set of scenarios. The charging/discharging of the ESS are considered dependent on scenarios of market prices and on scenarios of WP. The effectiveness of the proposed formulation is tested by comparison of case studies using data from the Iberian Electricity Market. The comparison is in favour of the proposed consideration of stochasticity. (shrink)

SummaryIf you know you can recognise positive instances of a property, can you use this knowledge so as to be able to recognise also its negative instances? This is the question to be adressed.

This essay reviews theory and research regarding the “Michelangelo phenomenon,” which describes the manner in which close partners shape one another’s dispositions, values, and behavioral tendencies. Individuals are more likely to exhibit movement toward their ideal selves to the degree that their partners exhibit affirming perception and behavior; exhibiting confidence in the self’s capacity and enacting behaviors that elicit key features of the self’s ideal. In turn, movement towards the ideal self yields enhanced personal well-being and couple well-being. We review (...) empirical evidence regarding this phenomenon and discuss self and partner variables that contribute to the process. (shrink)