We construct logical languages which allow one to represent a variety of possible types of changes affecting the information states of agents in a multi-agent setting. We formalize these changes by defining a notion of epistemic program. The languages are two-sorted sets that contain not only sentences but also actions or programs. This is as in dynamic logic, and indeed our languages are not significantly more complicated than dynamic logics. But the semantics is more complicated. In general, the semantics of (...) an epistemic program is what we call aprogram model. This is a Kripke model of ‘actions’,representing the agents' uncertainty about the current action in a similar way that Kripke models of ‘states’ are commonly used in epistemic logic to represent the agents' uncertainty about the current state of the system. Program models induce changes affecting agents' information, which we represent as changes of the state model, called epistemic updates. Formally, an update consists of two operations: the first is called the update map, and it takes every state model to another state model, called the updated model; the second gives, for each input state model, a transition relation between the states of that model and the states of the updated model. Each variety of epistemic actions, such as public announcements or completely private announcements to groups, gives what we call an action signature, and then each family of action signatures gives a logical language. The construction of these languages is the main topic of this paper. We also mention the systems that capture the valid sentences of our logics. But we defer to a separate paper the completeness proof. (shrink)

Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the belief (...) logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic. (shrink)

We formalise a notion of dynamic rationality in terms of a logic of conditional beliefs on plausibility models. Similarly to other epistemic statements, dynamic rationality changes its meaning after every act of learning, and it may become true after players learn it is false. Applying this to extensive games, we "simulate" the play of a game as a succession of dynamic updates of the original plausibility model: the epistemic situation when a given node is reached can be thought of as (...) the result of a joint act of learning that the node is reached. We then use the notion of "stable belief, i.e. belief that is preserved during the play of the game, in order to give an epistemic condition for backward induction: rationality and common knowledge of stable belief in rationality. This condition is weaker than Aumann's and compatible with the implicit assumptions underlying Stalnaker's criticism of Aumann's proof. The "dynamic" nature of our concept of rationality explains why our condition avoids the apparent circularity of the "backward induction paradox": it is consistent to believe in a player's rationality after updating with his irrationality. (shrink)

We study the learning power of iterated belief revision methods. Successful learning is understood as convergence to correct, i.e., true, beliefs. We focus on the issue of universality: whether or not a particular belief revision method is able to learn everything that in principle is learnable. We provide a general framework for interpreting belief revision policies as learning methods. We focus on three popular cases: conditioning, lexicographic revision, and minimal revision. Our main result is that conditioning and lexicographic revision can (...) drive a universal learning mechanism, provided that the observations include only and all true data, and provided that a non-standard, i.e., non-well-founded prior plausibility relation is allowed. We show that a standard, i.e., well-founded belief revision setting is in general too narrow to guarantee universality of any learning method based on belief revision. We also show that minimal revision is not universal. Finally, we consider situations in which observational errors may occur. Given a fairness condition, which says that only finitely many errors occur, and that every error is eventually corrected, we show that lexicographic revision is still universal in this setting, while the other two methods are not. (shrink)

We present a semantic analysis of the Ramsey test, pointing out its deep underlying flaw: the tension between the “static” nature of AGM revision (which was originally tailored for revision of only purely ontic beliefs, and can be applied to higher-order beliefs only if given a “backwards-looking” interpretation) and the fact that, semantically speaking, any Ramsey conditional must be a modal operator (more precisely, a dynamic-epistemic one). Thus, a belief about a Ramsey conditional is in fact a higher-order belief, hence (...) the AGM revision postulates are not applicable to it, except in their “backwards-looking” interpretation. But that interpretation is consistent only with a restricted (weak) version of Ramsey’s test (in-applicable to already revised theories). The solution out of the conundrum is twofold: either accept only the weak Ramsey test; or replace the AGM revision operator ∗ by a truly “dynamic” revision operator ⊗, which will not satisfy the AGM axioms, but will do something better: it will “keep up with reality”, correctly describing revision with higher-order beliefs. (shrink)

