%0 Journal Article %J Topoi. An International Reiew of Philosophy %D In Press %T The semantics of untrustworthiness %A Primiero, Giuseppe %A Kosolosky, Laszlo %X

We o er a formal treatment of the semantics of both complete and incomplete mistrustful or distrustful information transmissions. The se- mantics of such relations is analysed in view of rules that dene the be- haviour of a receiving agent. We justify this approach in view of human agent communications and secure system design. We further specify some properties of such relations.

%B Topoi. An International Reiew of Philosophy %G eng %R http://dx.doi.org/10.1007/s11245-013-9227-2 %0 Journal Article %J Studia Semiotyczne %D 2017 %T The Scale Structure of Moral Adjectives %A Faroldi, Federico L. G. %A Soria Ruiz, Andrés %B Studia Semiotyczne %V 31 %G eng %N 2 %& 161 %0 Journal Article %J Foundations of science %D 2016 %T Social epistemology meets the philosophy of the humanities %A Froeyman, Anton %A Kosolosky, Laszlo %A Van Bouwel, Jeroen %X

From time to time, when I explain to a new acquaintance that I’m a philosopher of science, my interlocutor will nod agreeably and remark that that surely means I’m interested in the ethical status of various kinds of scientific research, the impact that science has had on our values, or the role that the sciences play in contemporary democracies. Although this common response hardly corresponds to what professional philosophers of science have done for the past decades, or even centuries, it is perfectly comprehensible. For there are large questions of the kinds just indicated, questions that deserve to be posed and answered, and an intelligent person might well think that philosophers of science are the people who do the posing and the answering (Kitcher in Science, truth and democracy. Oxford University Press, Oxford, p. xi, 2001).

%B Foundations of science %V 21 (1) %G eng %R http://dx.doi.org/10.1007/s10699-014-9372-0 %0 Journal Article %J Logique et Analyse %D 2016 %T Splitting and Relevance: Broadening the Scope of Parikh's Concepts %A Van De Putte, Frederik %B Logique et Analyse %V 59 %P 173 -205 %G eng %N 234 %& 173 %0 Journal Article %J Journal of Logic and Computation %D 2016 %T Spoiled for Choice? %A Batens, Diderik %X

The transition from a theory that turned out trivial to a consistent replacement need not proceed in terms of inconsistencies, which are negation gluts. Logics that tolerate gluts or gaps (or both) with respect to any logical symbol may serve as the lower limit for adaptive logics that assign a minimally abnormal consequence set to a given premise set. The same obtains for logics that tolerate a combination of kinds of gluts and gaps. This result runs counter to the obsession with inconsistency that classical logicians and paraconsistent logicians share.
All such basic logics will be systematically reviewed, some variants will be outlined, and the claim will be argued for. While those logics tolerate gluts and gaps with respect to logical symbols, ambiguity logic tolerates ambiguities in non-logical symbols. Moreover, forms of tolerance may be combined, with zero logic as an extreme.\İn the baffling plethora of corrective adaptive logics (roads from trivial theories to consistent replacements), adaptive zero logic turns out theoretically interesting as well as practically useful. On the one hand all meaning becomes contingent, depending on the premise set. On the other hand, precisely adaptive zero logic provides one with an excellent analyzing instrument. For example it enables one to figure out which corrective adaptive logics lead, for a specific trivial theory, to a suitable and interesting minimally abnormal consequence set.

%B Journal of Logic and Computation %V 26 %P 65-95 %G eng %N 1 %R 10.1093/logcom/ext019 %0 Generic %D 2015 %T Some Adaptive Contributions to Logics of Formal Inconsistency %A Batens, Diderik %E Béziau, Jean-Yves %E Chakraborty, Mihir %E Dutta, Soma %X

Some insights were gained from the study of inconsistency-adaptive logics. The aim of the present paper is to put some of these insight to work for the study of logics of formal inconsistency. The focus of attention are application contexts of the aforementioned logics and their theoretical properties in as far as they are relevant for applications. As the questions discussed are difficult but important, a serious attempt was made to make the paper concise but transparent.

%B New Directions in Paraconsistent Logic %I Springer %P 309 -333 %G eng %0 Journal Article %J Analytic Philosophy %D 2014 %T Sceptical Rationality %A Wieland, Jan Willem %B Analytic Philosophy %V 55 %P 222–238 %G eng %0 Journal Article %J Deontic Logic and Normative Systems: Lecture Notes in Computer Science %D 2014 %T Sequent-Based Argumentation for Normative Reasoning %A Straßer, Christian %A Arieli, Ofer %X

In this paper we present an argumentative approach to normative reasoning. Special attention is paid to normative conflicts, contrary-to-duty and specificity cases. These are modeled by means of argumentative attacks. For this, we adopt a recently proposed frame- work for logical argumentation in which arguments are generated by a sequent calculus of a given base logic (Arieli, CLIMA’2013, pp.69–85), and use an intuitionistic variant of stan- dard deontic logic as our base logic. Argumentative attacks are realized by elimination rules that allow to discharge specific sequents. We demonstrate our system by means of various well-known benchmark examples.

