A non-probabilistic Approach to Inductive Prediction

Size: px
Start display at page:

Download "A non-probabilistic Approach to Inductive Prediction"

Transcription

1 A non-probabilistic Approach to Inductive Prediction Lieven Haesaert Centre for Logic and Philosophy of Science Universiteit Gent, Belgium February 20, 2004 Abstract The underlying idea behind the adaptive logics of inductive generalization is that most inductive reasoning can be explicated by simple qualitative means. Therefore, those classical models are selected that are as uniform as possible with respect to a certain set of (empirical) data. This led to the question if the same idea of uniformity can be applied if no generalizations are derivable. It is clear that in this case one may be still interested to make some direct inductive predictions. The main problem with this kind of prediction is that we lack a decision theory for it. In the present paper we make some proposals to deal with this problem. Our purpose here is to get more control over the difficult aspects of inductive prediction. In order to do so, we will not proceed in a probabilistic context, but we will apply the idea of minimizing the abnormalities in uniform models, an idea that derives from the adaptive logic programm. 1 Aim of this paper In our [1], we have presented some adaptive logics for induction based on Classical Logic (henceforth: CL). The underlying idea of these adaptive logics of induction is that most inductive reasoning does not proceed in terms of probabilities, and cannot be explicated in terms of probabilities, but can be explicated by rather simple qualitative means. In that paper we presented for example the adaptive logic for inductive generalization IL +m : from a set of data and (possibly falsified) background knowledge, inductive generalizations are derived 1. In the same paper we also Research for this paper was supported by subventions from Ghent University and indirectly by the the Flemish Minister responsible for Science and Technology (contract BIL01/80). The author is greatly indebted to Diderik Batens for his very enlightening comments and discussions, his ideas and his help with the calculations made in this paper. 1 This is putted between quotes, because derived is meant here in a relative way. If a generalization is derived, this means it is derived with respect to a certain set of data. We will not use these quotes later 1

2 presented IL m, the logic of induction in which background knowledge is disregarded. Than, the underlying idea is the following: given a set of data, choose those models of the data that are maximally uniform the idea of course derives from Carnap s [7]. Now, to be more precise, the IL m -consequences of a set of data Γ are those generalizations that are verified by all minimally abnormal models of Γ, where Ab(M), the abnormal part of a CL-model M, is defined as the formulas of the form A A (in which A abbreviates the existential closure of A) that are verified by the model and a CL-model M of Γ is a minimally abnormal model of Γ if there is no CL-model M of Γ such that Ab(M ) Ab(M). Here, the preferred models of Γ are those CL-models that are as uniform as possible. Remark that the abnormal part of a model consists of all negations of the general axiom scheme A A. If this axiom scheme is added to CL, the uniform classical models are obtained. This axiom scheme is accepted for each instance case until and unless it is proven that it doesn t hold. The adaptive logic(s) of inductive generalization seem rather adequate and lead to a number of interesting insights on inductive generalization. This led to the question whether a similar idea, viz. uniformity, can be applied in the case of inductive predictions. Of course, inductive predictions can be derived from inductive generalizations, but what we are interested in here are predictions that seem natural even in cases where no inductive generalizations can be derived. So, for example, you better predict that the first person you will meet in the streets is not going to be a criminal and will kill you, even though you know that there are criminals around in the world and some of them are killers. To put the problem more technically, suppose the following, very simple, set of data is given: Γ = {P a Qa, P b Qb, P c Qc, P d Qd, P e} and that one is interested in predicting Qe. Of course, the generalization ( x)(p x Qx) is not IL m -derivable because of P d Qd; though it is reasonable to predict Qe. The main problem here is that we lack a positive test 2 for such an inference relation we do not have a real criterion to decide if the prediction holds. This lack of positive test is typical for consequence relations that are non-monotonic and it is clear that this is the case for these direct inductive predictions. If new data is gained and added to Γ, there may be good reasons to predict Qe for instance if 10 other objects are found to be P Q. At this point, adaptive logics appear on the boards, because they dispose of a dynamical proof format that is proven to be very suitable in explicating non-monotonic human reasoning processes. However, in this paper we will not focus on adaptive logics and the dynamical character of inductive prediction. 3 Instead, it is our present purpose to get more grip on some difficult aspects of direct inductive prediction, viz. how the inductive predictions may be justified (in a relative way). Let us here at once explain an important peculiarity of the direct inductive prediction we will consider in this paper. If the data justify the prediction that an object which is known to be P is Q, then it is right to predict so for any object known to be P. So, if the data justify the prediction that an object which is known to be a cube is red, then it is right to predict so for any object known to be a cube. This feature may be compared with the situation in a probabilistic 2 A standard reference of such matters is [6] 3 See [8] and [4] for philosophical introductions to the adaptive logic programme, and [3] and [5] for more technical ones. A constantly updated overview of the results can also be found at 2

3 context: if the probability of tails is higher than.5, then it is justified to predict tails for any number of tosses in a row. A very different situation is obtained in the case of statistical predictions, such as the answer to the question How many of the next observed cubes will be red? This is a wholly different matter that is not considered in the present paper. Now, in order to get more control over the aspects of direct inductive predictions, we will not start from the traditional probabilistic context. Instead we will approach the matter in a rather qualitative way, viz. by applying the idea of uniformity. Then, a first important question that presents itself is the following: which form uniformity should take in order to deal with direct inductive prediction? 2 Maximal Uniformity As a first approach, inductive prediction presupposes that the world is as uniform as possible, and this means, in the unary case, that couples of objects that differ in some respect are minimized. The models we need here are those CL-models that are maximally uniform in view of a certain premise set. Now, let a CL-model be a couple D, v in which D is a set and v is a valuation (or interpretation) of primitive linguistic entities with respect to D as usual and let Γ be the set of data. Than, an abnormality of a CL-model M of Γ may be defined as a couple o 1, o 2 (o 1, o 2 D) such that, for some formula A(x), M = A(o 1 ) and M = A(o 2 ). So an abnormality occurs each time two objects differ in at least one aspect. The general idea now will be that the minimally abnormal (or maximally uniform) models of Γ are those CL-models of Γ that display the least number of abnormalities, which means the models are selected through a numerical comparison. Here we already remark that (and this is well known from approaches in terms of logical or personalistic probabilities), in measuring the abnormal part of a model, one has to take all formulas A into account, not just the primitive predicates and not just the strongest predicates definable in the language. On the other hand, it will be clear that there is no reason to count all abnormalities that belong to the same equivalence class. We refer to Section 5 for more details. Another remark concerns the defined form of abnormalities. In the logic of inductive generalization, the abnormalities are formulas of a certain form that are verified by a model and the preferred models of Γ are selected in view of subset-relations between their abnormal parts and those of other models of Γ. On the other hand, in the logic of inductive prediction, the abnormalities are defined as couples of elements of the domain (in general, couples of n-tuples of such elements) of which one member verifies and the other falsifies a formula A. The preferred models of Γ are selected in view of numerical relations between their abnormal parts and those of other models of Γ. A question that arises now is: how should we draw this numerical comparison? As we will illustrate, the degree of abnormality provoked by the predictions becomes higher if also tests are taken into account. But let us first consider the situation in which no tests are involved. 3