The pre-eminence of logical dynamics, over a static and purely propositional view of Logic, lies at the core of a new understanding of both formal epistemology and the logical foundations of quantum mechanics. Both areas appear at first sight to be based on purely static propositional formalisms, but in our view their fundamental operators are essentially dynamic in nature. Quantum logic can be best understood as the logic of physically-constrained informational interactions between subsystems of a global physical system. Similarly, epistemic (...) logic is the logic of socially-constrained informational interactions between “subsystems” of a social system. Dynamic Epistemic Logic provides us with a unifying setting in which these informational interactions, coming from seemingly very different areas of research, can be fully compared and analyzed. The DEL formalism comes with a powerful set of tools that allows us to make the underlying dynamic/interactive mechanisms fully transparent. (shrink)

We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear "no". Philosophically, our argument is based on combining a formal semantic approach, in the spirit of E. W. Beth's proposal of applying Tarski's semantical methods to the analysis of physical theories, with (...) an empirical-experimental approach to Logic, as advocated by both Beth and Putnam, but understood by us in the view of the operationalrealistic tradition of Jauch and Piron, i. e. as an investigation of "the logic of yes-no experiments" (or "questions"). Technically, we use the recently-developed setting of Quantum Dynamic Logic (Baltag and Smets 2005, 2008) to make explicit the operational meaning of quantum-mechanical concepts in our formal semantics. Based on our recent results (Baltag and Smets 2005), we show that the correct interpretation of quantum-logical connectives is dynamical, rather than purely propositional. We conclude that there is no contradiction between classical logic and (our dynamic reinterpretation of) quantum logic. Moreover, we argue that the Dynamic-Logical perspective leads to a better and deeper understanding of the "non-classicality" of quantum behavior than any perspective based on static Propositional Logic. (shrink)

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized assignment semantics for first order logic. The expressive strength, complete proof calculus and meta-properties of LFD are explored. Various language extensions are presented as well, up to undecidable modal-style logics for independence and dynamic logics of changing dependence models. Finally, more concrete settings for dependence are discussed: continuous (...) dependence in topological models, linear dependence in vector spaces, and temporal dependence in dynamical systems and games. (shrink)

We investigate the discrete (finite) case of the Popper–Renyi theory of conditional probability, introducing discrete conditional probabilistic models for knowledge and conditional belief, and comparing them with the more standard plausibility models. We also consider a related notion, that of safe belief, which is a weak (non-negatively introspective) type of “knowledge”. We develop a probabilistic version of this concept (“degree of safety”) and we analyze its role in games. We completely axiomatize the logic of conditional belief, knowledge and safe belief (...) over conditional probabilistic models. We develop a theory of probabilistic dynamic belief revision, introducing probabilistic “action models” and proposing a notion of probabilistic update product, that comes together with appropriate reduction laws. (shrink)

Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the supervised learning game—to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand, Learner may make mistakes in the learning process, and she may also ignore the potential relation between different hypotheses; on the other (...) hand, Teacher is able to correct Learner’s mistakes, eliminate potential mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning and study its properties. Broadly, this work takes a small step towards studying the interaction between graph games, logics and formal learning theory. (shrink)

We present a complete, decidable logic for reasoning about a notion of completely trustworthy evidence and its relations to justifiable belief and knowledge, as well as to their explicit justifications. This logic makes use of a number of evidence-related notions such as availability, admissibility, and “goodness” of a piece of evidence, and is based on an innovative modification of the Fitting semantics for Artemovʼs Justification Logic designed to preempt Gettier-type counterexamples. We combine this with ideas from belief revision and awareness (...) logics to provide an account for explicitly justified knowledge based on conclusive evidence that addresses the problem of omniscience. (shrink)

We take a logical approach to threshold models, used to study the diffusion of opinions, new technologies, infections, or behaviors in social networks. Threshold models consist of a network graph of agents connected by a social relationship and a threshold value which regulates the diffusion process. Agents adopt a new behavior/product/opinion when the proportion of their neighbors who have already adopted it meets the threshold. Under this diffusion policy, threshold models develop dynamically towards a guaranteed fixed point. We construct a (...) minimal dynamic propositional logic to describe the threshold dynamics and show that the logic is sound and complete. We then extend this framework with an epistemic dimension and investigate how information about more distant neighbors’ behavior allows agents to anticipate changes in behavior of their closer neighbors. Overall, our logical formalism captures the interplay between the epistemic and social dimensions in social networks. (shrink)

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, (...) and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science. The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation. Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations. (shrink)