%B Deontic Logic and Normative Systems: Lecture Notes in Computer Science %V 8554 %P 224–240 %G eng %0 Journal Article %J History and Philosophy of Logic %D 2014 %T S\lupecki's generalized mereology and its flaws %A Urbaniak, Rafal %X

One of the streams in the early development of set theory was an attempt to use mereology, a formal theory of parthood, as a foundational tool. The first such attempt is due to a Polish logician, Stanis\unmatched{0142}aw Leśniewski (1886–1939). The attempt failed, but there is another, prima facie more promising attempt by Jerzy S\unmatched{0142}upecki (1904–1987), who employed his generalized mereology to build mereological foundations for type theory. In this paper I (1) situate Leśniewski's attempt in the development of set theory, (2) describe and evaluate Leśniewski's approach, (3) describe S\unmatched{0142}upecki's strategy without unnecessary technical details, and (4) evaluate it with a rather negative outcome. The issues discussed go beyond merely historical interests due to the current popularity of mereology and because they are related to nominalistic attempts to understand mathematics in general. The introduction describes very briefly the situation in which mereology entered the scene of foundations of mathematics –- it can be safely skipped by anyone familiar with the early development of set theory. Section 2 describes and evaluates Leśniewski's attempt to use mereology as a foundational tool. In Section 3, I describe an attempt by S\unmatched{0142}upecki to improve on Leśniewski's work, which resulted in a system called generalized mereology. In Section 4, I point out the reasons why this attempt is still not successful. Section 5 contains an explanation of why Leśniewski's use of Ontology in developing arithmetic also is not nominalistically satisfactory.

%B History and Philosophy of Logic %V 35 %P 289–300 %G eng %R http://dx.doi.org/10.1080/01445340.2014.917837 %0 Journal Article %J European review %D 2014 %T Stanislaw Leśniewski: rethinking the philosophy of mathematics %A Urbaniak, Rafal %X

Near the end of the XIXth century part of mathematical research was focused on unification: the goal was to find ˝one sort of thing˝ that mathematics is (or could be taken to be) about. Quite quickly sets became the main candidate for this position. While the enterpize hit a rough patch with Frege's failure and set-theoretic paradoxes, by the 1920s mathematicians (roughly speaking) settled on a promising axiomatization of set theory and considered it foundational. Quite parallel to this development was the work of Stanislaw Le{\textbackslash}'sniewski (1886-1939), a Polish logician who did not accept the existence of abstract (aspatial, atemporal and acausal) objects such as sets. Lesniewski attempted to find a nominalistically acceptable replacement for set theory in the foundations of mathematics. His candidate was Mereology - a theory which instead of sets and elements spoke of wholes and parts. The goal of this paper will be to present Mereology in this context, to evaluate the feasibility of Lesniewski's project and to briefly comment on its contemporary relevance.

%B European review %V 23 %P 125–138 %G eng %0 Book %D 2013 %T Scientific explanation %A Weber, Erik %A Van Bouwel, Jeroen %A De Vreese, Leen %X

This paper investigates the working-method of three important philosophers of explanation: Carl Hempel, Philip Kitcher and Wesley Salmon. We argue that they do three things: (i) construct an explication in the sense of Carnap, which then is u sed as a tool to make (ii) descriptive and (iii) normative claims about the explanatory practice of scientists. We also show that they did well with respect to (i), but that they failed to give argume nts for their descriptive and normative claims. We think it is the responsibility of current philosoph ers of explanation to go on where Hempel, Kitcher and Salmon failed. However, we should go on in a cl ever way. We call this clever way the “pragmatic approach to scientific explanation.” We clarify wha t this approach consists in and defend it.

%I Springer %P 93 %@ 9789400764453 %G eng %0 Journal Article %J THEORY & PSYCHOLOGY %D 2013 %T The status of functional explanation in psychology: reduction and mechanistic explanation %A Gervais, Raoul %A Looren de Jong, Huib %X

The validity of functional explanations as they are commonly used in psychology has recently come under attack. Kim’s supervenience argument purports to prove that higher-level generalizations have no causal powers of their own, and hence are explanatorily irrelevant. In a nutshell, the supervenience argument forces us to either embrace epiphenomenalism of higher- level properties, or accept Kim’s specific brand of reductionism. However, with the current emphasis on mechanistic explanations, the literature on explanation in psychology has undergone some drastic changes. It could be argued, therefore, that Kim’s argument targets an outdated concept of functional explanations. In any case, these developments warrant a reassessment of the implications of his argument, which is the purpose of the present paper. First, we argue that the metaphysics behind the supervenience argument is incompatible with that of mechanisms. Second, we argue that Kim’s proposed brand of reductionism does not accurately describe the explanatory practices of cognitive science.

%B THEORY & PSYCHOLOGY %V 23 %P 145–163 %G eng %R http://dx.doi.org/10.1177/0959354312453093 %0 Journal Article %J Logique & Analyse %D 2013 %T Strong and weak regress arguments %A Wieland, Jan Willem %X