4 3 A mere Collection of Observations As a first approximation, we will start from the presupposition that the data are merely collected by the observer. By merely we mean that the observer did not perform some (scientific) action, such as a kind of test, but that he took the things as they came. The following sketch may be more clarifying. Let us consider a simplified universe, consisting of a set of objects, not all of which need to have names, and two unary predicates, P and Q. Suppose a large box is hanging from the ceiling, containing objects that either are spheres or cubes (say, P and P ) and are either red or black (say, Q or Q). So, in the box there will be red spheres (P Q), black spheres (P Q), red cubes ( P Q) and black cubes ( P Q). We can observe or estimate the number of objects in the box, but we cannot observe their shape or color. Two other boxes are hanging from the ceiling, a color box and a shape box. We can see the color of the objects in the color box (say because it has a little hole in each slot that can contain an object) and we can see the shape of the objects in the shape box (for example a shadow box). Now suppose a demon is moving between the different boxes, but we cannot see his moves. He now and then picks some objects from the large box and puts them into the color box or into the shape box, or throws them on the floor. The latter means we see both the color and the shape of the objects. The demon can also throw objects from the color box or from the shape box onto the floor. We ourselves can not undertake some action, but we can only observe colors or shapes and write it down. If the situation is analogous to the just described demon-episode, our observations may be summarized as follows: P n 1 n 2 n 3 P n 4 n 5 n 6?P n 7 n 8 n 9 The n i are numbers here, but we shall also use them to refer to the cells and to the cases (P α Qα,...) which they represent. So, n 1 different objects are known to be both P and Q, n 2 objects are known to be P and Q, n 3 objects are known to be P but are neither known to be Q nor known to be Q, etc..... So, to talk in terms of the demon-analogy, there are n 9 (completely undetermined) objects in the large box, n 3 spherical, n 6 cubic objects in the shape box, etc. In this scheme we can determine all abnormalities (of this simplified universe). For example, the objects in the n 1 -cell behave abnormal with respect to all objects that belong to the cells n 2, n 4, n 5, n 6 or n 8. Moreover, this scheme enables us to calculate the number of all abnormalities that are known until yet. We let it to the reader to check this. The cells n 1, n 2, n 4 and n 5 are central and represent the objects thrown on the floor, thus those that are fully known. The outer border cells contain the objects on which we want to make predictions. These objects are expressed by question marks. The purpose now is to move the objects belonging to cells with question marks into the four central inner cells in such a way that the number of abnormalities provoked by the model is as low as possible. 4

5 4 Minimizing the abnormalities In the simplified universe we just presented, we can make the following inductive predictions: we can predict the color of an object known to be a sphere, or of an object known to be a cube (both of them are in the shape box), or of an object of which no property is determined as yet (because it is still in the large box). Similarly we can predict the shape of a red object, of a black object, or of an object of which the color is undetermined. Finally we can predict both the shape and color of an undetermined object. Sometimes we can verify our prediction, if the demon is kind enough to move the object to the right box or to the floor. Remark that all cells that contain objects that are not fully determined, will be emptied if it represents a CL-model all elements of the domain are determined with respect to both P and Q. Making a prediction means that an object of the outer border cells moves to either n 1, n 2, n 4 or n 5. It is worth to remark that they are actually putted in there in a conditional way: if new information is gained, there may be reasons to make another prediction, or it may be that a certain prediction is later falsified and should be withdrawn. However, the most interesting aspect of making predictions on partly or fully unknown objects is that they cause new abnormalities, by which the badness of its models, viz. the degree of uniformity, is increased. At the end, those predictions will be retained that together cause the least number of abnormalities. So, the choice of a prediction will depend on the set of all possible predictions, including the prediction itself. To clarify the whole situation, let us now consider a specific knowledge situation as summarized in the following table P P ?P and suppose that we want to predict the color of the object known to be spherical (the single object in the P?Q-cell). Some will predict that this object is Q because among the objects known to be P, 100 are known to be Q and only 3 are known to be Q. However, this reasoning is not really coherent. Indeed, each of the objects in the?p Q-cell, is either P or P, and if we follow the above reasoning, they are all going into the P Q-cell whereas the object from the?p Q should go in the P Q-cell. But then, there are 1003 objects with property P Q, which means that the object in the P?Q-cell should be moved to the P Q-cell. So, depending on the order in which this reasoning is applied, it leads to different results. One might hope to rescue the situation by first applying the very same reasoning to the objects in the?p?q-cell in order to locate them in the P Qcell. However, if there is, say, a 5 in the?p?q-cell, the inconsistency is not removed. Let us now have a look at the outcome obtained by the idea of minimizing the abnormalities in moving the outer border cells into the inner cells. So, we took all possibilities of combining the outer border cells with the four central cells into account and we calculated for each combination the abnormal part, 5