We propose a new model for forming and revising beliefs about unknown probabilities. To go beyond what is known with certainty and represent the agent’s beliefs about probability, we consider a plausibility map, associating to each possible distribution a plausibility ranking. Beliefs are defined as in Belief Revision Theory, in terms of truth in the most plausible worlds. We consider two forms of conditioning or belief update, corresponding to the acquisition of two types of information: learning observable evidence obtained by (...) repeated sampling from the unknown distribution; and learning higher-order information about the distribution. The first changes only the plausibility map, but leaves the given set of possible distributions essentially unchanged; the second rules out some distributions, thus shrinking the set of possibilities, without changing their plausibility ordering.. We look at stability of beliefs under either of these types of learning, defining two related notions, as well as a measure of the verisimilitude of a given plausibility model. We prove a number of convergence results, showing how our agent’s beliefs track the true probability after repeated sampling, and how she eventually gains in a sense knowledge of that true probability. Finally, we sketch the contours of a dynamic doxastic logic for statistical learning. (shrink)

In this paper, we investigate the social herding phenomenon known as informational cascades, in which sequential inter-agent communication might lead to epistemic failures at group level, despite availability of information that should be sufficient to track the truth. We model an example of a cascade, and check the correctness of the individual reasoning of each agent involved, using two alternative logical settings: an existing probabilistic dynamic epistemic logic, and our own novel logic for counting evidence. Based on this analysis, we (...) conclude that cascades are not only likely to occur but are sometimes unavoidable by "rational" means: in some situations, the group’s inability to track the truth is the direct consequence of each agent’s rational attempt at individual truth-tracking. Moreover, our analysis shows that this is even so when rationality includes unbounded higher-order reasoning powers, as well as when it includes simpler, non-Bayesian forms of heuristic reasoning. (shrink)

We investigate the process of truth-seeking by iterated belief revision with higher-level doxastic information . We elaborate further on the main results in Baltag and Smets (Proceedings of TARK, 2009a , Proceedings of WOLLIC’09 LNAI 5514, 2009b ), applying them to the issue of convergence to truth . We study the conditions under which the belief revision induced by a series of truthful iterated upgrades eventually stabilizes on true beliefs. We give two different conditions ensuring that beliefs converge to (...) “full” (complete) truth , as well as a condition ensuring only that they converge to true (but not necessarily complete) beliefs. (shrink)

In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the logical foundations of Quantum Physics, and in particular the area known as Operational Quantum Logic, as developed by Jauch and Piron (Helve Phys Acta 42: 842-848, 1969), Pirón (Foundations of Quantum Physics, (...) 1976). By bringing these areas together we explain the basic ingredients of Dynamic Quantum Logic, a new direction of research in the logical foundations of physics. (shrink)

We propose a refinement of STIT logic to make it suitable to model causal agency and responsibility in basic multi-agent scenarios in which agents can interfere with one another. We do this by supplementing STIT semantics, first, with action types and, second, with a relation of opposing between action types. We exploit these novel elements to represent a test for potential causation, based on an intuitive notion of expected result of an action, and two tests for actual causation from the (...) legal literature, i.e. the but-for and the NESS tests. We then introduce three new STIT operators modeling corresponding notions of causal responsibility, which we call potential, strong, and plain responsibility, and use them to provide a fine-grained analysis of a number of case studies involving both individual agents and groups. (shrink)

We present a logical calculus for reasoning about information flow in quantum programs. In particular we introduce a dynamic logic that is capable of dealing with quantum measurements, unitary evolutions and entanglements in compound quantum systems. We give a syntax and a relational semantics in which we abstract away from phases and probabilities. We present a sound proof system for this logic, and we show how to characterize by logical means various forms of entanglement (e.g. the Bell states) and various (...) linear operators. As an example we sketch an analysis of the teleportation protocol. (shrink)