In the literature, regress arguments often take one of two different forms: either they conclude that a given solution fails to solve any problem of a certain kind (the strong conclusion), or they conclude that a given solution fails to solve all problems of a certain kind (the weaker conclusion). This gives rise to a logical problem: do regresses entail the strong or the weaker conclusion, or none? In this paper I demonstrate that regress arguments can in fact take both forms, and clearly set out the logical difference between them. Throughout the paper, I confine myself to metaphysical examples from the early Russell. Only now that we know they are valid can we start to discuss whether they are sound.

%B Logique & Analyse %V 56 %P 439–461 %G eng %0 Journal Article %J Logic Journal of the IGPL %D 2013 %T Strong, universal and provably non-trivial set theory by means of adaptive logic %A Verdée, Peter %X

In this article, I present a non-trivial but inconsistent set theory based on unrestricted comprehension. The theory is provably non-trivial and strong enough for most of the applications of regular mathematics. This is realized by distinguishing between strong and weak set membership and allowing for the derivation of strong membership from weak membership whenever this is not problematic (it does not lead to paradoxes). This idea of applying rules whenever unproblematic is formalized by means of an adaptive logic.

%B Logic Journal of the IGPL %V 21 %P 108-125 %G eng %R 10.1093/jigpal/jzs025 %0 Journal Article %J The British Journal for the Philosophy of Science %D 2013 %T The Structure of Scientific Theories, Explanation, and Unification. A Causal-Structural Account %A Leuridan, Bert %X

What are scientific theories and how should they be represented? In this article, I propose a causal–structural account, according to which scientific theories are to be represented as sets of interrelated causal and credal nets. In contrast with other accounts of scientific theories (such as Sneedian structuralism, Kitcher’s unificationist view, and Darden’s theory of theoretical components), this leaves room for causality to play a substantial role. As a result, an interesting account of explanation is provided, which sheds light on explanatory unification within a causalist framework. The theory of classical genetics is used as a case study.

%B The British Journal for the Philosophy of Science %V 65 %P 717–771 %G eng %R 10.1093/bjps/axt015 %0 Report %D 2012 %T A short history of small machines %A De Mol, Liesbeth %A Bullynck, Maarten %X

One of the most famous results of Alan M. Turing is the so-called universal Tur- ing machine (UTM). Its in uence on (theoretical) computer science can hardly be overestimated. The operations of this machine are of a most elementary na- ture but nonetheless considered to capture all the (human) processes that can be carried out in computing a number. This kind of elementary machine ts into a tradition of `logical minimalism' that looks for simplest sets of operations or axioms. It is part of the more general research programme into the foundations of mathematics and logic that was carried out in the beginning of the 20th cen- tury. In the 1940s and 1950s, however, this tradition was rede ned in the context of `computer science' when computer engineers, logicians and mathematicians re-considered the problem of small(est) and/or simple(st) machines in the con- text of actual engineering practices. This paper looks into this early history of research on small symbolic and physical machines and tie it to this older tradi- tion of logical minimalism. Focus will be on how the transition and translation of symbolic machines into real computers integrates minimalist philosophies as parts of more complex computer design strategies. This contextualizes Turing's machines at the turn from logic to machines.

%B The Turing Centenary Conference CiE 2012: How the World Computes %G eng %0 Journal Article %J Philosophical Papers %D 2011 %T The Sceptic's Tools: Circularity and Infinite Regress %A Wieland, Jan Willem %X

Important sceptical arguments by Sextus Empiricus, David Hume and Paul Boghossian (concerning disputes, induction, and relativism respectively) are based on circularities and infinite regresses. Yet, philosophers' practice does not keep circularities and infinite regresses clearly apart. In this metaphilosophical paper I show how circularity and infinite regress arguments can be made explicit, and shed light on two powerful tools of the sceptic.

%B Philosophical Papers %V 40 %P 359–369 %G eng %R 10.1080/05568641.2011.634246 %0 Conference Paper %B WoLLIC 2011 Proceedings LNAI Series %D 2011 %T Strong paraconsistency by separating composition and decomposition in classical logic %A Verdée, Peter %E Goebel, R %X

In this paper I elaborate a proof system that is able to prove all classical first order logic consequences of consistent premise sets, without proving trivial consequences of inconsistent premises (as in A, ¬A\,\unmatched{22a2}\,B). Essentially this result is obtained by formally distinguishing consequences that are the result of merely decomposing the premises into their subformulas from consequences that may be the result of also composing ‘new’, more complex formulas. I require that, whenever ‘new’ formulas are derived, they are to be preceded by a special +-symbol and these +-preceded formulas are not to be decomposed. By doing this, the proofs are separated into a decomposition phase followed by a composition phase. The proofs are recursive, axiomatizable and, as they do not trivialize inconsistent premise sets, they define a very strong non-transitive paraconsistent logic, for which I also provide an adequate semantics.