6 viz. the number of abnormalities, verified by the model. These calculations are complicated 64 combinations can be made but a computer programm may help here. We calculated the minimally abnormal model (which amounts to the maximally uniform model) and here is the outcome of the calculations: P P ?P P P 1 12 The table on the left side represents the knowledge situation, namely the data gathered by the observer. The table on the right side represents the situation after predicting all objects and is obtained by the idea of minimizing the abnormalities. In this case, one can see that the only object in the P?Q-cell moves to the P Q-cell. The 1000 objects from the?p Q-cell move to the same cell. Incidentally, in this case, where the objects of the different cells go, is independent of the value in the?p?q-cell (the fully undetermined objects), but it can be shown that this is not always so in other cases. 4 So, if we follow the above results to predict the partly or fully unknown objects, we obtain the least number of abnormalities. All other possibilities of moving the outer border cells into the four central cells, for example by moving the object in the P?Q-cell to the P Q-cell and leaving the other moves as they are, lead to models that produce a higher number of abnormalities, thus less uniformity. 5 Partial Analogies Should not be Neglected If we take a look on the above schemes, we may say that the underlying idea is roughly the following. As there are more P s than non-p s and more non-q s then Q s, the objects from the P?Q-cells and those from the?p Q-cells are concentrated in the P Q-cell. The objects from the P?Q-cell go to the P Q-cell, and those from the?p Q-cell to the P Q-cell this is as expected, as it results in the highest possible concentration. Finally, the objects from the?p?q-cell go to the cell that already contains the highest concentration, viz. the P Q-cell. Some will still find it somewhat strange that the only object from the P?Qcell moves to the P Q-cell, whereas it is known that most P are Q. But like already indicated, an approach in terms of the non-standard quantifier most does not work. One of the reasons is that in such an approach the effects of partial analogy do not weigh enough. Let us carefully explain what is meant. As we remarked before, in measuring the abnormal part of the model one has to take all formulas A into account and not just the primitive predicates and not just the strongest predicates definable in the language. It is right that P a Qa and (P b Qb) causes an abnormality, but if P b Qb should be known, then this abnormality should weigh heavier than in case P b Qb or P b Qb were known. We let it to the reader to check this. 4 Some examples are already known in which the result is dependent objects in the?p?qcell. 6

7 On the other hand, there is no reason to count all abnormalities. Thus, if o 1, o 2 is abnormal with respect to A, then it is abnormal with respect to A, etc., and moreover o 2, o 1 is abnormal with respect to A, with respect to A, etc. So we took the following provisional decision: we introduce equivalence classes of formulas, pick a preferred simplest form A for each of them, and count the abnormalities with respect to A provided A is not of the form B. We admit, however, that there is need for further study in these quarters. At this point, it is interesting to see what happens if for example only the strongest definable predicates of the language are taken into account. Here the partial analogies are neglected in our calculation of the abnormal part of models. The result is then quite different, viz. as follows: P P ?P P P So, as may be seen, here the partly or fully unknown objects are simply concentrated in such a way that abnormalities with respect to the strongest definable predicates are minimized, and the effects of partial analogy (here with respect to P and with respect to Q) are not taken into account. The result is quite different from the former result and some will even contend that it is a better result, because now the only object of the P?Q-cell moves to the P Q-cell. However, the following example will illustrate more clearly why partial analogies should not be neglected. Suppose we dispose of the following knowledge situation: P P 1 1 1?P If just the strongest definable predicates are taken into account, the only minimally abnormal model is: P 14 1 P 1 3 As the objects in the P?Q-cell and in the?p Q-cell are concentrated in the P Q-cell this gives the maximum concentration for them in view of the two objects that were already present in that cell, the objects in the P?Q-cell and in the?p Q-cell are concentrated in the P Q-cell. The objects from the?p?q-cell go to the P Q-cell (the one that has to comprise the highest number of objects anyway). However, this result is not adequate. Indeed, the amount of the P Qobjects, the P Q-objects and the P Q-objects is in this specific knowledge 7

8 situation similar, viz. 1. So, there seems no good reason to predict the Q?P - objects to be P. Moreover, as there are more P s than P s, it seems better predicted to be P. The same reasoning applies for the object in the P?Q-cell: as there are more Q s than not Q s, it seems better predicted to be Q. If we also take into account abnormalities with respect to P and with respect to Q, we obtain the following result: P 14 2 P 2 1 Now, the objects in the P?Q-cell and that in the?p Q-cell move to different cells, which is more adequate than to concentrate them together in the P Q-cell. It means that if the data are collected in the way described in the demon-episode, we cannot make an appeal on our normal meaning (or intuitions) about the most. This all means that reasoning in terms of the most is not really coherent. But like we will show now, the whole situation is getting totally different if we also take into account the effects of tests. 6 Tests Let us reconsider the first example: P P ?P P P On the approach discussed so far, the only minimally abnormal model is the table on the right side and so one should predict that the object that was known to be P?Q is P Q. Nevertheless, some will still call the above results into question and they will argue that the fact that 103 P s have been tested on Q-hood and that 100 of them turned out to be Q is an argument to predict that the object that was known to be P?Q is P Q. However, this argument is confused. In view of the way in which we represented our knowledge before the boxes and our increase of knowledge by the moves of the demon we have not tested any P s on Q-hood. All knowledge considered so far was the result of accidental matters, viz. the moves of the demon. Although, it is indeed correct that we are able to test objects of a kind on some properties the previous representation of our knowledge situation was a simplification and that the outcomes of such tests play a role in our predictions. It is easy to refashion the knowledge representation in terms of the demonepisode in such a way that tests are taken into account as well. Now we should be given the possibility to pick objects from the large box and move them to either the color box or the shape box or throw them onto the floor. In that way we can test the fully undetermined objects on their color or on their shape or 8