We introduce Arbitrary Public Announcement Logic with Memory (APALM), obtained by adding to the models a ‘memory’ of the initial states, representing the information before any communication took place (“the prior”), and adding to the syntax operators that can access this memory. We show that APALM is recursively axiomatizable (in contrast to the original Arbitrary Public Announcement Logic, for which the corresponding question is still open). We present a complete recursive axiomatization, that includes a natural finitary rule, and study this (...) logic’s expressivity and the appropriate notion of bisimulation. We then examine Group Announcement Logic with Memory (GALM), the extension of APALM obtained by adding to its syntax group announcement operators, and provide a complete finitary axiomatization (again in contrast to the original Group Announcement Logic, for which the only known axiomatization is infinitary). We also show that, in the memory-enhanced context, there is a natural reduction of the so-called coalition announcement modality to group announcements (in contrast to the memory-free case, where this natural translation was shown to be invalid). (shrink)

Public announcement logic is an extension of multiagent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. We propose an extension of public announcement logic with a dynamic modal operator that expresses what is true after any announcement: after which , does it hold that Kφ? We give various semantic results and show completeness for a Hilbert-style axiomatization of this logic. There is a natural generalization to a logic for arbitrary events.

Compositionality is a principle used in logic, philosophy, mathematics, linguistics, and computer science for assigning meanings to language expressions in a systematic manner following syntactic construction, thereby allowing for a perspicuous algebraic view of the syntax-semantics interface. Yet the status of the principle remains under debate, with positions ranging from compositionality always being achievable to its having genuine empirical content. This paper attempts to sort out some major issues in all this from a logical perspective. First, we stress the fundamental (...) harmony between Compositionality and its apparent antipode of Contextuality that locates meaning in interaction with other linguistic expressions and in other settings than the actual one. Next, we discuss basic further desiderata in designing and adjudicating a compositional semantics for a given language in harmony with relevant contextual syntactic and semantic cues. In particular, in a series of concrete examples in the realm of logic, we point out the dangers of over-interpreting compositional solutions, the ubiquitous entanglement of assigning meanings and the key task of explaining given target inferences, and the dynamics of new language design, illustrating how even established compositional semantics can be rethought in a fruitful manner. Finally, we discuss some fresh perspectives from the realm of game semantics for natural and formal languages, the general setting for Samson Abramsky’s influential work on programming languages and process logics. We highlight outside-in coalgebraic perspectives on meanings as finite or infinitely unfolding behavior that might challenge and enrich current discussions of compositionality. (shrink)

We propose a new topological semantics for evidence, evidence-based justifications, belief, and knowledge. Resting on the assumption that an agent’s rational belief is based on the available evidence, we try to unveil the concrete relationship between an agent’s evidence, belief, and knowledge via a rich formal framework afforded by topologically interpreted modal logics. We prove soundness, completeness, decidability, and the finite model property for the associated logics, and apply this setting to analyze key epistemological issues such as “no false lemma” (...) Gettier examples, misleading defeaters, undefeated justification versus undefeated belief, as well as the defeasibility theories of knowledge. (shrink)

McCall (1984) offered a semantics of counterfactual conditionals based on “real possible worlds” that avoids using the vague notion of similarity between possible worlds. I will propose an interpretation of McCall’s counterfactuals in a formal framework based on Baltag-Moss-Solecki events and protocols. Moreover, I will argue that using this interpretation one can avoid an objection raised by Otte (1987).

The goal of this paper is to present a collection of properties of the set of atoms and the set of finite injective tuples of atoms, as well as of the powersets of atoms in the framework of finitely supported structures. Some properties of atoms are obtained by translating classical Zermelo–Fraenkel results into the new framework, but several important properties are specific to finitely supported structures.

Since Kaplan : 81–98, 1979) first provided a logic for context-sensitive expressions, it has been thought that the only way to construct a logic for indexicals is to restrict it to arguments which take place in a single context— that is, instantaneous arguments, uttered by a single speaker, in a single place, etc. In this paper, I propose a logic which does away with these restrictions, and thus places arguments where they belong, in real world conversations. The central innovation is (...) that validity depends not just on the sentences in the argument, but also on certain abstract relations between contexts. This enrichment of the notion of logical form leads to some seemingly counter-intuitive results: a sequence of sentences may make up a valid argument in one sequence of contexts, and an invalid one in another such sequence. I argue that this is an unavoidable result of context sensitivity in general, and of the nature of indexicals in particular, and that reflection on such examples will lead us to a better understanding of the idea of applying logic to context sensitive expressions, and thus to natural language in general. (shrink)