%B WoLLIC 2011 Proceedings LNAI Series %I Springer %@ 364220919X %G eng %U http://dx.doi.org/10.1007/978-3-642-20920-8\_26 %0 Journal Article %J JOURNAL OF ENGINEERING DESIGN %D 2011 %T Supporting design knowledge exchange by converting models of functional decomposition %A van Eck, Dingmar %B JOURNAL OF ENGINEERING DESIGN %V 22 %P 839–858 %G eng %U http://dx.doi.org/10.1080/09544828.2011.603692 %0 Journal Article %J Archive for Mathematical Logic %D 2010 %T Setting-up early computer programs: D. H. Lehmer's ENIAC computation %A Bullynck, Maarten %A De Mol, Liesbeth %E Beckmann, Arnold %E Dimitracopoulos, Costas %E Löwe, Benedikt %X

A complete reconstruction of Lehmer's ENIAC set-up for computing the exponents of p modulo two is given. This program served as an early test program for the ENIAC (1946). The reconstruction illustrates the difficulties of early programmers to find a way between a man operated and a machine operated computation. These difficulties concern both the content level (the algorithm) and the formal level (the logic of sequencing operations).

%B Archive for Mathematical Logic %V 49 %P 123–146 %G eng %U http://dx.doi.org/10.1007/s00153-009-0169-8 %0 Journal Article %J Fundamenta Informaticae %D 2010 %T Solvability of the halting and reachability problem for binary 2-tag systems %A De Mol, Liesbeth %X

In this report we will provide a detailed proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a shiftnumber v = 2.

%B Fundamenta Informaticae %V 99 %P 435–471 %G eng %R 10.3233/FI-2010-257 %0 Journal Article %J Logic Journal of the IGPL %D 2010 %T Standards and the distribution of cognitive labour: A model of the dynamics of scientific activity %A De Langhe, Rogier %A Greiff, Matthias %B Logic Journal of the IGPL %V 18 %P 278–294 %G eng %U http://dx.doi.org/10.1093/jigpal/jzp058 %0 Generic %D 2010 %T The Status of Hypothesis and Theory %A Ducheyne, Steffen %K Francis Bacon %K history of natural-philosophical methodology %K Hypothesis %K Isaac Newton. %K John Locke %K Robert Boyle %K Robert Hooke %K speculative versus experimental seventeenth-century natural philosophy %K theory %X

Nowadays, it is a truism that hypotheses and theories play an essential role in scientific practice. This, however, was far from an obvious given in seventeenth-century British natural philosophy. Different natural philosophers had different views on the role and status of hypotheses and theories, ranging from fierce promotion to bold rejection, and to both they ascribed varying meanings and connotations. The guiding idea of this chapter is that, in seventeenth-century British natural philosophy, the terms ?hypothesis???hypothetical? and ?theory???theoretical? were imbedded in a semantic network of interconnected epistemological and methodological notions ? such as ?knowledge?, ?method?, ?probability?, ?certainty?, ?induction?, ?deduction?, ?experimental philosophy?, ?speculative philosophy?, and the like). As these semantic networks changed overtime, the meaning and significance of ?hypothesis? and ?theory? likewise shifted. Without pretence of completeness, this chapter highlights chronologically some of the defining moments in the semantic transformation of these two terms within the context of seventeenth-century natural philosophy.

%G eng %U http://philsci-archive.pitt.edu/5074/ %0 Generic %D 2010 %T The symbolic model for algebra: functions and mechanisms %A Heeffer, Albrecht %E Magnani, Lorenzo %E Carnielli, Walter A. %E Pizzi, Claudio %X

The symbolic mode of reasoning in algebra, as it emerged during the sixteenth century, can be considered as a form of model-based reasoning. In this paper we will discuss the functions and mechanisms of this model and show how the model relates to its arithmetical basis. We will argue that the symbolic model was made possible by the epistemic justification of the basic operations of algebra as practiced within the abbaco tradition. We will also show that this form of model-based reasoning facilitated the expansion of the number concept from Renaissance interpretations of number to the full notion of algebraic numbers.

%B Model-Based Reasoning in Science and Technology %I Springer %V 314 %P 519–532 %@ 9783642152221 %G eng %U http://dx.doi.org/10.1007/978-3-642-15223-8\_29 %0 Journal Article %J The Reasoner %D 2009 %T Slingshot arguments: two versions %A Urbaniak, Rafal %B The Reasoner %V 3 %P 4–5 %G eng %0 Generic %D 2009 %T Strategies: what's in a name? %A Provijn, Dagmar %E Carnielli, Walter A. %E Coniglio, Marcelo E. %E Loffredo D'Ottaviano, Itala M. %X

In this paper, I will show that Hintikka’s notion of ‘strategy’ can refer to proof-heuristic reasoning as well as to methodological reasoning forms. Stating this distinction allows for a better understanding of the notion and for an easier way to tackle the problem of formalization. Contrary to Hintikka’s opinion, heuristic reasoning can be implemented in formal proofs by means of goal-directed proof procedures. Methodological reasoning forms on the other hand can be formally represented by means of adaptive logics.