9 even simultaneously on both. In the same way, we may pick objects from the color box and from the shape box and move them onto the floor. Tests actually have two effects on our predictions. On the one hand, by doing tests we force some objects from cells that are described by expressions containing question marks to cells described by expressions that contain less question marks. Thus by testing the P -hood objects in the?p Q-cell, the number in that cell will decrease and the number in the P Q-cell and/or in the P Q-cell will increase. There is a second effect of tests. Suppose that the figures in the P Q-cell and in the P Q-cell were obtained as follows: two objects in each cell are known to be there by accident, whereas the others are there as the result from tests. In other words, we have tested 99 objects from the P?Q-cell on Q-hood and the result was, for instance, that 98 turned out to be Q and 1 turned out to be Q. If this is the situation, we have a further reason to predict that an object in the P?Q-cell is Q: if we would test it, we would expect it to be Q. So, roughly we may say that there is a difference in abnormalities that are originating from tests and abnormalities originating from mere observation. These originating from tests weigh heavier. The main problem with these new abnormalities is to define them with respect to the model. Let us offer a tiresome but simple solution in the next section. 7 Defining the new abnormalities We extend the language of our simplified universe until now only consisting of two predicates P and Q in such a way that we may discriminate between the data gained from tests and the data that are given by the demon. For any predicate P, we introduce the predicates P and P to denote the objects that were fully undetermined and turned out to be P, respectively P as the result of a test for P -hood. For any two predicates P and Q we introduce the predicates P ; Q and P ; Q. The former is used as an expression for the objects that were known to be P, were tested on Q-hood and turned out to be Q, whereas the latter is seen as an expression for the objects that were fully undetermined, were tested on P -hood and turned out to be P, and next were tested on Q-hood and turned out to be Q. By using the same reasoning, there will as well expressions such as P ; Q, P ; Q, Q; P, Q; P etc. Finally we also introduce P Q to denote the objects that were tested simultaneously on P -hood and Q-hood and turned out to be both P and Q. The same holds for P Q, etc. Now we extend the assignment function v to the effect way that v(p ) v(p ) and v( P ) D v(p ). It follows that v(p ; Q) (v(p ) v(q)), v(q; P ) (v(q) v(p )), v(q; P ) (v(q) v(p )), v(p Q) (v(q) v(p )), etc. At the end, we require that v(p ; Q) v(q; P ) = (that is, we will not test P -objects on Q-hood, if we already knew the object was Q and turned out to be P in a test on P -hood) v(p ; Q) v(p ; Q) =, v(p ; Q) v(p Q) =, etc. It is tiresome to express all the independencies, but it is all extremely simple and systematic. As will be shown, the introduction of these new predicates enables us to take into account the effects of tests by making inductive predictions. As desired, we may now define new abnormalities that will have their influence by the 9

10 calculation of the minimal abnormal model. Any object now that is known to be P as well as Q is not only abnormal with respect to the P, Q, P Q, etc., but also with respect to the objects that are P, Q, P ; Q, etc. Remark here that the way in which we introduced the tested predicates, provides that there can be no abnormalities such as (P a Qa) (P b; Qb) and (P a Qa) ( Qb; P b) or (P a Qa) (P b; Qb) and (P a Qa) (P b; Qb) at the same time. But the nice effect of the introduction of new predicates is that we now can integrate the effects tests have on inductive prediction. Indeed, new abnormalities will evolve now and as will be shown in the next section, taking into account these abnormalities leads to interesting results. 8 Taking into account the new abnormalities Let us return to the first situation again: P P ?P The point now to be considered is the weight of the new abnormalities that arise by the introduction of tests. Suppose the numbers in the P Q-cell and in the P Q-cell were obtained as follows: 99 of them are the result of testing P -objects on Q-hood, 98 turned out to be Q en 1 to be Q, whereas two objects in each cell are known there by accident. The test outcome may be summarized as follows: P 98 1 To take into account the effects of this test, we again rely on Carnap s [7] to set the weight of an abnormality equal to the number of objects tested in the relevant test. So, analogous as in the case of partial analogies, it is right that P a Qa and P b Qb causes an abnormality, but if P b; Qb is known, then this weighs heavier as in the case only P b Qb is known. It is obvious now that the outcome of the present test changes the weight of abnormality caused by predicting that the object in the P?Q-slot is Q. As only one new abnormality is created by this prediction, the prediction increases the badness of its models by 99 1 = 99. If we should predict that the P?Qobject is Q, 98 new abnormalities are created and it increases the badness of its models by = We have good reasons to expect now that the minimal abnormal model of this set of data will verify that it is right to predict that the object in the P?Q-cell belongs to Q-hood. However, the calculation of the minimally abnormal model of a set of data comprising tested predicates is even more complex than in the case no tests are available: we do not only have to take into account the partial analogies now, but we have to take the tested predicates into account as well. Here again a computer programm may help. So we calculated the minimally abnormal model and we obtained the following result: 10

11 P P 11 2 As expected, the object only known to be P moves to the P Q-cell. So taking into account the outcome of the test of 99 P s with respect to Q-hood has dramatic consequences. It is not only sufficient to predict that the object in the P?Q-slot is Q, but also to predict that objects?p?q-slot are both P and Q, and that objects in the P?Q-slot have property Q. One might suspect that the dramatic change is largely due to the fact that there are so many (viz ) objects in the?p?q-cell. This, however, is not the case, even if there is no object in that cell, but the other figures are the same (including those of the test), then the outcome is similar, viz. P P ?P P P 11 2 Let us remark that in some cases the number of P s tested on Q-hood does not have a sufficiently large effect. One then should first test more P s on Q- hood, as expected. As the example reveals, this may require that one first tests undetermined objects on P -hood, and next tests those found to be P on Q-hood. This is exactly as it should be. If you want to reliably predict the behavior of blackbirds, first locate blackbirds and next observe their behavior. To finish it is worth noticing that the introduction of tests does not free our knowledge from bias. Thus the demon may have a bias for placing red objects in the shape box, and this will have an effect on the representative character of our color tests on cubes and spheres. This, however, is all right as long as our color tests on cubes have only effects on our color predictions about objects we know to be cubes these have been moved to the shape box by the same demon. Moreover, some further demons may be present in the different boxes, and influence the properties of objects we pick from them. Thus there may be a demon in the color box that moves the objects in such a way that, whenever we pick a red object, it is more likely to be a cube. Again, if there is such a demon, its presence will likewise influence our tests and the correctness of our predictions. 9 In Conclusion Further research will focus on making the criteria determining prediction as simple as possible. This is why we are trying for example to reduce these criteria to the abnormalities caused by prediction. As was clarified in this paper, predictions increase the amount of abnormalities verified by a model. It will depend on the degree of abnormality a prediction provokes, if it will be accepted or not. The main problem is that one single prediction is dependent on the set of all possible predictions. Another interesting aspect that was not considered in this paper are the dynamics by which inductive predictions are characterized. It should be clear 11

