Revision sequences were introduced in 1982 by Herzberger and Gupta as a mathematical tool in formalising their respective theories of truth. Since then, revision has developed in a method of analysis of theoretical concepts with several applications in other areas of logic and philosophy. Revision sequences are usually formalised as ordinal-length sequences of objects of some sort. A common idea of revision process is shared by all revision theories but specific proposals can (...) differ in the so-called limit rule, namely the way they handle the limit stages of the process. The limit rules proposed by Herzberger and by Belnap show different mathematical properties, called periodicity and reflexivity, respectively. In this paper we isolate a notion of cofinally dependent limit rule, encompassing both Herzberger’s and Belnap’s ones, to study periodicity and reflexivity in a common framework and to contrast them both from a philosophical and from a mathematical point of view. We establish the equivalence of weak versions of these properties with the revision-theoretic notion of recurring hypothesis and draw from this fact some observations about the problem of choosing the “right” limit rule when performing a revision-theoretic analysis. (shrink)

Theories of truth and vagueness are closely connected; in this article, I draw another connection between these areas of research. Gupta and Belnap’s Revision Theory of Truth is converted into an approach to vagueness. I show how revision sequences from a general theory of definitions can be used to understand the nature of vague predicates. The revision sequences show how the meaning of vague predicates are interconnected with each other. The approach is contrasted with the (...) similar supervaluationist approach. (shrink)

The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I (...) want to do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes. (shrink)

The classical theory of definitions bans so-called circular definitions, namely, definitions of a unary predicate P, based on stipulations of the form $$Px =_{\mathsf {Df}} \phi,$$where ϕ is a formula of a fixed first-order language and the definiendumP occurs into the definiensϕ. In their seminal book The Revision Theory of Truth, Gupta and Belnap claim that “General theories of definitions are possible within which circular definitions [...] make logical and semantic sense” [p. IX]. In order to sustain their claim, (...) they develop in this book one general theory of definitions based on revision sequences, namely, ordinal-length iterations of the operator which is induced by the definition of the predicate. Gupta-Belnap’s approach to circular definitions has been criticised, among others, by D. Martin and V. McGee. Their criticisms point to the logical complexity of revision sequences, to their relations with ordinary mathematical practice, and to their merits relative to alternative approaches. I will present an alternative general theory of definitions, based on a combination of supervaluation and ω-length revision, which aims to address some criticisms raised against revision sequences, while preserving the philosophical and mathematical core of revision. (shrink)

Revision sequences are a kind of transfinite sequences which were introduced by Herzberger and Gupta in 1982 as the main mathematical tool for developing their respective revision theories of truth. We generalise revision sequences to the notion of cofinally invariant sequences, showing that several known facts about Herzberger’s and Gupta’s theories also hold for this more abstract kind of sequences and providing new and more informative proofs of the old results.

This thesis proposes and presents two new models for belief representation and belief revision. The first model is the B-structures model which relies on a notion of partial language splitting and tolerates some amount of inconsistency while retaining classical logic. The model preserves an agent's ability to answer queries in a coherent way using Belnap's four-valued logic. Axioms analogous to the AGM axioms hold for this new model. The distinction between implicit and explicit beliefs is represented and psychologically plausible, (...) computationally tractable procedures for query answering and belief base revision are obtained. ;The second model presents a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the conclusion and formulas in the sequence. The relevance relations are ternary as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely representable formalism and a plausible model of reasoning for automated agents. (shrink)

We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ (...) is similarly \Pi13 and which is complete in Gödel’s universe of constructible sets L; (iv) give an alternative account of a theory of truth—realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points. (shrink)

According to the revision theory of truth, the paradoxical sentences have certain revision periods in their valuations with respect to the stages of revision sequences. We find that the revision periods play a key role in characterizing the degrees of paradoxicality for Boolean paradoxes. We prove that a Boolean paradox is paradoxical in a digraph, iff this digraph contains a closed walk whose height is not any revision period of this paradox. And for any (...) finitely many numbers greater than 1, if any of them is not divisible by any other, we can construct a Boolean paradox whose primary revision periods are just these numbers. Consequently, the degrees of Boolean paradoxes form an unbounded dense lattice. The area of Boolean paradoxes is proved to be rich in mathematical structures and properties. (shrink)