%B The Many Sides of Logic %S Studies in Logic %I College Publications %V 21 %P 287–306 %@ 9781904987789 %G eng %0 Journal Article %J Philosophica %D 2008 %T 'Since heaven has not yet destroyed this culture, what can the men of Kuang do to me?': cosmological confucianism and the development of science %A Dessein, Bart %E Weber, Erik %B Philosophica %V 82 %P 27–53 %G eng %0 Journal Article %J Philosophia Naturalis %D 2008 %T Some Worries for J.D. Norton’s Material Theory of Induction %A Ducheyne, Steffen %X

In this essay, I take the role as friendly commentator and call attention to three potential worries for John D. Norton’s material theory of induction (Norton, 2003). I attempt to show (1) that his “principle argument” is based on a false dichotomy, (2) that the idea that facts ultimately derive their license from matters of fact is debatable, and (3) that one of the core implications of his theory is untenable for historical and fundamental reasons.

%B Philosophia Naturalis %V 45 %P 37 - 46 %G eng %0 Journal Article %J Philosophy of the Social Sciences %D 2007 %T Social mechanisms, causal inference, and the policy relevance of social science %A Weber, Erik %X

The paper has two aims. First, to show that we need social mechanisms to establish the policy relevance of causal claims, even if it is possible to build a good argument for those claims without knowledge of mechanisms. Second, to show that although social scientists can, in principle, do without social mechanisms when they argue for causal claims, in reality scientific practice contexts where they do not need mechanisms are very rare.

%B Philosophy of the Social Sciences %V 37 %P 348–359 %G eng %0 Generic %D 2007 %T Some notes on Aerts' interpretation of the EPR-paradox and the violation of Bell-inequalities %A Christiaens, Wim %A Czachor, Marek %E Aerts, Diederik %E Durt, Thomas %B Probing the Structure of Quantum Mechanics: Nonlinearity, Nonlocality, Probability and Axiomatics %I World Scientific %P 250–286 %G eng %0 Conference Paper %B Lecture Notes in Computer Science %D 2007 %T Study of limits of solvability in tag systems %A De Mol, Liesbeth %E Durand Lose, J %E Margenstern, M %X

In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. This result will be situated in a more general context of research on limits of solvability in tag systems.

%B Lecture Notes in Computer Science %I Springer %@ 978-3-540-74592-1 %G eng %0 Journal Article %J Logique et analyse %D 2007 %T Supervenience: Its logic and its inferential role in classical genetics %A Leuridan, Bert %X

Supervenience is mostly conceived of as a purely philosophical concept. Nevertheless, I will argue, it played an important and very fruitful inferential role in classical genetics. Gregor Mendel assumed that phenotypic traits supervene on underlying factors, and this assumption allowed him to successfully predict and explain the phenotypical regularities he had experimentally discovered. Therefore it is interesting to explicate how we reason about supervenience relations. I will tackle the following two questions. Firstly, can a reliable method (a logic) be found for inferring supervenience claims from data? Secondly, can a reliable method (a logic) be found to empirically test supervenience claims? I will answer these questions within the framework of the adaptive logics programme.

%B Logique et analyse %V 50 %P 147–171 %G eng %0 Journal Article %J The Australasian Journal of Logic %D 2006 %T Some non-standard interpretations of the axiomatic basis of Leś niewski’s Ontology %A Urbaniak, Rafal %X

We propose an intuitive understanding of the statement: ‘an ax-iom (or: an axiomatic basis) determines the meaning of the only specific constant occurring in it.’ We introduce some basic semantics for functors of the category sn,n of Le´sniewski’s Ontology. Using these results weprove that the popular claim that the axioms of Ontology determine themeaning of the primitive constants is false.

%B The Australasian Journal of Logic %V 4 %P 13–46 %G eng %0 Journal Article %J Algemeen Nederlands Tijdschrift voor Wijsbegeerte %D 2005 %T Secularizerende Tendenzen in Isaac Newtons Onto-theologie %A Ducheyne, Steffen %B Algemeen Nederlands Tijdschrift voor Wijsbegeerte %V 98 %P 18–33 %G eng %0 Journal Article %J Studia Logica %D 2005 %T Socratic proofs and paraconsistency: a case study %A Vanackere, Guido %A Wisniewski, Andzrej %A Leszczynska, Dorota %X

This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Fv. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic.

%B Studia Logica %V 80 %P 431–466 %G eng %0 Journal Article %J Fractals. Complex Geometry, Patterns, and Scaling in Nature and Society %D 2005 %T Study of fractals derived from IFS-fractals by metric procedures %A De Mol, Liesbeth %X

It is a well-known fact that when visualizing an IFS-attractor through the chaos game, it is possible that the first points mapped will come closer to but stay visibly different from the attractor. This simple fact will be analyzed in more detail, through visualizations of different aspects of this convergence process. It will be shown that, in applying on every point in a 2D-plane the same sequence of mappings and coloring each point according to convergence distance, neighboring points form structures which resemble the attractor itself. Further, it is in this way possible to generate boundaries of the attractor that vary between small and coarse-grained. Using these results, it will be shown that it is possible to, starting with an IFS-attractor, construct fractals of which this IFS-attractor is a subset.