Background. The events of 9/11 and the October 2002 National Intelligence Estimate on Iraq's Continuing Programs for Weapons of Mass Destruction precipitated fundamental changes within the US Intelligence Community. As part of the reform, analytic tradecraft standards were revised and codified into a policy document – Intelligence Community Directive (ICD) 203 – and an analytic ombudsman was appointed in the newly created Office for the Director of National Intelligence to ensure compliance across the intelligence community. In this paper we investigate (...) the untested assumption that the ICD203 criteria can facilitate reliable evaluations of analytic products. Method. Fifteen independent raters used a rubric based on the ICD203 criteria to assess the quality of reasoning of 64 analytical reports generated in response to hypothetical intelligence problems. We calculated the intra-class correlation coefficients for single and group-aggregated assessments. Results. Despite general training and rater calibration, the reliability of individual assessments was poor. However, aggregate ratings showed good to excellent reliability. Conclusions. Given that real problems will be more difficult and complex than our hypothetical case studies, we advise that groups of at least three raters are required to obtain reliable quality control procedures for intelligence products. Our study sets limits on assessment reliability and provides a basis for further evaluation of the predictive validity of intelligence reports generated in compliance with the tradecraft standards. (shrink)

The value in Hartmann’s point of view can be watched from the perspective of some heteronymous plans - an ideal one, which would be “the modality of existence”, and a real one, which would be “the modality of knowing” the value. In Hartmann’s expression we deal with “the absolute character” 1 of values and “the apriority of knowing the values”. It’s interfering here the problem of the validity of values. The question is if the existence of values is reduced to (...) their validity, or if they exist without the dependence of the real states of the world. This validity, for Hartmann, is strictly referring to the second plan, the real one, which is dealing with values. The values are valid “for” – we have here the connection with the existing- but they have their own “world” beside this nip with reality that we call unbiased 2 . The validity of value is aprioristic, no matter the appreciation - like one “pure subjective”, arbitrary - the apriority of value is not depending of some constrain and converge at the level of the logical schemes of thinking. In the general conception of Hartmann’s philosophy the problem of value is diminishing in the analysis of the distinction between the theory of knowledge plan, which is aiming at the subject-object domain, and the ontological one, represented by the relation objective - trans-objective. Although the philosophical analysis will be done from the perspective of the theory of knowledge domain of the relation subject-object, the problem that will concern mostly Hartman will be the objective - trans-objective report seen from the angle of one “critic ontology”, trying to solve the problem of the report between general and specific in the way of being of the axiological structure. (shrink)

This paper aims to show that there is a lot of philosophy in the philosophy of chemistry—not only in the problems and questions specific to chemistry, which this science brings up in philosophical discussions, but also in the topics of wider interest like reductionism and emergence, for which chemistry proves to be an ideal case study. The fact that chemical entities and properties are amenable to a quantitative understanding, to measurement and experiment to a greater extent than those in psychology (...) or biology, makes chemistry an ideal case study for those interested in reductionism and emergence. (shrink)

In this article I aim to provide the first normative discussion of barter voting markets, namely markets which allow the trading of votes on issues/elections for votes on other issues/elections. The article is framed within the wider literature on the legal permissibility of vote buying, with a particular focus on the recent debate between Christopher Freiman and James Stacey Taylor. I argue that while Taylor's objections successfully defeat Freiman's case in favour of standard voting markets, they are unable to also (...) defeat the type of voting markets outlined here. Furthermore, I argue that there are at least two plausible prima facie reasons in favour of barter voting markets, grounded in their capacity to contribute to the alleviation of injustice for systematically disadvantaged socio‐economic groups and to their capacity to reduce one form of bad voting, i.e. voting from ignorance. (shrink)