12 to the reader now that the predictions change if the set of data changes or if new insights in the data are obtained. That is why we are trying to construct a suitable dynamic proof theory for inductive prediction, for which we will proceed in the context of adaptive logics. Finally, it may be argued that the present approach is not probabilistic, but still rather complex. However, the obtained results are adequate and shed some more light on the very complicated matter of inductive prediction. 5 References [1] Diderik Batens and Lieven Haesaert, (2001) On Classical adaptive logis of induction, in: Logique et Analyse, vol , pp (appeared 2003) [2] Diderik Batens, (1998), Inconsistency-adaptive logics, in: Or lowska E., ed., Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Springer Verlag, Heidelberg, New York, pp [3] Diderik Batens, (2000), A survey of inconsistency-adaptive logics, in: Batens D., Mortensen C., Priest G., Van Bendegem J.P., eds., Frontiers of Paraconsistent Logic, Kings College Publications, London, pp [4] Diderik Batens, Extending the Realm of Logic. The adaptive logic program, to appear. [5] Diderik Batens, The need for adaptive logics in epistemology, to appear [6] George S. Boolos and Richard J. Jeffrey, (1989), Computability and Logic, third edition, Cambridge University Press [7] Rudolf Carnap, (1952), The Continuum of Inductive Methods, University of Chicago Press, Chicago [8] Diderik Batens, (1997), Inconsistencies and beyond. A logical-philosophical discussion, in: Revue Internationale de Philosophie, vol. 51, pp Unpublished papers in the reference section are available at the internet address 12

A Universal Logic Approach to Adaptive Logics

A Universal Logic Approach to Adaptive Logics A Universal Logic Approach to Adaptive Logics Diderik Batens Centre for Logic and Philosophy of Science Ghent University, Belgium Diderik.Batens@UGent.be January 11, 2006 Abstract In this paper, adaptive

More information

5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci

5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci 5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci Arnon Avron School of Computer Science, Tel-Aviv University http://www.math.tau.ac.il/ aa/ March 7, 2008 Abstract One of the

More information

Introduction to Metalogic

Introduction to Metalogic Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)

More information

Tableau Systems for Logics of Formal Inconsistency

Tableau Systems for Logics of Formal Inconsistency Tableau Systems for Logics of Formal Inconsistency Walter A. Carnielli Centre for Logic and Epistemology, and Department of Philosophy State University of Campinas CLE/Unicamp, Campinas, Brazil João Marcos

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

An adaptive logic for relevant classical deduction

An adaptive logic for relevant classical deduction Journal of Applied Logic 5 (2007) 602 612 www.elsevier.com/locate/jal An adaptive logic for relevant classical deduction Hans Lycke Centre for Logic and Philosophy of Science, Universiteit Gent, Belgium

More information

A Formal Logic for the Abduction of Singular Hypotheses

A Formal Logic for the Abduction of Singular Hypotheses A Formal Logic for the Abduction of Singular Hypotheses Joke Meheus Centre for Logic and Philosophy of Science University of Ghent, Belgium Joke.Meheus@UGent.be This is the final version of the paper as

More information

A RICH PARACONSISTENT EXTENSION OF FULL POSITIVE LOGIC DIDERIK BATENS AND KRISTOF DE CLERCQ

A RICH PARACONSISTENT EXTENSION OF FULL POSITIVE LOGIC DIDERIK BATENS AND KRISTOF DE CLERCQ Logique & Analyse 185 188 (2004), 227 257 A RICH PARACONSISTENT EXTENSION OF FULL POSITIVE LOGIC DIDERIK BATENS AND KRISTOF DE CLERCQ Abstract In the present paper we devise and study the most natural

More information

4 ENTER Adaptive Logics

4 ENTER Adaptive Logics 4 0 4 ENTER Adaptive Logics 4.1 The problem 4.2 Characterization of an adaptive Logic 4.3 Annotated dynamic proofs: Reliability 4.4 Semantics 4.5 Annotated dynamic proofs: Minimal Abnormality 4.6 Some

More information

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)

More information

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil Studia Humana Volume 6:4 (2017), pp. 3 9 DOI: 10.1515/sh-2017-0023 Guilherme Kubiszeski Existence and Predication in Free Logics Secretaria de Estado de Educação do Distrito Federal, Brasil email: guilhermefk4@gmail.com

More information

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic

More information

Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv pages

Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv pages Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv + 408 pages by Bradley Monton June 24, 2009 It probably goes without saying that

More information

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Bayesian Epistemology Radical probabilism doesn t insists that probabilities be based on certainties;

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell s logicism. Jeff Speaks. September 26, 2007 Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................

More information

Problem Solving and Adaptive Logics. A Logico-Philosophical Study

Problem Solving and Adaptive Logics. A Logico-Philosophical Study Problem Solving and Adaptive Logics. A Logico-Philosophical Study Diderik Batens Centre for Logic and Philosophy of Science Ghent University, Belgium Diderik.Batens@UGent.be http://logica.ugent.be/dirk/

More information

REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS

REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS Diderik BATENS and Jean Paul VAN BENDEGEM I. I t is well-known that Alan Ross Anderson and

More information

Supplementary Logic Notes CSE 321 Winter 2009

Supplementary Logic Notes CSE 321 Winter 2009 1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious

More information

MATH2206 Prob Stat/20.Jan Weekly Review 1-2

MATH2206 Prob Stat/20.Jan Weekly Review 1-2 MATH2206 Prob Stat/20.Jan.2017 Weekly Review 1-2 This week I explained the idea behind the formula of the well-known statistic standard deviation so that it is clear now why it is a measure of dispersion

More information

A Formal Logic for Abductive Reasoning

A Formal Logic for Abductive Reasoning A Formal Logic for Abductive Reasoning JOKE MEHEUS and DIDERIK BATENS, Centre for Logic and hilosophy of Science, Ghent University, Blandijnberg 2, B 9000 Gent, Belgium. E-mail: Joke.Meheus@UGent.be, Diderik.Batens@UGent.be

More information

A DISJUNCTION IS EXCLUSIVE UNTIL PROVEN OTHERWISE INTRODUCING THE ADAPTIVE LOGICS APPROACH TO GRICEAN PRAGMATICS