%B Fractals. Complex Geometry, Patterns, and Scaling in Nature and Society %V 13 %P 237–244 %G eng %U http://www.worldscientific.com/doi/abs/10.1142/S0218348X05002878 %R 10.1142/S0218348X05002878 %0 Journal Article %J Logique et Analyse %D 2004 %T Sieving Out Relevant and Efficient Questions %A De Clercq, Kristof %A Verhoeven, Liza %X

Wisniewksi’s erotetic logic provides us with two slightly different semantic explications of the intuitive concept of “a question arises from a set of declarative premises”. Unfortunately, Wisniewski’s erotetic concepts suffer from the drawback that they allow for the raising of irrelevant and inefficient questions. The aim of this paper is to show that raising such questions can be avoided by changing the underlying logic. Several closely related logical approaches which enable us to eliminate irrelevant and inefficient questions, are presented.

%B Logique et Analyse %V 47 %P 189–216 %G eng %0 Report %D 2003 %T Searching for Singular Causal Explanations: a formal analysis %A De Vreese, Leen %A Weber, Erik %G eng %0 Journal Article %J Logic and Logical Philosophy %D 2003 %T Some Adaptive Logics for Diagnosis %A Batens, Diderik %A Meheus, Joke %A Provijn, Dagmar %A Verhoeven, Liza %X

A logic of diagnosis proceeds in terms of a set of premises and one or more (prioritized) sets of expectancies. In this paper we generalize the logics of diagnosis from \cite{EDa:diag} and present some alternatives. The former operate on the premises and expectancies themselves, the latter on their consequences.

%B Logic and Logical Philosophy %V 11/12 %P 39–65 %G eng %0 Journal Article %J Logique et Analyse %D 2003 %T A Strengthening of the Rescher–Manor Consequence Relations %A Batens, Diderik %X

The flat Rescher–Manor consequence relations–-the Free, Strong, Weak, C-Based, and Argued consequence relation–-are defined in terms of the classical consequences of the maximal consistent subsets of (possibly) inconsistent sets of premises. If the premises are inconsistent, the Free, Strong and C-Based consequence sets are consistent and the Argued consequence set avoids explicit inconsistencies (such as A and  A).

The five consequence relations may be applied to discussive situations as intended by Jaskowski–-the comparison with Jaskowski's D2 is instructive. The method followed by Joke Meheus to extend D2 to an adaptive logic, may also be applied to the Rescher–Manor consequence relations. It leads to an extension of the Free, Strong, Weak, and C-Based consequence relations. The extended consequence sets are consistent and closed under Classical Logic. Applying the method to the Argued consequence relation leads to a different consequence relation, not an extension. Neither the Argued consequence relation nor its extension appear very interesting in the present application context.

%B Logique et Analyse %V 46 %P 289–313 %G eng %0 Journal Article %J CLE e-Prints %D 2002 %T Some Computational Aspects of Inconsistency-Adaptive logics %A Batens, Diderik %X

This paper concerns a goal directed proof procedure for the propo- sitional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all at adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for final derivability.

%B CLE e-Prints %V 2 %P 15 pp. %G eng %0 Generic %D 2002 %T On some Remarkable Relations between Paraconsistent Logics, Modal Logics, and Ambiguity Logics %A Batens, Diderik %E Carnielli, Walter A. %E Coniglio, Marcelo E. %E Loffredo D'Ottaviano, Itala M. %X

This paper concerns some connections between paraconsistent logics, modal logics (mainly S5), and Ambiguity Logic AL (Classical Logic applied to a language in which all letters are indexed and in which quantifiers over such indices are present). S5 may be defined from AL.

Three kinds of connections are illustrated. First, a paraconsistent logic A is presented that has the same expressive power as S5. Next, I consider the definition of paraconsistent logics from S5 and AL. Such definition is shown to work for some logics, for example Priest's LP. Other paraconsistent logics appear to withstand such definition, typically those that contain a detachable material implication. Finally, I show that some paraconsistent logics and inconsistency-adaptive logics serve exactly the same purpose as some modal logics and ampliative adaptive logics based on S5. However, they serve this purpose along very different roads and the logics cannot be defined from one another.

The paper intends to open lines of research rather than pursuing them to the end. It also contains a poor person's semantics for S5 as well as a description of the simple but useful and powerful AL.

%B Paraconsistency. The Logical Way to the Inconsistent %I Marcel Dekker %C New York %P 275–293 %G eng %0 Generic %D 2002 %T Subject ingebed? Over het methodologisch individualisme in de sociale wetenschappen. %A Van Bouwel, Jeroen %A Verdonck, Barbara %E Devos, Rob %E Braeckman, Antoon %B De terugkeer van het subject? Recente Ontwikkelingen binnen de filosofie %I Universitaire Pers %P 169–179 %@ 90-5867-237-9 %G eng %0 Journal Article %J Economics and Philosophy %D 2002 %T Symposium on Explanation and Social Ontology 3: Can We Dispense with Structural Explanations of Social Facts? %A Weber, Erik %A Van Bouwel, Jeroen %X