We investigate how to assign probabilities to sentences that contain a type-free truth predicate. These probability values track how often a sentence is satisfied in transfinite revision sequences, following Gupta and Belnap’s revision theory of truth. This answers an open problem by Leitgeb which asks how one might describe transfinite stages of the revision sequence using such probability functions. We offer a general construction, and explore additional constraints that lead to desirable properties of the resulting probability (...) function. One such property is Leitgeb’s Probabilistic Convention T, which says that the probability of φ equals the probability that φ is true. (shrink)

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes (...) with infinitely many finite primary periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

In this paper we apply the idea of Revision Rules, originally developed within the framework of the theory of truth and later extended to a general mode of definition, to the analysis of the arithmetical hierarchy. This is also intended as an example of how ideas and tools from philosophical logic can provide a different perspective on mathematically more “respectable” entities. Revision Rules were first introduced by A. Gupta and N. Belnap as tools in the theory of truth, (...) and they have been further developed to provide the foundations for a general theory of (possibly circular) definitions. Revision Rules are non-monotonic inductive operators that are iterated into the transfinite beginning with some given “bootstrapper” or “initial guess.” Since their iteration need not give rise to an increasing sequence, Revision Rules require a particular kind of operation of “passage to the limit,” which is a variation on the idea of the inferior limit of a sequence. We then define a sequence of sets of strictly increasing arithmetical complexity, and provide a representation of these sets by means of an operator G(x, φ) whose “revision” is carried out over ω2 beginning with any total function satisfying certain relatively simple conditions. Even this relatively simple constraint is later lifted, in a theorem whose proof is due to Anil Gupta. (shrink)

In this paper we show that the Gupta-Belnap systems S# and S* are П12. Since Kremer has independently established that they are П12-hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.