A DISJUNCTION IS EXCLUSIVE UNTIL PROVEN OTHERWISE INTRODUCING THE ADAPTIVE LOGICS APPROACH TO GRICEAN PRAGMATICS A DISJUNCTION IS EXCLUSIVE UNTIL PROVEN OTHERWISE INTRODUCING THE ADAPTIVE LOGICS APPROACH TO GRICEAN PRAGMATICS Hans Lycke Abstract In Gricean pragmatics, generalized conversational implicatures (GCI)

More information

3 The Semantics of the Propositional Calculus

3 The Semantics of the Propositional Calculus 3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical

More information

Outline. Adaptive Logics. Introductory Remarks (2) Introductory Remarks (1) Incomplete Survey. Introductory Remarks (3)

Outline. Adaptive Logics. Introductory Remarks (2) Introductory Remarks (1) Incomplete Survey. Introductory Remarks (3) Outline Adaptive Logics The Logics You Always Wanted Diderik Batens Centre for Logic and Philosophy of Science Ghent University, Belgium Diderik.Batens@UGent.be http://logica.ugent.be/dirk/ http://logica.ugent.be/centrum/

More information

The predicate calculus is complete

The predicate calculus is complete The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,

More information

Part II On the Equivalence of Scientific Theories

Part II On the Equivalence of Scientific Theories Published in Philosophy of Science, 1960, 27, 359 365. Studies in the Empiricist Theory of Scientific Meaning Part II On the Equivalence of Scientific Theories Abstract Drawing upon the Carnapian explication

More information

2) There should be uncertainty as to which outcome will occur before the procedure takes place.

2) There should be uncertainty as to which outcome will occur before the procedure takes place. robability Numbers For many statisticians the concept of the probability that an event occurs is ultimately rooted in the interpretation of an event as an outcome of an experiment, others would interpret

More information

What is an Ideal Logic for Reasoning with Inconsistency?

What is an Ideal Logic for Reasoning with Inconsistency? What is an Ideal Logic for Reasoning with Inconsistency? Ofer Arieli School of Computer Science The Academic College of Tel-Aviv Israel Arnon Avron School of Computer Science Tel-Aviv University Israel

More information

Logic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014

Logic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014 John Nachbar Washington University December 26, 2014 Logic and Proofs 1 1 Overview. These notes provide an informal introduction to some basic concepts in logic. For a careful exposition, see, for example,

More information

Introduction to Logic and Axiomatic Set Theory

Introduction to Logic and Axiomatic Set Theory Introduction to Logic and Axiomatic Set Theory 1 Introduction In mathematics, we seek absolute rigor in our arguments, and a solid foundation for all of the structures we consider. Here, we will see some

More information

Adaptive Logics for Abduction and the Explication of Explanation-Seeking Processes

Adaptive Logics for Abduction and the Explication of Explanation-Seeking Processes Adaptive Logics for Abduction and the Explication of Explanation-Seeking Processes Joke Meheus Centre for Logic and Philosophy of Science Ghent University Blandijnberg 2 9000 Ghent, Belgium tel: ++ 32

More information

Binary Induction and Carnap s Continuum

Binary Induction and Carnap s Continuum Binary Induction and Carnap s Continuum Alena Vencovska School of Mathematics The University of Manchester, UK alena.vencovska@manchester.ac.uk Abstract We consider the problem of induction over languages

More information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 14 Introduction One of the key properties of coin flips is independence: if you flip a fair coin ten times and get ten

More information

For True Conditionalizers Weisberg s Paradox is a False Alarm

For True Conditionalizers Weisberg s Paradox is a False Alarm For True Conditionalizers Weisberg s Paradox is a False Alarm Franz Huber Department of Philosophy University of Toronto franz.huber@utoronto.ca http://huber.blogs.chass.utoronto.ca/ July 7, 2014; final

More information

For True Conditionalizers Weisberg s Paradox is a False Alarm

For True Conditionalizers Weisberg s Paradox is a False Alarm For True Conditionalizers Weisberg s Paradox is a False Alarm Franz Huber Abstract: Weisberg (2009) introduces a phenomenon he terms perceptual undermining He argues that it poses a problem for Jeffrey

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

Math 52: Course Summary

Math 52: Course Summary Math 52: Course Summary Rich Schwartz September 2, 2009 General Information: Math 52 is a first course in linear algebra. It is a transition between the lower level calculus courses and the upper level

More information

Automated Support for the Investigation of Paraconsistent and Other Logics

Automated Support for the Investigation of Paraconsistent and Other Logics Automated Support for the Investigation of Paraconsistent and Other Logics Agata Ciabattoni 1, Ori Lahav 2, Lara Spendier 1, and Anna Zamansky 1 1 Vienna University of Technology 2 Tel Aviv University

More information

In Being and Nothingness, Sartre identifies being-for-itself as consisting in the

In Being and Nothingness, Sartre identifies being-for-itself as consisting in the POINCARÉ, SARTRE, CONTINUITY AND TEMPORALITY JONATHAN GINGERICH Thus temporality is not a universal time containing all beings and in particular human realities. Neither is it a law of development which

More information

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1

Logic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1 Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in

More information

Strategies and Combinations

Strategies and Combinations Chapter 6 Strategies and Combinations In this chapter some more generic results will be presented. On the one hand, I shall introduce adaptive strategies other than Reliability and Minimal Abnormality.

More information

Paucity, abundance, and the theory of number: Online Appendices

Paucity, abundance, and the theory of number: Online Appendices Paucity, abundance, and the theory of number: Online Appendices Daniel Harbour Language, Volume 90, Number 1, March 2014, pp. s1-s4 (Article) Published by Linguistic Society of America DOI: https://doi.org/10.1353/lan.2014.0019

More information

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It

More information

Yablo s Paradox and the Omitting Types Theorem for Propositional Languages

Yablo s Paradox and the Omitting Types Theorem for Propositional Languages Yablo s Paradox and the Omitting Types Theorem for Propositional Languages Thomas Forster April 2, 2012 This on-line version contains a proof of the extended omitting types theorem which is omitted (Ha!)

More information