Some social scientists and philosophers (e.g., James Coleman and Jon Elster) claim that all social facts are best explained by means of a micro-explanation. They defend a micro-reductionism in the social sciences: to explain is to provide a mechanism on the individual level. The first aim of this paper is to challenge this view and defend the view that it has to be substituted for an explanatory pluralism with two components: (1) structural explanations of P-, O- and T-contrasts between social facts are more efficient than the competing micro-explanations; and (2) whether a plain social fact (as opposed to a contrast) is best explained in a micro-explanation or a structural explanation depends on the explanatory interest. The second aim of the paper is to show how this explanatory pluralism is compatible with ontological individualism. This paper is motivated by our conviction that explanatory pluralism as defended by Frank Jackson and Philip Pettit is on the right track, but must be further elaborated. We want to supplement their contribution, by (1) introducing the difference between explanations of facts and explanations of contrasts; (2) giving examples from the social sciences, instead of mainly from the natural sciences or common sense knowledge; and (3) emphasizing the pragmatic relevance of explanations on different levels –social, psychological, biological, etc. – which is insufficiently done by Jackson and Pettit.

%B Economics and Philosophy %V 18 %P 259–275 %G eng %0 Journal Article %J Philosophica %D 2001 %T Secondary qualities in retrospect %A De Mey, Tim %A Keinänen, Markku %X

Although the importance, both historically and systematically, of the seventeenth century distinction between primary and secondary qualities is commonly recognised, there is no consensus on its exact nature. Apparently, one of the main difficulties in its interpretation is to tell the constitutive from the argumentative elements. In this paper, we focus on the primary-secondary quality distinctions drawn by Boyle and Locke. We criticise, more specifically, MacIntosh's analysis of them. On the one hand, MacIntosh attributes too many different primary-secondary quality distinctions to Boyle and Locke. On the other hand, he forbears to attribute a particular primary-secondary quality distinction to them, which, at least in the case of Boyle, differs genuinely from his main distinction between the mechanical affections of matter and all of matter's other qualities.

%B Philosophica %V 68 %P 41–59 %G eng %0 Journal Article %J Studia Logica %D 2001 %T Shortcuts and Dynamic Marking in the Tableau Method for Adaptive logics %A Batens, Diderik %A Meheus, Joke %X

Adaptive logics typically pertain to reasoning procedures for which there is no positive test. In \cite{DJ:tabl1}, we presented a tableau method for two inconsistency-adaptive logics. In the present paper, we first describe these methods (without repeating the meta-theoretic proofs). Next, we present several ways to increase the efficiency of the methods. This culminates in a dynamic marking procedure that indicates which branches have to be extended first, and thus guides one towards a decision–-the conclusion follows or does not follow–-in a very economical way.

%B Studia Logica %V 69 %P 221–248 %G eng %0 Generic %D 2000 %T A Survey of Inconsistency-Adaptive Logics %A Batens, Diderik %E Batens, Diderik %E Mortensen, Chris %E Priest, Graham %E Van Bendegem, Jean Paul %X

This paper offers a systematic review of some central philosophical and technical results on adaptive logics. Quite a few of the results are still in print or forthcoming.

%B Frontiers of Paraconsistent Logic %I Research Studies Press %C Baldock, UK %P 49–73 %G eng %0 Journal Article %J Philosophica %D 1999 %T Scientific revolutions, rationality and creativity %A Weber, Erik %B Philosophica %V 64 %P 109–128 %G eng %0 Journal Article %J Tijdschrift voor Filosofie %D 1998 %T Schoonheid in de wiskunde: Birkhoff Revisited %A Van Bendegem, Jean Paul %X

Everyone is familiar with the measure of beauty that has been proposed by Birkhoff, the famous formula M = O/C. Although I show that the formula in its original form cannot be maintained, I present a reinterpretation that adapts the formula for measuring the beauty of mathematical proofs. However, this type of measure is not the only aesthetic element in mathematics. There exists a 'romantic' side as well, to use the term introduced by François Le Lionnais. Thus, a more complex proposal of mathematical beauty is presented. Finally and as a consequence, I argue against the dichotomy that associates science, including mathematics, with the beauty of simplicity and that associates the arts with the beauty of complexity. As an example, the work of Oulipo, Raymond Queneau in particular, is briefly presented.

%B Tijdschrift voor Filosofie %V 60 %P 106–130 %G eng %0 Generic %D 1997 %T Scientific explanation and the interrogative model of inquiry %A Weber, Erik %E Sintonen, M %B Knowledge and inquiry : essays on Jaakko Hintikka's epistemology and philosophy of science %S Poznan Studies %I Rodopi %V 51 %P 239–259 %@ 9789042000803 %G eng %0 Journal Article %J Journal of logic and computation %D 1997 %T Simulating without negation. %A Kurtonina, Natasha %A De Rijke, Maarten %X

Although negation-free languages are widely used in logic and computer science, relatively little is known about their expressive power. To address this issue we consider kinds of non-symmetric bisimulations called directed simulations, and use these to analyse the expressive power and model theory of negation-free modal and temporal languages. We first use them to obtain preservation, safety and definability results for a simple negation-free modal language. We then obtain analogous results for stronger negation-free languages. Finally, we extend our methods to deal with languages with non-Boolean negation. Keywords: Expressive power, modal logic, negation-free languages.

