General Characterization of at Most Twin Outer Perfect Domination Number with Colouring of Graphs

2021 ◽  
pp. 171-183
Author(s):  
G. Mahadevan
Author(s):  
Ralph Wedgwood

Internalism implies that rationality requires nothing more than what in the broadest sense counts as ‘coherence’. The earlier chapters of this book argue that rationality is in a strong sense normative. But why does coherence matter? The interpretation of this question is clarified. An answer to the question would involve a general characterization of rationality that makes it intuitively less puzzling why rationality is in this strong sense normative. Various approaches to this question are explored: a deflationary approach, the appeal to ‘Dutch book’ theorems, the idea that rationality is constitutive of the nature of mental states. It is argued that none of these approaches solves the problem. An adequate solution will have to appeal to some value that depends partly on how things are in the external world—in effect, an external goal—and some normatively significant connection between internal rationality and this external goal.


1997 ◽  
Vol 27 (1) ◽  
pp. 17-45 ◽  
Author(s):  
Philip Clark

There is an idea, going back to Aristotle, that reasons for action can be understood on a parallel with reasons for belief. Not surprisingly, the idea has almost always led to some form of inferentialism about reasons for action. In this paper I argue that reasons for action can be understood on a parallel with reasons for belief, but that this requires abandoning inferentialism about reasons for action. This result will be thought paradoxical. It is generally assumed that if there is to be a useful parallel, there must be some such thing as a practical inference. As we shall see, that assumption tends to block the fruitful exploration of the real parallel. On the view I shall defend, the practical analogue of an ordinary inference is not an inference, but something I shall call a practical step. Nevertheless, the practical step will do, for a theory of reasons for action, what ordinary inference does for an inferentialist theory of reasons for belief. The result is a general characterization of reasons, practical and theoretical, in terms of the correctness conditions of the relevant sorts of step.


Author(s):  
Juan A. García González

RESUMENSe expone en este trabajo una panorámica del escepticismo antiguo, en sus tres fromas más notables: pirronismo, probabilismo y fenomenismo. Después se procede a una caracterización general del escepticismo y se glosa la interpretación hegeliana del mismo.PALABRAS CLAVEESCEPTICISMO, FILOSOFÍA GRIEGAABSTRACTIt is exposed in this work a panoramic of the old scepticism, in their three more remarkable forms: pirronism, probabilism and phenomenism. The you proceeds to a general characterization of the scepticism and is glossed the interpretation hegeliana of the scepticism.KEYWORDSSCEPTICISM, GREEK PHILOSOPHY


Author(s):  
Wilfried Sieg

Mathematical structuralism is deeply connected with Hilbert and Bernays’s proof theory and its programmatic aim to ensure the consistency of all of mathematics. That aim was to be reached on the basis of finitist mathematics. Gödel’s second incompleteness theorem forced a step from absolute finitist to relative constructivist proof-theoretic reductions. This mathematical step was accompanied by philosophical arguments for the special nature of the grounding constructivist frameworks. Against that background, this chapter examines Bernays’s reflections on proof-theoretic reductions of mathematical structures to methodological frames via projections. However, these reflections are focused on narrowly arithmetic features of frames. Drawing on broadened meta-mathematical experience, this chapter proposes a more general characterization of frames that has ontological and epistemological significance. The characterization is given in terms of accessibility: domains of objects are accessible if their elements are inductively generated, and principles for such domains are accessible if they are grounded in our understanding of the generating processes.


2018 ◽  
Vol 6 (1) ◽  
pp. 343-356
Author(s):  
K. Arathi Bhat ◽  
G. Sudhakara

Abstract In this paper, we introduce the notion of perfect matching property for a k-partition of vertex set of given graph. We consider nontrivial graphs G and GPk , the k-complement of graph G with respect to a kpartition of V(G), to prove that A(G)A(GPk ) is realizable as a graph if and only if P satis_es perfect matching property. For A(G)A(GPk ) = A(Γ) for some graph Γ, we obtain graph parameters such as chromatic number, domination number etc., for those graphs and characterization of P is given for which GPk and Γ are isomorphic. Given a 1-factor graph G with 2n vertices, we propose a partition P for which GPk is a graph of rank r and A(G)A(GPk ) is graphical, where n ≤ r ≤ 2n. Motivated by the result of characterizing decomposable Kn,n into commuting perfect matchings [2], we characterize complete k-partite graph Kn1,n2,...,nk which has a commuting decomposition into a perfect matching and its k-complement.


2018 ◽  
Vol 13 (4) ◽  
pp. 797-809
Author(s):  
CHRIS SCAMBLER

AbstractIn recent work Philip Welch has proven the existence of ‘ineffable liars’ for Hartry Field’s theory of truth. These are offered as liar-like sentences that escape classification in Field’s transfinite hierarchy of determinateness operators. In this article I present a slightly more general characterization of the ineffability phenomenon, and discuss its philosophical significance. I show the ineffable sentences to be less ‘liar-like’ than they appear in Welch’s presentation. I also point to some open technical problems whose resolution would greatly clarify the philosophical issues raised by the ineffability phenomenon.


Sign in / Sign up

Export Citation Format

Share Document