In interviews, it may happen that a respondent gives an answer which seems well formatted, but is not receipted as acceptable by the interviewer. In this article I examine one way in which interviewers display their diagnosis of the problem and act to bring about its solution. In the cases I describe, the interviewers defer revision of the question until they have established a new, more personalized basis for it, informed by their knowledge of the respondents' circumstances. There are (...) three things of interest. The first is how this actually works conversationally; it seems to be structured as an insertion sequence and played out by presequential turns which are highly projective of the respondent's agreement. The second is that the scenario that the interviewer inserts is a positive example of what would have been an answer to the `failed' original question. The third is that there is a difference between the original, general question and its subsequent, specific revision. I argue that all these features manifest interviewers' solution of their dilemma in choosing between literal and sensitive questioning. (shrink)

People use commonsense science knowledge to flexibly explain, predict, and manipulate the world around them, yet we lack computational models of how this commonsense science knowledge is represented, acquired, utilized, and revised. This is an important challenge for cognitive science: Building higher order computational models in this area will help characterize one of the hallmarks of human reasoning, and it will allow us to build more robust reasoning systems. This paper presents a novel assembled coherence theory of human conceptual change, (...) whereby people revise beliefs and mental models by constructing and evaluating explanations using fragmentary, globally inconsistent knowledge. We implement AC theory with Timber, a computational model of conceptual change that revises its beliefs and generates human-like explanations in commonsense science. Timber represents domain knowledge using predicate calculus and qualitative model fragments, and uses an abductive model formulation algorithm to construct competing explanations for phenomena. Timber then scores competing explanations with respect to previously accepted beliefs, using a cost function based on simplicity and credibility, identifies a low-cost, preferred explanation and accepts its constituent beliefs, and then greedily alters previous explanation preferences to reduce global cost and thereby revise beliefs. Consistency is a soft constraint in Timber; it is biased to select explanations that share consistent beliefs, assumptions, and causal structure with its other, preferred explanations. In this paper, we use Timber to simulate the belief changes of students during clinical interviews about how the seasons change. We show that Timber produces and revises a sequence of explanations similar to those of the students, which supports the psychological plausibility of AC theory. (shrink)

Kremer presented three approaches of comparing fixed-point and revision theories of truth in Kremer, 363–403, 2009). Using these approaches, he established the relationships among ten fixed-point theories suggested by Kripke in, 690–716, 1975) and three revision theories presented by Gupta and Belnap in. This paper continues Kremer’s work. We add five other revision theories to the comparisons, including the theory proposed by Gupta in, 1–60, 1982), the theory proposed by Herzberger in, 61–102, 1982), the theory based on (...) fully-varied revision sequences proposed by Gupta and Belnap in, the theory proposed by Yaqūb in, and the theory based on weakly consistent revision sequences. We show that, the notion of Thomason model defined by Belnap’s limit rule is not equivalent to the one defined by Gupta’s limit rule, and that the theory based on fully-varied revision sequences is ≤2-equivalent to the one based on the greatest intrinsic fixed point of σ. (shrink)

Analyzing the process of keeping promise we identify its sequence structure and its phase sequences in time. This allows us to arrive at a time order principle forming according to which obligation performance cannot precede in time its sufficient or necessary conditions performance. We further observe that a given promise must always be taken as an element of a certain system of promises. As a result we review definitions of the terms sufficient condition and necessary condition as no more (...) allowing their mutual defining, or symmetry (conversion). We try to discover the compliance rules concerning the condition – the conditioned vector, the course of events vector and the time vector. We conclude that it indicates an incorrect use if, provided the condition – the conditioned vector complies with the course of events vector, the negative time difference in the descriptive use of sentences involving either the if-then connective or the only if connective is obtained. Only when using sentences for abductive explanation with a dominating epistemic vector the negative difference of time does not indicate erroneous use; however, this is possible only for the term of sufficient condition. We further suggest reviewed definition generalization involving the terms of sufficient condition and necessary condition containing always a parameter element denoting a given modality type, or a particular system of rules, laws, etc. Such definition satisfies Brennan’s requirement of a “general formal scheme” where the notion of sufficient condition and necessary condition symmetry (conversion) does not apply. (shrink)

We describe the solution of the Limit Rule Problem of Revision Theory and discuss the philosophical consequences of the fact that the truth set of Revision Theory is a complete 1/2 set.

We strengthen the revised GCH theorem by showing, e.g., that for , for all but finitely many regular κ ω implies that the diamond holds on λ when restricted to cofinality κ for all but finitely many .We strengthen previous results on the black box and the middle diamond: previously it was established that these principles hold on for sufficiently large n; here we succeed in replacing a sufficiently large n with a sufficiently large n.The main theorem, concerning the accessibility (...) of λ on cofinality κ, Theorem 3.1, implies as a special case that for every regular λ>ω, for some κ<ω, we can find a sequence such that , , and we can fix a finite set of “exceptional” regular cardinals θ<ω so that if Aλ satisfies A<ω, there is a pair-coloring so that for every -monochromatic BA with no last element, letting δ:=supB it holds that —provided that is not one of the finitely many “exceptional” members of. (shrink)

We show how to construct partial nontrivial base revision operators that satisfy the analogues of the AGM postulates and depends on no extra‐logical consideration. These operators, closely related to the full meet revision process, are defined on stratified bases, in which the information can be ranked in logical sequences. Stratified bases, which can be viewed as sets of graded sheaves, are exactly the knowledge bases for which the full meet revision operator satisfies the rationality postulate K*8. (...) As the revision of a stratified base is again a stratified base, it is possible to perform iterated revisions, and the resulting output is particularly easy to determine. (shrink)

After a number of decades of research into the dynamics of rational belief, the belief revision theory community remains split on the appropriate handling of sequences of changes in view, the issue of so-called iterated revision. It has long been suggested that the matter is at least partly settled by facts pertaining to the results of various single revisions of one’s initial state of belief. Recent work has pushed this thesis further, offering various strong principles that ultimately (...) result in a wholesale reduction of iterated to one-shot revision. The present paper offers grounds to hold that these principles should be significantly weakened and that the reductionist thesis should ultimately be rejected. Furthermore, the considerations provided suggest a close connection between the logic of iterated belief change and the logic of evidential relevance. (shrink)

A simple rule of probability revision ensures that the final result of a sequence of probability revisions is undisturbed by an alteration in the temporal order of the learning prompting those revisions. This Uniformity Rule dictates that identical learning be reflected in identical ratios of certain new-to-old odds, and is grounded in the old Bayesian idea that such ratios represent what is learned from new experience alone, with prior probabilities factored out. The main theorem of this paper includes as (...) special cases Field's theorem on commuting probability-kinematical revisions and the equivalence of two strategies for generalizing Jeffrey 's solution to the old evidence problem to the case of uncertain old evidence and probabilistic new explanation. (shrink)

We show in this paper that the AGM postulates are too weak to ensure the rational preservation of conditional beliefs during belief revision, thus permitting improper responses to sequences of observations. We remedy this weakness by proposing four additional postulates, which are sound relative to a qualitative version of probabilistic conditioning. Contrary to the AGM framework, the proposed postulates characterize belief revision as a process which may depend on elements of an epistemic state that are not necessarily (...) captured by a belief set. We also show that a simple modification to the AGM framework can allow belief revision to be a function of epistemic states. We establish a model-based representation theorem which characterizes the proposed postulates and constrains, in turn, the way in which entrenchment orderings may be transformed under iterated belief revision. (shrink)

We present a method for relevance sensitive non-monotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formulas guided by two orderings: a temporal sequencing and an ordering based on relevance relations between the putative conclusion and formulas in the sequence. The relevance relations (...) are ternary (using context as a parameter) as opposed to standard binary axiomatizations. The inference operation thus defined easily handles iterated revision by maintaining a revision history, blocks the derivation of inconsistent answers from a possibly inconsistent sequence and maintains the distinction between explicit and implicit beliefs. In doing so, it provides a finitely presented formalism and a plausible model of reasoning for automated agents. (shrink)

ABSTRACT We consider evolution of knowledge bases caused by a sequence of basic steps of acquisition of a new information, either consistent or inconsistent with the original system. To make this process comply with the Principe of Minimal Change, a special evidence metric is introduced for measuring distance between states of knowledge. Then a novel semantics of knowledge bases is developed suggested by the heuristics of weighted maximally consistent subsets. The latter is efficiently applied to the processes of consistent and (...) inconsistent acquisition of knowledge, belief revision and contraction. (shrink)

The reanalysis of genomic sequencing results has the potential to provide results that are of considerable medical and personal importance to recipients. Employing interviews with forty-seven predominantly medically underserved families and ethnographic observations we argue that there is pressing need to standardize the approach taken to reanalysis. Our findings highlight that study participants were unclear as to the likelihood of reanalysis happening, the process of initiating reanalysis, and whether they would receive revised results. Their reflections mirror the lack a specific (...) focus upon reanalysis within consent and results sessions as observed in clinical settings. Mechanisms need to be put into place that standardize the approach to reanalysis in research and in clinical contexts. This would enable clinicians and genetic counsellors to communicate clearly with research participants with respect to potential for reanalysis of results and the process of reanalysis. We argue that that the role of reanalysis is too important to be referred to in an ad-hoc manner. Furthermore, the ad-hoc nature of the current process may increase health inequities given the likelihood that only those families who have the means to press for reanalysis are likely to receive it. (shrink)

A simple rule of probability revision ensures that the final result ofa sequence of probability revisions is undisturbed by an alterationin the temporal order of the learning prompting those revisions.This Uniformity Rule dictates that identical learning be reflectedin identical ratios of certain new-to-old odds, and is grounded in the oldBayesian idea that such ratios represent what is learned from new experiencealone, with prior probabilities factored out. The main theorem of this paperincludes as special cases (i) Field's theorem on commuting (...) probability-kinematical revisions and (ii) the equivalence of two strategiesfor generalizing Jeffrey's solution to the old evidence problem tothe case of uncertain old evidence and probabilistic new explanation. (shrink)

Revision in history is conventionally characterized as a linear sequence of changes over time. Drawing together the contributions of those engaged in historiographical debates that are often associated with the term "revision," however, we find our attention directed to the spaces rather than the sequences of history. Contributions to historical debates are characterized by the marked use of spatial imagery and spatialized language. These used to suggest both the demarcation of the "space of history" and the erasure (...) of existing historiographies from that space. Bearing these features in mind, the essay argues that traditional, temporally oriented explanations for revision in history, such as Thomas S. Kuhn's Structure of Scientific Revolutions, miss the mark, and that a more promising line of explanation arises from the combined use of Michel Foucault's idea of "heterotopias" and Marc Augé's idea of "non-places." Revision in history is to be found where writers use imagery to move readers away from rival historiographies and to control their movement in the space of history toward their desired vision. Revision is thus associated more with control than with liberation. (shrink)

This book summarizes the intense research that the author performed for his Ph.D. thesis , revised and with the addition of an intuitionistic critique of Husserl's concept of number. His starting point consisted of a double conviction: 1) Brouwerian intuitionism is a valid way of doing mathematics but is grounded on a weak philosophy; 2) Husserlian phenomenology can provide a suitable philosophical ground for intuitionism. In order to let intuitionism and phenomenology match, he had to solve in general two problems: (...) 1) the question of the reciprocal indifference that the authors had toward each other's theorizing which indeed they knew; 2) Husserl's general attitude of accepting classical mathematics, which contrasts with the critical attitude of the intuitionists.Moreover, in the specific case focused on by this book—concerning choice sequences, that is, sequences that can be completely lawless and that were admitted as mathematical entities by Brouwer—van Atten had to handle a further problem: such sequences do not fit the characteristic of omnitemporality that the late Husserl seemed to consider a necessary attribute of entities if they were to be considered mathematical. In as far as they are lawless we cannot predict at any moment how they will develop in the future, hence they are not determined at any particular time—they will be determined only in the future.Let us begin with van Atten's first conviction, i.e., that Brouwerian intuitionism is grounded on a weak philosophy. We have to recall that Brouwer provided a mystical attitude for proposing his intuitionism: man can obtain happiness only by keeping himself closed inside the inner Self. Any attempted movement towards the exterior world is a source of pain: in particular language and the sciences. Mathematics, in order to be morally acceptable …. (shrink)

A model of inductive inquiry is defined within a first-order context. Intuitively, the model pictures inquiry as a game between Nature and a scientist. To begin the game, a nonlogical vocabulary is agreed upon by the two players along with a partition of a class of structures for that vocabulary. Next, Nature secretly chooses one structure ("the real world") from some cell of the partition. She then presents the scientist with a sequence of atomic facts about the chosen structure. With (...) each new datum the scientist announces a guess about the cell to which the chosen structure belongs. To succeed in his inquiry, the scientist's successive conjectures must be correct all but finitely often, that is, the conjectures must converge in the limit to the correct cell. A special kind of scientist selects his hypotheses on the basis of a belief revision operator. We show that reliance on belief revision allows scientists to solve a wide class of problems. (shrink)

Is genre film comparable to a thought experiment?Revising concepts of determinism and agency in three film noirs The philosophical approach of film genres, first popularized by authors like Stanley Cavell, allows to consider genre films as narrative variations as pertinent to philosophical discourse as can be a traditional thought experiment, since every question on the essence of a genre and every discussion related to its inner functions, its mechanisms and its themes, generate naturally a philosophical discourse on the way a (...) director uses filmic and narrative tools to transform his intentions into a specific system of meaning. This study adopts formalist and philosophical approaches to connect the narratives of the movies to the discourses it is prone to generate. The corpus draws on the ‘primitive scene' in three films noirs, Out of the Past, The Lady from Shanghai et Criss Cross : the tragic meeting of an anti-hero with the woman who will be responsible of his fall. Indeed, the sequence showing this first meeting becomes an exercise in style where forerunning signs of the two protagonists' fall organize the writing and the mise-en-scene, and explicitly shows how questions of agency and determinism are intimately articulated to the narrative and formal frame of the movies. (shrink)

In this Hypothesis and Theory paper, we consider the problem of learning deeply structured knowledge representations in the absence of predefined ontologies, and in the context of long-term learning. In particular, we consider this process as a sequence of re-representation steps, of various kinds. The Information Dynamics of Thinking theory (IDyOT) admits such learning, and provides a hypothetical mechanism for the human-like construction of hierarchical memory, with the provision of symbols constructed by the system that embodies the theory. The combination (...) of long-term learning and meaning construction in terms of symbols grounded in perceptual experience entails that the system, like a human, be capable of memory consolidation, to manage the complex and inconsistent structures that can result from learning of information that becomes more complete over time. Such consolidation changes memory structures, and thus changes their meaning. Therefore, memory consolidation entails re-representation, while re-representation entails changes of meaning. Ultimately, the theory proposes that the processes of learning and consolidation should be considered as repeated re-representation of what is learned. (shrink)

The foundations of the narrative about the partisan war in socialist Yugoslavia drew from the familiar tradition of folktales and prompted the moulding of a group of characters who, as a rule, followed a pre-established sequence of events, offering a rather polished image of the People’s Liberation Struggle. This paper will focus on one archetype that found its place in the war myth–the partisan mother. The aim of the paper is to illustrate how the women who experienced the armed conflict (...) in Yugoslavia described women’s wartime engagement. More specifically, it shows the extent of their participation in the promotion of the officially established image of the partisan mother and the aspects in which their narrative reimagined, enriched and challenged the heritage of the People’s Liberation Struggle. (shrink)

American Academy of Pediatrics (AAP) and American College of Medical Genetics (ACMG) recently provided two recommendations about predictive genetic testing of children. The Clinical Sequencing Exploratory Research Consortium's Pediatrics Working Group compared these recommendations, focusing on operational and ethical issues specific to decision making for children. Content analysis of the statements addresses two issues: (1) how these recommendations characterize and analyze locus of decision making, as well as the risks and benefits of testing, and (2) whether the guidelines conflict or (...) come to different but compatible conclusions because they consider different testing scenarios. These statements differ in ethically significant ways. AAP/ACMG analyzes risks and benefits using best interests of the child and recommends that, absent ameliorative interventions available during childhood, clinicians should generally decline to order testing. Parents authorize focused tests. ACMG analyzes risks and benefits using the interests of the child and other family members and recommends that sequencing results be examined for additional variants that can lead to ameliorative interventions, regardless of age, which laboratories should report to clinicians who should contextualize the results. Parents must accept additional analysis. The ethical arguments in these statements appear to be in tension with each other. (shrink)

We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: (...) -CA0 (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in (...) Field’s recent models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.

Inspired by recent work on proof theory for modal logic, this paper develops a cut-free labelled sequent calculus obtained by imitating Herzberger’s limit rule for revision sequences as a clause in a possible world semantics. With the help of two completeness theorems, one between the labelled sequent calculus and the corresponding possible world semantics, and one between the axiomatic theory of truth PosFS and a neighbourhood semantics, together with the proof of the equivalence between the two semantics, we (...) show that the theory of truth obtained with the labelled sequent calculus based on Herzberger’s limit rule is equivalent to PosFS. (shrink)

Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.

The ideas of fixed points (Kripke in Recent essays on truth and the liar paradox. Clarendon Press, London, pp 53–81, 1975; Martin and Woodruff in Recent essays on truth and the liar paradox. Clarendon Press, London, pp 47–51, 1984) and revision sequences (Gupta and Belnap in The revision theory of truth. MIT, London, 1993; Gupta in The Blackwell guide to philosophical logic. Blackwell, London, pp 90–114, 2001) have been exploited to provide solutions to the semantic paradox and (...) have achieved admirable success. This happy situation naturally encourages one to look for other philosophical areas of their further applications where paradoxical results seem to follow from intuitively acceptable principles. In this paper, I propose to extend the use of these ideas to give two new treatments of abstract objects. Sections 1 and 2 below check several abstractionist theories and their main defects. Section 3 shows how the two ideas can be applied to generate consistent theories of abstract objects without any ad hoc restriction on any principle. (shrink)

There is much discussion in the media and some of the scientific literature of how many of the conclusions from scientific research should be doubted. These critiques often focus on studies – typically in non‐experimental spheres of biomedical and social sciences – that search large datasets for novel correlations, with a risk that inappropriate statistical evaluations might yield dubious conclusions. By contrast, results from experimental biological research can often be interpreted largely without statistical analysis. Typically: novel observation(s) are reported, and (...) an explanatory hypothesis is offered; multiple labs undertake experiments to test the hypothesis; interpretation of the results may refute the hypothesis, support it or provoke its modification; the test/revise sequence is reiterated many times; and the field moves forward. I illustrate this experimental/non‐experimental dichotomy by examining the contrasting recent histories of: (a) our remarkable and growing understanding of how several inositol‐containing phospholipids contribute to the lives of eukaryote cells; and (b) the difficulty of achieving any agreed mechanistic understanding of why consuming dietary supplements of inositol is clinically beneficial in some metabolic diseases. (shrink)