%B Journal of logic and computation %V 7 %P 501–522 %G eng %0 Journal Article %J Communication & Cognition : Monographies %D 1996 %T Some problems for Kitcher's unification account of explanation %A Weber, Erik %B Communication & Cognition : Monographies %V 29 %P 441–456 %G eng %0 Journal Article %J Philosophica %D 1996 %T Steering Problem Solving Between Cliff Incoherence and Cliff Solitude %A Meheus, Joke %A Batens, Diderik %X

Starting from Nickles' constraint-inclusion model, we present five challenges that any rational problem solving model should meet, but that seem to lead to an inextricable riddle. We then introduce the contextual model and show, step by step, that it meets all the challenges and resolves the riddle. This results in a strong argument for the concept of rationality that underlies the model.

%B Philosophica %V 58 %P 153–187 %G eng %0 Journal Article %J Semiotica %D 1996 %T The strange case of the missing body of mathematics %A Van Bendegem, Jean Paul %X

La notion d'infini est analysée en comparant les mathématiques et la théologie car les mathématiciens ont pendant longtemps perçu une relation entre la notion infinie mathématique et la notion d'infinité de Dieu

%B Semiotica %V 112 %P 403–413 %G eng %0 Journal Article %J Logique et Analyse %D 1996 %T Strict finitism as a viable alternative in the foundations of mathematics %A Van Bendegem, Jean Paul %B Logique et Analyse %V 37 %P 23–40 %G eng %0 Generic %D 1995 %T Scientific Arguments and Scientific Prediction. %A Weber, Erik %E Van Eemeren, F. H. %E Grootendorst, R. %E Blair, J. %E Willart, C. %B Special Fields and Cases. Proceedings on the Third ISSA Conference on Argumentation %I SicSat %V IV %P 377-387 %G eng %0 Journal Article %J TIJDSCHRIFT VOOR SOCIALE WETENSCHAPPEN %D 1994 %T Socialisatie, sociale controle en sociologische verklaringen van menselijke handelingen. %A Weber, Erik %B TIJDSCHRIFT VOOR SOCIALE WETENSCHAPPEN %V 38 %P 61–68 %G eng %0 Journal Article %J Philosophica %D 1992 %T Scientific Explanation %A Weber, Erik %B Philosophica %V 49 %P 148–154 %G eng %0 Journal Article %J PHILOSOPHICA (GENT) %D 1989 %T Scientific explanation, necessity and contingency %A Weber, Erik %B PHILOSOPHICA (GENT) %V 44 %P 81–99 %G eng %0 Generic %D 1987 %T The structure of our knowledge system %A Batens, Diderik %E Vandamme, Fernand %B Communication and Cognition. Applied Epistemology %I Communication and Cognition %P 101 %G eng %0 Generic %D 1986 %T Some remarks on the structural similarity between music and logic %A Batens, Diderik %E Apostel, Leo %E Sabbe, Herman %E Vandamme, Fernand %B Reason, Emotion and Music. Towards a Common Structure for Arts, Sciences and Philosophies, Based on a Conceptual Framework for the Description of Music %I Communication & Cognition %P 127–143 %G eng %0 Journal Article %J Communication and Cognition %D 1986 %T Some remarks on the structural similarity between music and logic %A Batens, Diderik %B Communication and Cognition %I Communication & Cognition %V 19 %P 135–151 %G eng %0 Journal Article %J CC-AI %D 1986 %T Static and dynamic paraconsistent logics and their use in expert systems %A Batens, Diderik %B CC-AI %V 3 %P 33–50 %G eng %0 Journal Article %J Communication and Cognition %D 1976 %T Some contributions to the logic of action %A Batens, Diderik %B Communication and Cognition %V 9 %P 347–376 %G eng %0 Journal Article %J Philosophica %D 1976 %T Some remarks on the relations between science and values %A Batens, Diderik %B Philosophica %V 17 %P 13–46 %G eng %0 Book %B Werken uitgegeven door de Faculteit van de Letteren en Wijsbegeerte, Rijksuniversiteit Gent %D 1975 %T Studies in the Logic of Induction and in the Logic of Explanation. Containing a New Theory of Meaning Relations %A Batens, Diderik %B Werken uitgegeven door de Faculteit van de Letteren en Wijsbegeerte, Rijksuniversiteit Gent %I De Tempel %C Brugge %V 161 %G eng %0 Journal Article %J The British Journal for the Philosophy of Science %D 1971 %T Some objections to Keith Lehrer's rule IR %A Batens, Diderik %B The British Journal for the Philosophy of Science %V 22 %P 357–362 %G eng %0 Journal Article %J Studia Philosophica Gandensia %D 1968 %T Some proposals for the solution of the Carnap-Popper discussion on `inductive logic' %A Batens, Diderik %B Studia Philosophica Gandensia %V 6 %P 5–25 %G eng