The past decade or so has witnessed an increase in the number of philosophical discussions about emergence and reduction in science. However, many of these discussions (though not all) remain too abstract and theoretical, and are wanting with respect to concrete examples taken from the sciences. This dissertation studies the topics of reduction and emergence in the context of a case study. I focus on the case of chemistry and investigate how emergentism can help us secure the autonomy of this (...) discipline in relation to the underlying microphysics. I develop an account of emergence (called functional emergence) that is, I argue, capable of answering the question of why we have chemistry instead of just applied quantum mechanics. I argue that functionally emergent properties in chemistry -- properties that are defined by their behaviour, not by some shared microphysical constituent -- can help us defend the autonomy of chemistry; they allow for the existence of sui generis chemical regularities, which can be used in sui generis chemical explanations. Functional emergence generates difficulties for some accounts of inter-theoretic reduction, but unlike other theories of emergence it is compatible with weaker forms of reductionism. (shrink)

In this paper I aim to provide a novel account of the Democratic Argument for limitarianism. I first claim that the standard version of this argument is questionable due to its reliance on a problematic central premise, namely that excessive wealth damages democracy because of its detrimental impact on political equality. Subsequently, I relocate the fundamental democratic worry in regard to excessive wealth in the process of backsliding, and more specifically in the relation between excessive wealth and political polarization. I (...) then offer a new account of the Democratic Argument for limitarianism which envisages wealth capping as instrumental for democratic resilience, but I maintain that the argument is not unambiguously successful. (shrink)

In this paper I seek to assess the responses provided by several theories of sufficientarian justice in cases where individuals hold different conceptions of rationality. Towards this purpose, I build two test cases and study the normative prescriptions which various sufficiency views offer in each of them. I maintain that resource sufficientarianism does not provide a normatively plausible response to the first case, since its distributive prescriptions would violate the principle of personal good and that subjective-threshold welfare sufficientarianism as well (...) as objective-threshold welfare sufficientarianism committed to the headcount claim do not provide normatively plausible responses to the second case, since their distributive prescriptions would violate the principle of equal importance. I then claim that an objective-threshold welfare sufficientarian view committed to prioritarianism under the threshold offers the normatively plausible response to both cases and therefore resists the challenge raised by scenarios that involve differential conceptions of rationality. (shrink)

Synonymy, at its most basic, is sameness of meaning. A token-reflexive expression is an expression whose meaning assigns a referent to its tokens by relating each particular token of that particular expression to its referent. In doing so, the formulation of its meaning mentions the particular expression whose meaning it is. This seems to entail that no two token-reflexive expressions are synonymous, which would constitute a strong objection against token-reflexive semantics. In this paper, I propose and defend a notion of (...) synonymy for token-reflexive expressions that allows such expressions to be synonymous, while being a fairly conservative extension of the customary notion of synonymy. (shrink)

This book contains twelve engaging philosophical lectures given by Alexandru Dragomir, most of them given during Romania’s Communist regime. The lectures deal with a diverse range of topics, such as the function of the question, self-deception, banalities with a metaphysical dimension, and how the world we live in has been shaped by the intellect. Among the thinkers discussed in these lectures are Anaxagoras, Socrates, Plato, Aristotle, Descartes, and Nietzsche. Alexandru Dragomir was a Romanian philosopher born in 1916. After (...) studying law and philosophy at the University of Bucharest, he left Romania to study for a doctorate in philosophy in Freiburg, Germany, under Martin Heidegger. He stayed in Freiburg for two years, but before defending his dissertation he was called back to Romania for military service and sent to the front. After 1948, historical circumstances forced him to become a clandestine philosopher: he was known only within a very limited circle. He died in 2002 without ever publishing anything. It was only after his death that Dragomir's notebooks came to light. His work has been published posthumously in five volumes by Humanitas, Bucharest; the present volume is the first to appear in English translation. In 2009, the Alexandru Dragomir Institute for Philosophy was founded in Bucharest as an independent research institute under the auspices of the Romanian Society for Phenomenology. (shrink)

The article conveys the portrait of a man for whom understanding was a matter of the highest spiritual intimacy, a man who continuously disregarded his possible engagement in the public life as a philosopher, finally a man whom we find, in the twilight of his life, concerned with the intricate tension between the “muteness” of philosophy (as being able “only” to double life by means of rational discourse) and religion. Alexandru Dragomir’s portrait is portrayed in comparison to another important (...) Romanian philosopher, Constantin Noica. The comparison is not accidental, since they both come to represent two paradigmatic ways of making philosophy: traditional ontology (centered around Descartes – Kant – Hegel) vs. modern phenomenology (centered around Husserl – Heidegger). (shrink)