About the relationship between formal logic and complexity classes

About the relationship between formal logic and complexity classes About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular

More information

An Adaptive Logic for the Formal Explication of Scalar Implicatures

An Adaptive Logic for the Formal Explication of Scalar Implicatures An Adaptive Logic for the Formal Explication of Scalar Implicatures Hans Lycke Centre for Logic and Philosophy of Science, Ghent University, Blandijnberg 2, 9000 Gent, Belgium, Hans.Lycke@UGent.be http://logica.ugent.be/hans

More information

Hempel s Logic of Confirmation

Hempel s Logic of Confirmation Hempel s Logic of Confirmation Franz Huber, California Institute of Technology May 21, 2007 Contents 1 Hempel s Conditions of Adequacy 3 2 Carnap s Analysis of Hempel s Conditions 4 3 Conflicting Concepts

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More information

Kant and Finitism. Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy. Bill Tait. 4 June 2016

Kant and Finitism. Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy. Bill Tait. 4 June 2016 Kant and Finitism Crossing Worlds: Mathematical logisc, philosophy, art: For Juliette Kennedy Bill Tait 4 June 2016 The Problems Kant in The Critique of Pure Reason: How can there be synthetic a priori

More information

Combining Inductive Generalization and Factual Abduction

Combining Inductive Generalization and Factual Abduction Combining Inductive Generalization and Factual Abduction Mathieu Beirlaen Ruhr University Bochum Heinrich Heine University Düsseldorf mathieubeirlaen@gmail.com Abstract. The aim of this paper is to outline

More information

Axiomatic set theory. Chapter Why axiomatic set theory?

Axiomatic set theory. Chapter Why axiomatic set theory? Chapter 1 Axiomatic set theory 1.1 Why axiomatic set theory? Essentially all mathematical theories deal with sets in one way or another. In most cases, however, the use of set theory is limited to its

More information

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation to Mathematics Series Department of Mathematics Ohio

More information

Modal Dependence Logic

Modal Dependence Logic Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We

More information

TRUTH-THEORIES FOR FRAGMENTS OF PA

TRUTH-THEORIES FOR FRAGMENTS OF PA TRUTH-THEORIES FOR FRAGMENTS OF PA RICHARD G. HECK, JR. The discussion here follows Petr Hájek and Pavel Pudlák, Metamathematics of First-order Arithmetic (Berlin: Springer-Verlag, 1993). See especially

More information

Manual of Logical Style

Manual of Logical Style Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication

More information

In Defense of Jeffrey Conditionalization

In Defense of Jeffrey Conditionalization In Defense of Jeffrey Conditionalization Franz Huber Department of Philosophy University of Toronto Please do not cite! December 31, 2013 Contents 1 Introduction 2 2 Weisberg s Paradox 3 3 Jeffrey Conditionalization

More information

Precis of Aristotle s Modal Syllogistic

Precis of Aristotle s Modal Syllogistic Philosophy and Phenomenological Research Philosophy and Phenomenological Research Vol. XC No. 3, May 2015 doi: 10.1111/phpr.12185 2015 Philosophy and Phenomenological Research, LLC Precis of Aristotle

More information

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a

More information

Finitude and Infinitude in the Atomic Calculus of Individuals

Finitude and Infinitude in the Atomic Calculus of Individuals Finitude and Infinitude in the Atomic Calculus of Individuals WILFRID HODGES AND DAVID LEWIS BEDFORD COLLEGE, LONDON, AND UNIVERSITY OF CALIFORNIA AT LOS ANGELES Nelson Goodman has asked' whether there

More information

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015)

18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 18.S097 Introduction to Proofs IAP 2015 Lecture Notes 1 (1/5/2015) 1. Introduction The goal for this course is to provide a quick, and hopefully somewhat gentle, introduction to the task of formulating

More information

Takeaway Notes: Finite State Automata

Takeaway Notes: Finite State Automata Takeaway Notes: Finite State Automata Contents 1 Introduction 1 2 Basics and Ground Rules 2 2.1 Building Blocks.............................. 2 2.2 The Name of the Game.......................... 2 3 Deterministic

More information

Introduction to Metalogic 1

Introduction to Metalogic 1 Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,

More information

Linear Algebra, Summer 2011, pt. 3

Linear Algebra, Summer 2011, pt. 3 Linear Algebra, Summer 011, pt. 3 September 0, 011 Contents 1 Orthogonality. 1 1.1 The length of a vector....................... 1. Orthogonal vectors......................... 3 1.3 Orthogonal Subspaces.......................

More information

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation Statistics 62: L p spaces, metrics on spaces of probabilites, and connections to estimation Moulinath Banerjee December 6, 2006 L p spaces and Hilbert spaces We first formally define L p spaces. Consider

More information

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models

Chapter 2. Mathematical Reasoning. 2.1 Mathematical Models Contents Mathematical Reasoning 3.1 Mathematical Models........................... 3. Mathematical Proof............................ 4..1 Structure of Proofs........................ 4.. Direct Method..........................

More information

Kripke s Theory of Truth (for the strong Kleene scheme)

Kripke s Theory of Truth (for the strong Kleene scheme) Kripke s Theory of Truth (for the strong Kleene scheme) Presented by Christopher Gauker Version: July 26, 2006 Contemporary discussions of truth often make reference to Kripke s theory of truth (presented

More information

Volker Halbach. This paper has appeared in Analysis 66 (2006), , the misprint of (N2) has been corrected in vol. 67, 268

Volker Halbach. This paper has appeared in Analysis 66 (2006), , the misprint of (N2) has been corrected in vol. 67, 268 This paper has appeared in Analysis 66 (2006), 276-280, the misprint of (N2) has been corrected in vol. 67, 268 HOW NOT TO STATE THE T-SENTENCES Volker Halbach 1 On many accounts of truth the T-sentences

More information

I. Induction, Probability and Confirmation: Introduction

I. Induction, Probability and Confirmation: Introduction I. Induction, Probability and Confirmation: Introduction 1. Basic Definitions and Distinctions Singular statements vs. universal statements Observational terms vs. theoretical terms Observational statement

More information

34.1 Polynomial time. Abstract problems

34.1 Polynomial time. Abstract problems < Day Day Up > 34.1 Polynomial time We begin our study of NP-completeness by formalizing our notion of polynomial-time solvable problems. These problems are generally regarded as tractable, but for philosophical,

More information

Guide to Proofs on Sets

Guide to Proofs on Sets CS103 Winter 2019 Guide to Proofs on Sets Cynthia Lee Keith Schwarz I would argue that if you have a single guiding principle for how to mathematically reason about sets, it would be this one: All sets

More information

Cut-Elimination and Quantification in Canonical Systems

Cut-Elimination and Quantification in Canonical Systems A. Zamansky A. Avron Cut-Elimination and Quantification in Canonical Systems Abstract. Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules

More information

A Guide to Proof-Writing

A Guide to Proof-Writing A Guide to Proof-Writing 437 A Guide to Proof-Writing by Ron Morash, University of Michigan Dearborn Toward the end of Section 1.5, the text states that there is no algorithm for proving theorems.... Such

More information

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages)

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera

More information

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)

CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring

More information

McTaggart s Argument for the Unreality of Time:

McTaggart s Argument for the Unreality of Time: McTaggart s Argument for the Unreality of Time: A Temporal Logical Analysis Hunan Rostomyan In this paper I want to examine McTaggart s [1908] argument for the unreality of time. McTaggart starts with

More information

Section 3.1: Direct Proof and Counterexample 1

Section 3.1: Direct Proof and Counterexample 1 Section 3.1: Direct Proof and Counterexample 1 In this chapter, we introduce the notion of proof in mathematics. A mathematical proof is valid logical argument in mathematics which shows that a given conclusion

More information

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical

More information

Lecture 6: Finite Fields

Lecture 6: Finite Fields CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going

More information

Draft of February 2019 please do not cite without permission. A new modal liar 1 T. Parent

Draft of February 2019 please do not cite without permission. A new modal liar 1 T. Parent Draft of February 2019 please do not cite without permission 1. Introduction A new modal liar 1 T. Parent Standardly, necessarily is treated in modal logic as an operator on propositions (much like ~ ).

More information

Two sources of explosion

Two sources of explosion Two sources of explosion Eric Kao Computer Science Department Stanford University Stanford, CA 94305 United States of America Abstract. In pursuit of enhancing the deductive power of Direct Logic while

More information

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements

More information

Yes Fellows, Most Human Reasoning is Complex

Yes Fellows, Most Human Reasoning is Complex Yes Fellows, Most Human Reasoning is Complex Diderik Batens (diderik.batens@ugent.be), Kristof De Clercq (kristof.declercq@ugent.be), Peter Verdée (peter.verdee@ugent.be) and Joke Meheus (joke.meheus@ugent.be)

More information

Making Sense. Tom Carter. tom/sfi-csss. April 2, 2009

Making Sense. Tom Carter.   tom/sfi-csss. April 2, 2009 Making Sense Tom Carter http://astarte.csustan.edu/ tom/sfi-csss April 2, 2009 1 Making Sense Introduction / theme / structure 3 Language and meaning 6 Language and meaning (ex)............... 7 Theories,

More information

Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory

Chapter 4. Basic Set Theory. 4.1 The Language of Set Theory Chapter 4 Basic Set Theory There are two good reasons for studying set theory. First, it s a indispensable tool for both logic and mathematics, and even for other fields including computer science, linguistics,

More information

This chapter covers asymptotic analysis of function growth and big-o notation.

This chapter covers asymptotic analysis of function growth and big-o notation. Chapter 14 Big-O This chapter covers asymptotic analysis of function growth and big-o notation. 14.1 Running times of programs An important aspect of designing a computer programs is figuring out how well

More information

Introducing Proof 1. hsn.uk.net. Contents

Introducing Proof 1. hsn.uk.net. Contents Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction

More information

CS632 Notes on Relational Query Languages I

CS632 Notes on Relational Query Languages I CS632 Notes on Relational Query Languages I A. Demers 6 Feb 2003 1 Introduction Here we define relations, and introduce our notational conventions, which are taken almost directly from [AD93]. We begin

More information

First-Degree Entailment

First-Degree Entailment March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?

More information

Definable henselian valuation rings

Definable henselian valuation rings Definable henselian valuation rings Alexander Prestel Abstract We give model theoretic criteria for the existence of and - formulas in the ring language to define uniformly the valuation rings O of models

More information

Logic, Sets, and Proofs

Logic, Sets, and Proofs Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.

More information

The nature of Reality: Einstein-Podolsky-Rosen Argument in QM

The nature of Reality: Einstein-Podolsky-Rosen Argument in QM The nature of Reality: Einstein-Podolsky-Rosen Argument in QM Michele Caponigro ISHTAR, Bergamo University Abstract From conceptual point of view, we argue about the nature of reality inferred from EPR

More information

1 Propositional Logic

1 Propositional Logic CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with

More information

Boolean Algebra and Digital Logic

Boolean Algebra and Digital Logic All modern digital computers are dependent on circuits that implement Boolean functions. We shall discuss two classes of such circuits: Combinational and Sequential. The difference between the two types

More information

Proof Techniques (Review of Math 271)

Proof Techniques (Review of Math 271) Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil

More information

EROTETIC SEARCH SCENARIOS, PROBLEM-SOLVING, AND DEDUCTION # ANDRZEJ WIŚNIEWSKI

EROTETIC SEARCH SCENARIOS, PROBLEM-SOLVING, AND DEDUCTION # ANDRZEJ WIŚNIEWSKI Logique & Analyse 185 188 (2004), 139 166 EROTETIC SEARCH SCENARIOS, PROBLEM-SOLVING, AND DEDUCTION # ANDRZEJ WIŚNIEWSKI Abstract This paper points out some applications of the tools elaborated on within

More information

First-Order Logic. Chapter Overview Syntax

First-Order Logic. Chapter Overview Syntax Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

1. Tarski consequence and its modelling

1. Tarski consequence and its modelling Bulletin of the Section of Logic Volume 36:1/2 (2007), pp. 7 19 Grzegorz Malinowski THAT p + q = c(onsequence) 1 Abstract The famous Tarski s conditions for a mapping on sets of formulas of a language:

More information