<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Non-deterministic logic of informal provability has no finite characterization</style></title></titles><dates><year><style  face="normal" font="default" size="100%">Submitted</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Urbaniak, Rafal</style></author><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Paradoxes of informal provability and many-valued indeterministic provability logic</style></title></titles><dates><year><style  face="normal" font="default" size="100%">Submitted</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Tree-like proof systems for finitely-many valued deterministic and indeterministic consequence relations</style></title></titles><dates><year><style  face="normal" font="default" size="100%">Submitted</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Urbaniak, Rafal</style></author><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Hansson, Sven Ove</style></author><author><style face="normal" font="default" size="100%">Hendricks, Vincent F.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Logics of (formal and informal) provability</style></title><secondary-title><style face="normal" font="default" size="100%">Handbook of Formal Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author><author><style face="normal" font="default" size="100%">Urbaniak, Rafal</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Many-valued logic of informal provability: a non-deterministic strategy</style></title><secondary-title><style face="normal" font="default" size="100%">The Review of Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proof systems for BAT consequence relations </style></title><secondary-title><style face="normal" font="default" size="100%">The Logic Journal of IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Kosolosky, Laszlo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The semantics of untrustworthiness</style></title><secondary-title><style face="normal" font="default" size="100%">Topoi. An International Reiew of Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Faroldi, Federico L. G.</style></author><author><style face="normal" font="default" size="100%">Protopopescu, Tudor</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Hyperintensional Logics of Reasons</style></title><secondary-title><style face="normal" font="default" size="100%">Logic Journal of the IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Frijters, Stef</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Condoravdi, Cleo</style></author><author><style face="normal" font="default" size="100%">Nair, Shyam</style></author><author><style face="normal" font="default" size="100%">Pigozzi, Gabriella</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">How to take heroin (if at all). A new approach to detachment in deontic logic</style></title><secondary-title><style face="normal" font="default" size="100%">Deontic Logic and Normative Systems: 14th International Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pub-location><style face="normal" font="default" size="100%">London</style></pub-location><pages><style face="normal" font="default" size="100%">317-335</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">submitted</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Rafał Urbaniak</style></author><author><style face="normal" font="default" size="100%">Gillman Payette</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Abduction Logics Illustrating Pitfalls Of Defeasible Methods</style></title><secondary-title><style face="normal" font="default" size="100%">Applications of formal philosophy: the road less travelled</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Logic argumentation &amp; reasoning</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin</style></pub-location><volume><style face="normal" font="default" size="100%">14</style></volume><pages><style face="normal" font="default" size="100%">169–193</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-58507-9,331958507X,978-3-319-58505-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">On the one hand this paper offers an introduction to adaptive logics, focussing on properties that are imposed upon adaptive logics by the fact that they explicate defeasible reasoning. On the other hand new adaptive logics of abduction are presented and employed to illustrate those properties. These logics were developed in view of the criticism to existing adaptive logics of abduction.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Rik Pinxten</style></author><author><style face="normal" font="default" size="100%">Jean Swings</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Paradoxen in de vrijmetselarij en de relatie met waarden</style></title><secondary-title><style face="normal" font="default" size="100%">Kappen aan de ruwe steen</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">Academic and Scientific Publishers</style></publisher><pub-location><style face="normal" font="default" size="100%">Brussel</style></pub-location><pages><style face="normal" font="default" size="100%">319–336</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pawlowski, Pawel</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Urbaniak, Rafal</style></author><author><style face="normal" font="default" size="100%">Gillman, Payette</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Philosophical Aspects of an Alleged Connection Between the Axiom of Choice and Predicting the Future</style></title><secondary-title><style face="normal" font="default" size="100%">Applications of Formal Philosophy The Road Less Travelled</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">213-220</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">Wouters, Dietlinde</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Bloody analogical reasoning</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Reasoning, and Rationality</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">217–232</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper I will study some of William Harveys applications of analogies in the Prelectiones Anatomiae Universalis and the Exercitatio anatomica de motu cordis et sanguinis in animalibus. I will show that Harvey applied analogies in many different ways and that some contributed to the discovery of the characteristic action of the heart and pulse and even to the discovery of the blood circulation. The discovery process will be approached as a problem solving process as described in Batens contextual model. The focus on constraints allows to see Harvey both as a modern because of his extensive use of experimental results and as strongly influenced by an Aristotelian natural philosophy interpretation of anatomy and physiology as, for instance, propagated by Fabricius of Aquapendente.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Vreese, Leen</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Perring, Christian</style></author><author><style face="normal" font="default" size="100%">Wells, Lloyd</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Concept of Disease and Our Responsibility for Children</style></title><secondary-title><style face="normal" font="default" size="100%">Diagnostic Dilemmas in Child and Adolescent Psychiatry</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><publisher><style face="normal" font="default" size="100%">Oxford University Press</style></publisher><pages><style face="normal" font="default" size="100%">35–55</style></pages><isbn><style face="normal" font="default" size="100%">9780199645756</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The author of this chapter argues that ones understanding of the concept of what a disease is influences our way of behaving toward people we think of as diseased. The author asserts that our concept of disease is not non-committal and that an oversimplified approach can lead to non-critical reasoning which could have significant impact on children with diseases. The author develops a pluralistic approach to the concept of disease and uses ADHD as an example throughout the chapter.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Arieli, Ofer</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Parsons, Simon</style></author><author><style face="normal" font="default" size="100%">Oren, Nir</style></author><author><style face="normal" font="default" size="100%">Reed, Chris</style></author><author><style face="normal" font="default" size="100%">Cerutti, Federico</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic Derivations for Sequent-Based Deductive Argumentation</style></title><secondary-title><style face="normal" font="default" size="100%">COMMA 2014</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><volume><style face="normal" font="default" size="100%">Computational Models of Argument</style></volume><pages><style face="normal" font="default" size="100%">89–100</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems. This framework accommodates different languages and logics in which arguments may be represented, supports a variety of attack relations, and tolerates dynamic changes in the argumentation setting by revising derivations of assertions in light of new information.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pouliasis, Konstantinos</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">J-Calc: A typed lambda calculus for Intuitionistic Justification Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><volume><style face="normal" font="default" size="100%">300</style></volume><pages><style face="normal" font="default" size="100%">71–87</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we offer a system J-Calc that can be regarded as a typed λ -calculus for the {→,&amp;amp;\#8869;} fragment of Intuitionistic Justification Logic. We offer different interpretations of J-Calc, in particular, as a two phase proof system in which we proof check the validity of deductions of a theory Τ based on deductions from a stronger theory Τ' and computationally as a type system for separate compilations. We establish some first metatheoretic results.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jespersen, Bjørn</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Alleged assassins: realist and constructivist semantics for modal modification</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Language, and Computation</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">7758</style></volume><pages><style face="normal" font="default" size="100%">94–114</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Modal modifiers such as Alleged oscillate between being subsective and being privative. If individual a is an alleged assassin (at some parameter of evaluation) then it is an open question whether a is an assassin (at that parameter). Standardly, modal modifiers are negatively defined, in terms of failed inferences or non-intersectivity or non-extensionality. Modal modifiers are in want of a positive definition and a worked-out logical semantics. This paper offers two positive definitions. The realist definition is elaborated within Tichýs Transparent Intensional Logic (TIL) and builds upon Montagues model-theoretic semantics for adjectives as representing mappings from properties to properties. The constructivist definition is based on an extension of Martin-Löfs Constructive Type Theory (CTT) so as to accommodate partial verification. We show that, and why, a is an alleged assassin and Allegedly, a is an assassin are equivalent in TIL and synonymous in CTT.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Offline and online data: on upgrading functional information to knowledge</style></title><secondary-title><style face="normal" font="default" size="100%">Philosophical Studies</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">164</style></volume><pages><style face="normal" font="default" size="100%">371–392</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper addresses the problem of upgrading functional information to knowledge. Functional information is defined as syntactically well-formed, meaningful and collectively opaque data. Its use in the formal epistemology of information theories is crucial to solve the debate on the veridical nature of information, and it represents the companion notion to standard strongly semantic information, defined as well-formed, meaningful and true data. The formal framework, on which the definitions are based, uses a contextual version of the verificationist principle of truth in order to connect functional to semantic information, avoiding Gettierization and decoupling from true informational contents. The upgrade operation from functional information uses the machinery of epistemic modalities in order to add data localization and accessibility as its main properties. We show in this way the conceptual worthiness of this notion for issues in contemporary epistemology debates, such as the explanation of knowledge process acquisition from information retrieval systems, and open data repositories.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A taxonomy of errors for information systems</style></title><secondary-title><style face="normal" font="default" size="100%">Minds and Machines</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">249–273</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A contextual type theory with judgemental modalities for reasoning from open assumptions</style></title><secondary-title><style face="normal" font="default" size="100%">Logique et Analyse</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">220</style></number><volume><style face="normal" font="default" size="100%">55</style></volume><pages><style face="normal" font="default" size="100%">579–600</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Contextual type theories are largely explored in their applications to programming languages, but less investigated for knowledge representation purposes. The combination of a constructive language with a modal extension of contexts appears crucial to explore the attractive idea of a type-theoretical calculus of provability from refutable assumptions for non-monotonic reasoning. This paper introduces such a language: the modal operators are meant to internalize two different modes of correctness, respectively with necessity as the standard notion of constructive verification and possibility as provability up to refutation of contextual conditions.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Martens, Liesbeth</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A formal approach to vague expressions with indexicals</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Engineering of Natural Language Semantics 9 (LENLS 9-2012)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Japanese Society for Artificial Intelligence</style></publisher><pages><style face="normal" font="default" size="100%">37-51</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we offer a formal approach to the scantily investigated problem of vague expressions with indexicals, in particular including the spatial indexical `here' and the temporal indexical `now'. We present two versions of an adaptive fuzzy logic extended with an indexical, formally expressed by a modifier as a function that applies to predicative formulas. In the first version, such an operator is applied to non-vague predicates. The modified formulas may have a fuzzy truth value and fit into a Sorites paradox. We use adaptive fuzzy logics as a reasoning tool to address such a paradox. The modifier enables us to offer an adequate explication of the dynamic reasoning process. In the second version, a different result is obtained for an indexical applied to a formula with a possibly vague predicate, where the resulting modified formula has a crisp value and does not add up to a Sorites paradox.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The generation of abductive explanations from inconsistent theories</style></title><secondary-title><style face="normal" font="default" size="100%">Logic Journal of the IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">400–416</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this article I will show how the goal-directed proof procedure for the propositional fragment of the 'inconsistency-adaptive' logic CLuN(r)from Batens (2005, J. Appl. Logic, 3, 221-250) called pCLuN(r) allows for generating sensible abductive explanations from finite inconsistent theories. Before this is shown, I give a more general account on how goal-directed proof procedures contribute to the study of abduction as backward reasoning. Between these two parts, I describe the goal-directed proof procedure for the propositional fragment of the 'inconsistency-adaptive' logic CLuNr from Batens (2005, J. Appl. Logic, 3, 221-250).&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Intuitionistic Logic of Proofs with dependent proof terms</style></title><secondary-title><style face="normal" font="default" size="100%">Preprint Series of the Isaac Newton Institute for Mathematical Sciences</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The basic logic of proofs extends the usual propositional language by expressions of the form &quot;&lt;em&gt;s&lt;/em&gt; is a proof of &lt;em&gt;A&lt;/em&gt;&quot;, for any proposition &lt;em&gt;A&lt;/em&gt;. In this paper we explore the extension of its intuitionistic fragment to a language including expressions of the form &quot;&lt;em&gt;t&lt;/em&gt; is a proof of &lt;em&gt;B&lt;/em&gt;, dependent from &lt;em&gt;s&lt;/em&gt;being a proof of &lt;em&gt;A&lt;/em&gt;&quot;. We aim at laying down a ground comparison with equivalent constructions present in theories of dependent types, especially those similarly based on the Brouwer-Heyting-Kolmogorov semantics. We further translate this extended language to a natural deduction calculus which allows for a double interpretation of the construction on which a proof term may depend: as actually proven, or valid assumption, or as possibly proven, locally true assumption. We show meta-theoretical properties for this calculus and explain normalisation to a language with only unconditional proofs. We conclude by stating the characterization of our calculus with standard intutionistic logic of proofs&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Taddeo, Mariarosaria</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A modal type theory for formalizing trusted communications</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Applied Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">10</style></volume><pages><style face="normal" font="default" size="100%">92–114</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper introduces a multi-modal polymorphic type theory to model epistemic processes characterized by trust, defined as a second-order relation affecting the communication process between sources and a receiver. In this language, a set of senders is expressed by a modal prioritized context, whereas the receiver is formulated in terms of a contextually derived modal judgement. Introduction and elimination rules for modalities are based on the polymorphism of terms in the language. This leads to a multi-modal non-homogeneous version of a type theory, in which we show the embedding of the modal operators into standard group knowledge operators.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Allo, Patrick</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Reasoning with computer-assisted experiments in mathematics</style></title><secondary-title><style face="normal" font="default" size="100%">Third Workshop in the Philosophy of Information</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Koninklijke Vlaamse Academie van België door Wetenschappen en Kunsten</style></publisher><pages><style face="normal" font="default" size="100%">80-92</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mol, Liesbeth</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Report 'International Conference on History and Philosophy of Computing' (HAPOC)</style></title><secondary-title><style face="normal" font="default" size="100%">The Reasoner</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">7-8</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Rahman, Shahid</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Marion, Mathieu</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Type-Theoretical Dynamics. Exploring Belief Revision in a Constructive Framework</style></title><secondary-title><style face="normal" font="default" size="100%">The realism-antirealism debate in the age of alternative logics</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">191–212</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the present paper a dynamics for type theory is introduced. The formalization provides epistemic explanations for the basic notions of belief state and belief set by referring to assertion conditions for type-theoretical judgements; it interprets expectations in terms of default assumptions for such a structure and it adapts the usual revision operations and the analogous of the Ramsey test. The model, restricted to operations of revision, merging and information preference, provides a constructive type-theoretical approach to epistemic dynamics.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pelis, Michal</style></author><author><style face="normal" font="default" size="100%">Puncochar, Vit</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A unifying framework for reasoning about normative conflicts</style></title><secondary-title><style face="normal" font="default" size="100%">The logica yearbook 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pages><style face="normal" font="default" size="100%">1–14</style></pages><isbn><style face="normal" font="default" size="100%">9781848900714</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;First, two context-dependent desiderata are presented for devising calculi of deontic logic that can consistently accommodate normative conflicts. Conflict-tolerant deontic logics (CTDLs) can be evaluated by their treatment of the trade-off between these desiderata. Next, it is argued that CTDLs defined within the standard format for adaptive logics are particularly good at overcoming this trade-off.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van Bouwel, Jeroen</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Aerts, Diederik</style></author><author><style face="normal" font="default" size="100%">D'Hooghe, Bart</style></author><author><style face="normal" font="default" size="100%">Pinxten, Rik</style></author><author><style face="normal" font="default" size="100%">Wallerstein, Immanuel</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An atlas for the social world: what should it (not) look like? Interdisciplinarity and pluralism in the social sciences</style></title><secondary-title><style face="normal" font="default" size="100%">Worldviews, Science and Us: Interdisciplinary Perspectives on Worlds, Cultures and Society.</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Worldviews, science and us : interdisciplinary perspectives on worlds, cultures and society</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">World Scientific Publishing Company</style></publisher><pages><style face="normal" font="default" size="100%">43–72</style></pages><isbn><style face="normal" font="default" size="100%">9789814355056</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Starting from the analogy between theories and maps, I will spell out which interdisciplinary approach to the social sciences can provide us with the atlas we need to navigate in the social world. After comparing the features of theories and maps in section 1, I elaborate how different social theories can collaborate or get into a dialogue in section 2, summarizing the different strategies that have been defended for interdisciplinarity in social science: theory-, method-, metaphysics-, and question-driven interdisciplinarity, which I will illustrate with actual proposals made by, inter alia, World-Systems Analysis, Critical Realism and Economics Imperialism. Building on the framework of explanatory pluralism I have been developing before, I will make a case for question-driven interdisciplinarity in section 3. My argument for question-driven interdisciplinarity will be illustrated in section 4 by discussing recent developments in economics (i.e., the debate between the orthodoxy and heterodox theories, the pleas for pluralism, and the impact of globalisation –and related institutional developments- on economics as a discipline). In conclusion, the contours of an adequate atlas for the social world should become clearer; when to use the different maps, how to activate the dialogue between social scientific disciplines in order to draw the different maps, and the risks of globalisation for social science (and adequate map making).&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Giovanni Sommaruga (ed): Formal Theories of Information: From Shannon to Semantic Information Theory and General Concepts of Information (Review)</style></title><secondary-title><style face="normal" font="default" size="100%">Minds and Machines</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">119-122</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A multi-modal type system and its procedural semantics for safe distributed programming</style></title><secondary-title><style face="normal" font="default" size="100%">Intuitionistic Modal Logic and Applications Workshop (IMLA11), Nancy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we present a multi-modal polymorphic type system for a computational interpretation of programs with distributed resources. Polymorphism induces a distinction between programs whose code is safe at location, and programs whose value is safe overall. We formulate judge- mental modalities to express such distinction and use their introduction and elimination rules to express mobility of code and values within a net- work. The syntactic formulation is completed by a procedural semantics interpreted over states of an abstract machine for which a standard sound- ness result is given in the form of a type safety theorem.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Allo, Patrick</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On the necessity of (sometimes) being synthetic. Comment on Poggiolesi.</style></title><secondary-title><style face="normal" font="default" size="100%">Third Workshop in the Philosophy of Information</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><publisher><style face="normal" font="default" size="100%">Koninklijke Vlaamse Academie van België</style></publisher><pub-location><style face="normal" font="default" size="100%">Brussels</style></pub-location><pages><style face="normal" font="default" size="100%">63-68</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Allo, Patrick</style></author><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Report 3rd Workshop in the Philosophy of Information</style></title><secondary-title><style face="normal" font="default" size="100%">The Reasoner</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">6-7</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tanaka, Koji</style></author><author><style face="normal" font="default" size="100%">Berto, Francesco</style></author><author><style face="normal" font="default" size="100%">Mares, Edwin</style></author><author><style face="normal" font="default" size="100%">Paoli, Francesco</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An adaptive logic framework for conditional obligations and deontic dilemmas</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and logical philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><number><style face="normal" font="default" size="100%">1-2</style></number><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">95–128</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Heeffer, Albrecht</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pease, Alison</style></author><author><style face="normal" font="default" size="100%">Guhe, Markus</style></author><author><style face="normal" font="default" size="100%">Smaill, Alan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The body in Renaissance arithmetic: from mnemonics to embodied cognition</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Thirty Sixth Annual Convention of the Society for the Study of Artificial Intelligence and Simulation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">The Society for the Study of Artificial Intelligence and the Simulation of Behaviour</style></publisher><isbn><style face="normal" font="default" size="100%">1902956931</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In Medieval and Renaissance arithmetic we find several instances of references to body parts or actions involving body parts. In this paper we will address the question on the historical functions of body parts in mathematics and discuss its relation to the currently prevailing practice of symbolic mathematics.12&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Ferreira, F</style></author><author><style face="normal" font="default" size="100%">Guerra, H</style></author><author><style face="normal" font="default" size="100%">Mayordomo, E</style></author><author><style face="normal" font="default" size="100%">Rasga, J</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Constructive contextual modal judgments for reasoning from open assumptions</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Computability in Europe 2010 Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Centre for Applied Mathematics and Information Technology, Department of Mathematics, University of Azores</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Dependent type theories using a structural notion of context are largely explored in their applications to programming languages, but less investigated for knowledge representation purposes. In particular, types with modalities are already used for distributed and staged computation. This paper introduces a type system extended with judgmental modalities internalizing epistemically different modes of correctness to explore a calculus of provability from refutable assumptions.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lycke, Hans</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tanaka, Koji</style></author><author><style face="normal" font="default" size="100%">Berto, Francesco</style></author><author><style face="normal" font="default" size="100%">Mares, Edwin</style></author><author><style face="normal" font="default" size="100%">Paoli, Francesco</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Inconsistency-adaptive modal logics: on how to cope with modal inconsistency</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Logical Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.logika.umk.pl/llp/pi.html</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1-2</style></number><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">31–61</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, I will characterize a new class of inconsistency–adaptive logics, namely inconsistency–adaptive modal logics. These logics cope with inconsistencies in a modal context. More specifically, when faced with inconsistencies, inconsistency–adaptive modal logics avoid explosion, but still allow the derivation of sufficient consequences to adequately explicate the intended part of human reasoning.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Multi-Modal Dependent Type Theory for Representing Data Accessibility in a Network.</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Proceedings of the Federated Logic Conference 2010 (Proof Systems for Program Logics Workshop)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Citeseer</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we present a multi-modal polymorphic constructive type theory for a computational interpretation of programs equipped with locations for data accessibility in the context of distributed processing.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lycke, Hans</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pelis, Michal</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On Relevance Conditions for Asserting Disjunctions</style></title><secondary-title><style face="normal" font="default" size="100%">The Logica Yearbook 2009</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pages><style face="normal" font="default" size="100%">143–156</style></pages><isbn><style face="normal" font="default" size="100%">1848900090</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Heeffer, Albrecht</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Magnani, Lorenzo</style></author><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Pizzi, Claudio</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The symbolic model for algebra: functions and mechanisms</style></title><secondary-title><style face="normal" font="default" size="100%">Model-Based Reasoning in Science and Technology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-15223-8\_29</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">314</style></volume><pages><style face="normal" font="default" size="100%">519–532</style></pages><isbn><style face="normal" font="default" size="100%">9783642152221</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mey, Tim</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Van Speybroeck, Linda</style></author><author><style face="normal" font="default" size="100%">Braeckman, Johan</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">William Harvey en de ontdekking van de bloedsomloop.</style></title><secondary-title><style face="normal" font="default" size="100%">Fascinerend Leven. Markante Figuren en Ideeën uit de Geschiedenis van de Biologie.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Nieuwezijds</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">&lt;p&gt;In print&lt;/p&gt;</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pieters, Eva</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">Libert, Thierry</style></author><author><style face="normal" font="default" size="100%">Marage, Pierre</style></author><author><style face="normal" font="default" size="100%">Vanpaemel, Geert</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">&quot;Clear Moon, Frost soon&quot;. An introduction to the Study of Meteorological Practices in the Low Countries (1550-1850)</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Philosophy and History of Science in Belgium. Proceedings of the Young Researcher Days 2008</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">{Koninklijke Vlaamse Academie van België</style></publisher><isbn><style face="normal" font="default" size="100%">9789065690432</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A constructive modal semantics for contextual verification</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the First International Workshop on Logic-Based Interpretation of Context: Modeling and Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-550/</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-Workshop Proceedings</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper introduces a non-standard semantics for a modal version of constructive KT for contextual (assumptions-based) verification. The modal fragment expresses verifiability under extensions of contexts, enjoying adapted validity and (weak) monotonicity properties depending on satisfaction of the contextual data.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An epistemic logic for becoming informed</style></title><secondary-title><style face="normal" font="default" size="100%">Synthese (KRA Serie)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Epistemic logic</style></keyword><keyword><style  face="normal" font="default" size="100%">Logic of justification</style></keyword><keyword><style  face="normal" font="default" size="100%">Modal logic</style></keyword><keyword><style  face="normal" font="default" size="100%">Philosophy of information</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11229-008-9413-8</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">167</style></volume><pages><style face="normal" font="default" size="100%">363-389</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Various conceptual approaches to the notion of information can currently be traced in the literature in logic and formal epistemology. A main issue of disagreement is the attribution of truthfulness to informational data, the so called Veridicality Thesis (Floridi 2005). The notion of Epistemic Constructive Information (Primiero 2007) is one of those rejecting VT. The present paper develops a formal framework for ECI. It extends on the basic approach of Artemovs logic of proofs (Artemov 1994), representing an epistemic logic based on dependent justifications, where the definition of information relies on a strict distinction from factual truth. The definition obtained by comparison with a Normal Modal Logic translates a constructive logic for becoming informed: its distinction from the logic of being informedwhich internalizes truthfulnessis essential to a general evaluation of information with respect to truth. The formal disentanglement of these two logics, and the description of the modal version of the former as a weaker embedding into the latter, allows for a proper understanding of the Veridicality Thesis with respect to epistemic states defined in terms of information.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Rahman, Shahid</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Epistemic Modalities</style></title><secondary-title><style face="normal" font="default" size="100%">Acts of Knowledge: History, Philosophy and Logic</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Tributes</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">207–232</style></pages><isbn><style face="normal" font="default" size="100%">978-1-904987-92-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;I present an analysis of the notion of epistemic modalities, based on an appropriate interpretation of two basic constructivist issues: verification and epistemic agency. Starting from an historical analysis of conditions for judgments, I analyze first the reading of necessity with respect to apodictic judgements, and then that of possibility with respect to hypothetical judgement. The analysis results in a formal treatment of rules for judgemental modal operators, whose aim is to preserve epistemic states corresponding to verified and unverified assumptions in contexts. In the conclusion, further tracks of research are indicated for designing a semantic framework and defining multi-agents systems.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">Libert, Thierry</style></author><author><style face="normal" font="default" size="100%">Marage, Pierre</style></author><author><style face="normal" font="default" size="100%">Vanpaemel, Geert</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A note on constructive modalities for information</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Philosophy and History of Science in Belgium. Proceedings of the Young Researchers Days 2008</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">Koninklijke Vlaamse Academie van België</style></publisher><pub-location><style face="normal" font="default" size="100%">Brussel</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Coniglio, Marcelo E.</style></author><author><style face="normal" font="default" size="100%">Loffredo D'Ottaviano, Itala M.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Prioritized Dynamic Retraction Function on Non-monotonic Information Updates</style></title><secondary-title><style face="normal" font="default" size="100%">The Many Sides of Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pub-location><style face="normal" font="default" size="100%">London</style></pub-location><pages><style face="normal" font="default" size="100%">443-463</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper a model for updates on belief sets and retractions thereof is introduced using the standard format of Adaptive Logics. The core of the update retraction procedure is represented by abnormal expressions derivable in the language: they express updates with information con- tradicting previously derived contents. The adaptive strategy aims at restricting the validity of these formulas by focusing at each decreasing degree on the update which is the most rational to retract in order to re- store consistency as soon as possible. This work is related to the standard operations of retraction and withdrawal from the AGM-paradigm and the eects of dynamic operations such as public announcement in Dynamic Epistemic Logic.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proceeding in abstraction: from concepts to types and the recent perspective on information</style></title><secondary-title><style face="normal" font="default" size="100%">History and Philosophy of Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1080/01445340902872630</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">30</style></volume><pages><style face="normal" font="default" size="100%">257–282</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This article presents an historical and conceptual overview on different approaches to logical abstraction. Two main trends concerning abstraction in the history of logic are highlighted, starting from the logical notions of concept and function. This analysis strictly relates to the philosophical discussion on the nature of abstract objects. I develop this issue further with respect to the procedure of abstraction involved by (typed) -systems, focusing on the crucial change about meaning and predicability. In particular, the analysis of the nature of logical types in the context of Constructive Type Theory allows elucidation of the role of the previously introduced notions. Finally, the connection to the analysis of abstraction in computer science is drawn, and the methodological contribution provided by the notion of information is considered, showing its conceptual and technical relevance. Future research shall focus on the notion of information in distributed systems, analysing the paradigm of information hiding in dependent type theories.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Coniglio, Marcelo E.</style></author><author><style face="normal" font="default" size="100%">Loffredo D'Ottaviano, Itala M.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Strategies: what's in a name?</style></title><secondary-title><style face="normal" font="default" size="100%">The Many Sides of Logic</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Studies in Logic</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">287–306</style></pages><isbn><style face="normal" font="default" size="100%">9781904987789</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Jespersen, Bjørn</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Nakakoji, Kumiyo</style></author><author><style face="normal" font="default" size="100%">Murakami, Yohei</style></author><author><style face="normal" font="default" size="100%">McCready, Eric</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Two type-theoretical approaches to privative modification</style></title><secondary-title><style face="normal" font="default" size="100%">New Frontiers in Artificial Intelligence: JSAI-isAI 2009 Workshops</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin, Heidelberg</style></pub-location><pages><style face="normal" font="default" size="100%">239–258</style></pages><isbn><style face="normal" font="default" size="100%">4-915905-37-3 C3004</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we apply two kinds of procedural semantics to the problem of privative modification. We do this for three reasons. The first reason is to launch a tough test case to gauge the degree of substantial agreement between a constructivist and a realist interpretation of a procedural semantics; the second is to extend Martin-Lof's Type Theory to privative modification, which is characteristic of natural language; the third reason is to sketch a positive characterization of privation.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive arbitration by variant counting on commutative bases with weights</style></title><secondary-title><style face="normal" font="default" size="100%">Fusion 2008: Proceedings of the 11th International Conference on Information Fusion</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper a new logical arbitration protocol for fusion of inconsistent information is designed. It defines a selection of models of a premise set in a multi-modal logic that uses the standard format of adaptive logics. The selected models are obtained by a counting procedure on the derivable data conflicting among the various sources. Peculiar of this approach is the definition of weights for commutative bases, in terms of the distinction between partially and fully supported information. The results obtained are compared to standard arbitration protocols and they extend previous work on the adaptive majority protocol.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Ducheyne, Steffen</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pilchak, Angela</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Entry &quot;Helmont, Johannes (Joan) Baptista Van&quot;</style></title><secondary-title><style face="normal" font="default" size="100%">New Dictionary of Scientific Biography</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Thomson Gale</style></publisher><volume><style face="normal" font="default" size="100%">III</style></volume><pages><style face="normal" font="default" size="100%">277-281</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Priest, Graham</style></author><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Graham Priest and Diderik Batens Interview Each Other</style></title><secondary-title><style face="normal" font="default" size="100%">The Reasoner</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><number><style face="normal" font="default" size="100%">8</style></number><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">2–4</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Majority Merging by Adaptive Counting</style></title><secondary-title><style face="normal" font="default" size="100%">Synthese (KRA Serie)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">165</style></volume><pages><style face="normal" font="default" size="100%">203–223</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The present paper introduces a belief merging procedure by majority using the standard format of Adaptive Logics. The core structure of the logic ADM(c) (Adaptive Doxastic Merging by Counting) consists in the formulation of the conflicts arising from the belief bases of the agents involved in the procedure. A strategy is then defined both semantically and proof-theoretically which selects the consistent contents answering to a majority principle. The results obtained are proven to be equivalent to a standard majority operator for bases with partial support.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A model for processing updates with inconsistent information on propositional databases</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%"> College Publications</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In the present paper a model for information update on propositional databases is formulated using the standard format of Adaptive Logics. The core structure of the update procedure is represented by the ab- normal expressions of the language that formalize received information contradicting previous contents. The strategy dened to restrict abnor- malities works by establishing, at each stage of the process, the most re- cent and reliable information, updating constantly the base and removing older data.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">De Mey, Tim</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Praet, Danny</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Ockhams theorie van evidente kennis en het epistemologisch externalisme</style></title><secondary-title><style face="normal" font="default" size="100%">Us and Them. Essays over filosofie, politiek, religie en cultuur van de Antieke Oudheid tot Islam in Europa ter ere van Herman De Ley</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Academia Press</style></publisher><pages><style face="normal" font="default" size="100%">227–239</style></pages><isbn><style face="normal" font="default" size="100%">978-90-382-1279-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Praet, Danny</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Protagoras en het kennistheoretisch relativisme</style></title><secondary-title><style face="normal" font="default" size="100%">Us and Them. Essays over filosofie, politiek, religie en cultuur van de Antieke Oudheid tot Islam in Europa ter ere van Herman De Ley</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Academia Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Gent</style></pub-location><pages><style face="normal" font="default" size="100%">181–192</style></pages><isbn><style face="normal" font="default" size="100%">9789038212791</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van Benthem, Johan</style></author><author><style face="normal" font="default" size="100%">Pacuit, Eric</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Quasi-merging and Pure-arbitration on Information for the family of Adaptive Logics ADM</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Workshop on Logic and Intelligent Interaction</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The present paper introduces two new information merging protocols for the family of adaptive logics &lt;strong&gt;ADM&lt;/strong&gt;, for which majority merging has been defined in [19]. The new adaptive operators re ect the negotiation processes of quasi-merging and pure arbitration, known from the Integrity Constraints framework introduced in [13]. The &lt;em&gt;Adaptive Variant Counting&lt;/em&gt; selection provides a result equivalent to the &lt;em&gt;GMax&lt;/em&gt; family of merging operators: it selects a collective model for a multi-set of belief bases based on the number of disagreements verified by the various models according to a leximax function. The &lt;em&gt;Adaptive Minimax Counting&lt;/em&gt; selection is a quasi-merging operator which applies a minimax function and it obtains a larger spectrum of possibilities than the previous selection: it simulates the behaviour of the &lt;em&gt;Max&lt;/em&gt; family of operators from the Integrity Con- straints framework, avoiding some of its counterintuitive results.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Psillos, Stathis</style></author><author><style face="normal" font="default" size="100%">Curd, Martin</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">The Role of Logic in Philosophy of Science</style></title><secondary-title><style face="normal" font="default" size="100%">The Routledge Companion to Philosophy of Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><publisher><style face="normal" font="default" size="100%">Routledge</style></publisher><pub-location><style face="normal" font="default" size="100%">London, New York</style></pub-location><pages><style face="normal" font="default" size="100%">47–57</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Heeffer, Albrecht</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pombo, Olga</style></author><author><style face="normal" font="default" size="100%">Gerner, Alexander</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Abduction as a strategy for concept formation in mathematics: Cardano postulating a negative.</style></title><secondary-title><style face="normal" font="default" size="100%">Abduction and the process of scientific discovery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Centro de Filosofia das Ciências da Universidade de Lisboa</style></publisher><pages><style face="normal" font="default" size="100%">179–194</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;When dealing with abductive reasoning in scientific discovery, historical case studies are focused mostly on the physical sciences, as with the discoveries of Kepler, Galilei and Newton. We will present a case study of abductive reasoning in early algebra. Two new concepts introduced by Cardano in his &lt;em&gt;Ars Magna&lt;/em&gt;, imaginary numbers and a negative solution to a linear problem, can be explained as a result of a process of abduction. We will show that the first appearance of these new concepts fits very well Peirces original description of abductive reasoning. Abduction may be regarded as one important strategy for the formation of new concepts in mathematics.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Abduction through Semantic Tableaux versus Abduction through Goal-Directed Proofs</style></title><secondary-title><style face="normal" font="default" size="100%">Theoria</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><number><style face="normal" font="default" size="100%">60</style></number><volume><style face="normal" font="default" size="100%">22/3</style></volume><pages><style face="normal" font="default" size="100%">295–304</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Alisedas approach based on semantic tableaux. We begin with some comments on Alisedas algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Alisedas algorithms.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pombo, Olga</style></author><author><style face="normal" font="default" size="100%">Gerner, Alexander</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive Logics for Abduction and the Explication of Explanation-Seeking Processes</style></title><secondary-title><style face="normal" font="default" size="100%">Abduction and the Process of Scientific Discovery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Centro de Filosofia das Ciências da U. de Lisboa</style></publisher><pub-location><style face="normal" font="default" size="100%">Lisboa</style></pub-location><pages><style face="normal" font="default" size="100%">97–119</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, I illustrate the main characteristics of abductive reasoning processes by means of an example from the history of the sciences. The example is taken from the history of chemistry and concerns a very small episode from Lavoisiers struggle with the air obtained from mercury oxide. Eventually, this struggle would lead to the discovery of oxygen. I also show that Lavoisiers reasoning process can be explicated by means of a particular formal logic, namely the adaptive logic LAr. An important property of LAr is that it not only nicely integrates deductive and abductive steps, but that it moreover has a decent proof theory. This proof theory is dynamic, but warrants that the conclusions derived at a given stage are justified in view of the insight in the premises at that stage. Another advantage of the presented logic is that, as compared to other existing systems for abductive reasoning, it is very close to natural reasoning.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">Van Bouwel, Jeroen</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Persson, J.</style></author><author><style face="normal" font="default" size="100%">Ylikoski, Petri</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Assessing the explanatory power of causal explanations.</style></title><secondary-title><style face="normal" font="default" size="100%">Rethinking Explanation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Kluwer Academic Publishers</style></publisher><pub-location><style face="normal" font="default" size="100%">Dordrecht</style></pub-location><pages><style face="normal" font="default" size="100%">109–118</style></pages><isbn><style face="normal" font="default" size="100%">978-1-4020-5580-5</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">van Benthem, Johan</style></author><author><style face="normal" font="default" size="100%">Shier, Ju</style></author><author><style face="normal" font="default" size="100%">Veltman, Frank</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Belief Merging based on Adaptive Interaction</style></title><secondary-title><style face="normal" font="default" size="100%">A Meeting of the Minds, proceedings of the workshop on Logic, Rationality and Interaction</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><isbn><style face="normal" font="default" size="100%">978-1-904987-48-2</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Tomala, O</style></author><author><style face="normal" font="default" size="100%">Honzik, R</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">On building abstract Terms in Typed Systems</style></title><secondary-title><style face="normal" font="default" size="100%">Logica 2006 Yearbook</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Filosofia Publisher</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper offers some historical and conceptual remarks on the philosophical and logical procedures of abstraction, based on an account of the notions of concept and function. In order to provide a complete analyis, one should start by considering Platos theory of Ideas, which provides the first interpretation of abstract terms in the history of philosophy. The nature of the most general Forms, the related problem of the knowledge thereof, their connection to existing (concrete) objects, are the essential features of the Platonic theory of knowledge and of his metaphysics. The Platonic approach is grounded on the principle of conceptual priority of Ideas over their partecipations, the Forms existing separeted from all the particulars: the former are interpreted as standard particulars to which other particulars conform. Nonetheless, my investigation will start rather by Aristotle, who held first the relation of predication to be the basis for defining abstraction: from this I will try to consider some important ideas for the notion of abstraction in Type Systems.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pombo, Olga</style></author><author><style face="normal" font="default" size="100%">Gerner, Alexander</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Content Guidance in Formal Problem Solving Processes</style></title><secondary-title><style face="normal" font="default" size="100%">Abduction and the Process of Scientific Discovery</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><publisher><style face="normal" font="default" size="100%">Centro de Filosofia das Ciências da U. de Lisboa</style></publisher><pub-location><style face="normal" font="default" size="100%">Lisboa</style></pub-location><pages><style face="normal" font="default" size="100%">121–156</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, a formal framework to problem-solving processes is presented. The framework is not complete. Nevertheless, even its present sophistication allows one to see that it is promising.\par The framework demonstrably allows one to understand scientific change as content-guided. It will be argued that a formal framework is required in order to make definite and precise statements about the content-guided aspects of scientific problem solving.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A modal language for contextual computations</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year><pub-dates><date><style  face="normal" font="default" size="100%">June</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we present a modal language for contextual computing, corresponding to the fragment of constructive ΚΤ with necessity and pos- sibility operators. We interpret absolute and contextual computations as difierent modes of verifying the truth of propositions. The semantics of the language L cc interprets absolute computations by a direct verification function valid in every state; contextual computations are interpreted in terms of a verification function valid under &lt;em&gt;unverified&lt;/em&gt; information. Modal- ities are used to express extensions of contexts in order to dene local and global validity. This semantics has a (weak) monotonicity property, de- pending on satisfaction of processes in contexts. In the corresponding axiomatic system &lt;em&gt;c&lt;/em&gt;ΚΤ&lt;sub&gt;⋄&lt;/sub&gt; a restricted version of the deduction theorem for globally valid formulas holds, soundness and completeness are proven and decidability is shown to hold for the necessitation fragment of the language by a restricted finite model property..&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Adaptive Characterization of Signed Systems for Paraconsistent Reasoning</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper we characterize the six (basic) signed systems from \cite{B&amp;amp;S:sspr} in terms of adaptive logics. We prove the characterization correct and show that it has a number of advantages.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malinowski, Jacek</style></author><author><style face="normal" font="default" size="100%">Pietruszczak, Andrzej</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Are there ontological explanations?</style></title><secondary-title><style face="normal" font="default" size="100%">Essays in Logic and Ontology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Rodopi</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam/New York</style></pub-location><volume><style face="normal" font="default" size="100%">91</style></volume><pages><style face="normal" font="default" size="100%">277–283</style></pages><isbn><style face="normal" font="default" size="100%">9042021306</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;There is a huge philosophical literature on scientific explanation, and no one seriously denies that the sciences explain in one way or another. But what about ontology? I will argue that ontological laws and ontological theories can explain. And I will point at the differences between ontological explanations and their scientific counterparts.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Primiero, Giuseppe</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Bilkova, M</style></author><author><style face="normal" font="default" size="100%">Tomala, O</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Belief Revision in Constructive Type Theory</style></title><secondary-title><style face="normal" font="default" size="100%">Logica 2005 Yearbook</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Filosofia Publisher</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malinowski, Jacek</style></author><author><style face="normal" font="default" size="100%">Pietruszczak, Andrzej</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Discussive Adaptive Logics: Handling Internal and External Inconsistencies</style></title><secondary-title><style face="normal" font="default" size="100%">Essays in Logic and Ontology</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Poznań Studies in the Philosophy of the Sciences and the Humanities</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Rodopi</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam/New York</style></pub-location><volume><style face="normal" font="default" size="100%">91</style></volume><pages><style face="normal" font="default" size="100%">211-223</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malinowski, Jacek</style></author><author><style face="normal" font="default" size="100%">Pietruszczak, Andrzej</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Narrowing Down Suspicion in Inconsistent Premise Sets</style></title><secondary-title><style face="normal" font="default" size="100%">Essays in Logic and Ontology.</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Poznan Studies in the Philosophy of Science and the Humanities</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">Rodopi</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam/New York</style></pub-location><volume><style face="normal" font="default" size="100%">91</style></volume><pages><style face="normal" font="default" size="100%">185–209</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Inconsistency-adaptive logics isolate the inconsistencies that are derivable from a premise set, and restrict the rules of Classical Logic only where inconsistencies are involved. From many inconsistent premise sets, disjunctions of contradictions are derivable no disjunct of which is itself derivable. Given such a disjunction, it is often justified to introduce new premises that state, with a certain degree of confidence, that some of the disjuncts are false. This is an important first step on the road to consistency: it narrows down suspicion in inconsistent premise sets and hence locates the real problems among the possible ones. In this paper I present two approaches for handling such new premises in the context of the original premises. The first approach may apparently be combined with all paraconsistent logics. The second approach does not have the same generality, but is decidedly more elegant.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vanackere, Guido</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Malinowski, Jacek</style></author><author><style face="normal" font="default" size="100%">Pietruszczak, Andrzej</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A World of Experiences, an Adequate Language, and Self-Reference Revised</style></title><secondary-title><style face="normal" font="default" size="100%">Essays in Logic and Ontology</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">Rodopi</style></publisher><volume><style face="normal" font="default" size="100%">91</style></volume><pages><style face="normal" font="default" size="100%">243–256</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The paper presents a new, intuitive formal language, L E , that fits in with a world view in which experiences are central entities. It is shown how classical logic and an &quot;objective making&quot; adaptive logic can be applied to formulas of L E . The latter logic sheds an interesting light on the creation of theories about &quot;the objective world&quot;. The paper also contains a small comment on sentences that are not translatable in L E . In the last section, I revise self-referring sentences by means of their translations in L E.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Lycke, Hans</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pereira, Luis Moniz</style></author><author><style face="normal" font="default" size="100%">Wheeler, Gregory</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Adaptive Logic for Compassionate Relevantism</style></title><secondary-title><style face="normal" font="default" size="100%">Computational Models of Scientific Reasoning and Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">CENTRIA</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Festa, Roberto</style></author><author><style face="normal" font="default" size="100%">Aliseda, Atocha</style></author><author><style face="normal" font="default" size="100%">Peijnenburg, Jeanne</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Empirical Progress and Ampliative Adaptive Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Confirmation, Empirical Progress, and Truth Approximation. Essays in Debate with Theo Kuipers. Vol. 1</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Poznan Studies in the Philosophy of the Sciences and the Humanities</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">Rodopi</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam/New York</style></pub-location><volume><style face="normal" font="default" size="100%">83</style></volume><pages><style face="normal" font="default" size="100%">193–217</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Prospectieve Dynamiek. Filosofische en Technische Onderbouwing van Doelgerichte Bewijzen en Bewijsheuristieken</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year><pub-dates><date><style  face="normal" font="default" size="100%">March 24</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Ghent University</style></publisher><work-type><style face="normal" font="default" size="100%">phd</style></work-type><custom1><style face="normal" font="default" size="100%">&lt;p&gt;Diderik Batens&lt;/p&gt;</style></custom1></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Direct Dynamic Proofs for Classical Compatibility</style></title><secondary-title><style face="normal" font="default" size="100%">Logique et Analyse</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">185–188</style></number><volume><style face="normal" font="default" size="100%">47</style></volume><pages><style face="normal" font="default" size="100%">305–317</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Alisedas approach based on semantic tableaux. We begin with some comments on Alisedas algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Alisedas algorithms.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Delrieux, Claudio</style></author><author><style face="normal" font="default" size="100%">Legris, Javier</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Direct dynamic proofs for compatibility.</style></title><secondary-title><style face="normal" font="default" size="100%">Computer modeling of scientific reasoning</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><publisher><style face="normal" font="default" size="100%">Universidad Nacional Del Sur. EDIUNS</style></publisher><pub-location><style face="normal" font="default" size="100%">Bahia Blanca, Argentinia</style></pub-location><pages><style face="normal" font="default" size="100%">179–187</style></pages><isbn><style face="normal" font="default" size="100%">987-9281-89-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author><author><style face="normal" font="default" size="100%">Verhoeven, Liza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Some Adaptive Logics for Diagnosis</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Logical Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><volume><style face="normal" font="default" size="100%">11/12</style></volume><pages><style face="normal" font="default" size="100%">39–65</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Verhoeven, Liza</style></author><author><style face="normal" font="default" size="100%">Van Dyck, Maarten</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ampliative Adaptive Logics and the Foundation of Logic-Based Approaches to Abduction</style></title><secondary-title><style face="normal" font="default" size="100%">Logical and Computational Aspects of Model-Based Reasoning</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">Kluwer Academic</style></publisher><pub-location><style face="normal" font="default" size="100%">Dordrecht</style></pub-location><pages><style face="normal" font="default" size="100%">39–71</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, we propose a reconstruction of logic-based approaches to abductive reasoning in terms of ampliative adaptive logics. The advantages of this reconstruction are important: the resulting logics have a proper theory (that leads to justified conclusions even for undecidable fragments), they nicely integrate deductive and abductive steps, and they are much closer to natural reasoning than the existing systems.&lt;br /&gt; We present two new adaptive logics for abduction, &lt;strong&gt;CP1&lt;/strong&gt; and &lt;strong&gt;CP2&lt;/strong&gt;. &lt;strong&gt;CP1&lt;/strong&gt; enables one to generate explanations for novel facts from a consistent theory. &lt;strong&gt;CP2&lt;/strong&gt; moreover enables one to abduce explanatory hypotheses for novel facts and for anomalous facts from a possibly inconsistent theory. We illustrate both logics with some examples from the history of the sciences (the discovery of Uranus and of Neptune), and present some alternatives to &lt;strong&gt;CP1&lt;/strong&gt; and &lt;strong&gt;CP2&lt;/strong&gt; that are better suited for non-creative forms of abductive reasoning and for practical reasoning.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Is er een diepe kloof tussen de heuristiek en de inferentieregels van een bewijstheorie? Een poging tot integratie.</style></title><secondary-title><style face="normal" font="default" size="100%">Handelingen van de 24ste Nederlands-Vlaamse Filosofiedag: Filosofie en Empirie</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">Universiteit Amsterdam</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In dit artikel wens ik in te gaan tegen het diepe onderscheid dat Hintikka voorstelt tussen de definitory -en strategic rules van een bewijstheorie. Ik doe dit door een integratie voor te stellen tussen de inferentieregels en de heuristiek van het formeel systeem &lt;strong&gt;Pc&lt;/strong&gt; uit dat toelaat doelgerichte en efficifiente bewijzen te maken.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Blockeel, H.</style></author><author><style face="normal" font="default" size="100%">Denecker, M.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">How to obtain elegant Fitch-style proofs from Goal directed ones.</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the Fourtheenth Belgium-Netherlands Conference on Artificial Intelligence, 2002</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">D'Hanis, Isabel</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Magnani, Lorenzo</style></author><author><style face="normal" font="default" size="100%">Nersessian, Nancy</style></author><author><style face="normal" font="default" size="100%">Pizzi, Claudio</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A logical approach to the analysis of metaphors</style></title><secondary-title><style face="normal" font="default" size="100%">Logical and Computational Aspects of Model-Based Reasoning</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">Kluwer Academic</style></publisher><pub-location><style face="normal" font="default" size="100%">Dordrecht</style></pub-location><volume><style face="normal" font="default" size="100%">25</style></volume><pages><style face="normal" font="default" size="100%">21–37</style></pages><isbn><style face="normal" font="default" size="100%">1402007124</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In this paper, I will present an adaptive logic that grasps the way we analyze metaphors. Metaphors are powerful tools to generate new scientific ideas. Therefore, it is important to have a good theory on what metaphors are and how they function. The first question we have to answer when we want to develop such a theory is obviously ˝what metaphors are˝. Philosophy of language can offer some interesting ideas but most views do not allow for a cognitive function of metaphors. One of the sparse views that does allow for it is interactionism. The basic version, however, has some serious shortcomings that need solving when we want to use this theory. First of all the terminology is too vague. Furthermore, the description of the reasoning process we use when we analyze a metaphor, only works for very simple examples. The logic I will present, ALM, is based on a broadened version of this view. A logical approach of metaphors allows us to gain a profound insight in the way we analyze metaphors. The analysis of metaphors is a dynamical reasoning process. When we want to capture this process in a logical system, we need a logic that is capable of grasping that specific type of dynamics. An adaptive logic seems to be the best choice. Therefore, I shall present an adaptive logic that grasps the analysis of metaphors.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pushing the Search Paths in the Proofs. A Study in Proof Heuristics</style></title><secondary-title><style face="normal" font="default" size="100%">Logique et Analyse</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><number><style face="normal" font="default" size="100%">173-175</style></number><volume><style face="normal" font="default" size="100%">44</style></volume><pages><style face="normal" font="default" size="100%">113–134</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Introducing techniques deriving from dynamic proofs in proofs for propositional classical logic is shown to lead to a proof format that enables one to push search paths into the proofs themselves. The resulting goal directed proof format is shown to provide a decision method for &lt;em&gt;A&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, ..., &lt;em&gt;A&lt;sub&gt;n&lt;/sub&gt;&lt;/em&gt; &lt;img src=&quot;vdash.gif&quot; alt=&quot;vdash&quot; /&gt; &lt;em&gt;B&lt;/em&gt; and a positive test for &lt;img src=&quot;ggamma.gif&quot; alt=&quot;Gamma&quot; /&gt; &lt;img src=&quot;vdash.gif&quot; alt=&quot;vdash&quot; /&gt; &lt;em&gt;A&lt;/em&gt;.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Mortensen, Chris</style></author><author><style face="normal" font="default" size="100%">Priest, Graham</style></author><author><style face="normal" font="default" size="100%">Van Bendegem, Jean Paul</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Extremely Rich Paraconsistent Logic and the Adaptive Logic Based on It</style></title><secondary-title><style face="normal" font="default" size="100%">Frontiers of Paraconsistent Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><publisher><style face="normal" font="default" size="100%">Research Studies Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Baldock, UK</style></pub-location><pages><style face="normal" font="default" size="100%">189–201</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Mortensen, Chris</style></author><author><style face="normal" font="default" size="100%">Priest, Graham</style></author><author><style face="normal" font="default" size="100%">Van Bendegem, Jean Paul</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Frontiers of Paraconsistent Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Frontiers of Paraconsistent Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><publisher><style face="normal" font="default" size="100%">Research Studies Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Baldock, UK</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Mortensen, Chris</style></author><author><style face="normal" font="default" size="100%">Priest, Graham</style></author><author><style face="normal" font="default" size="100%">Van Bendegem, Jean Paul</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Survey of Inconsistency-Adaptive Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Frontiers of Paraconsistent Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><publisher><style face="normal" font="default" size="100%">Research Studies Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Baldock, UK</style></pub-location><pages><style face="normal" font="default" size="100%">49–73</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Formal Analysis of Diagnosis and Diagnostic Reasoning</style></title><secondary-title><style face="normal" font="default" size="100%">Logique et Analyse</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><number><style face="normal" font="default" size="100%">165-166</style></number><volume><style face="normal" font="default" size="100%">42</style></volume><pages><style face="normal" font="default" size="100%">161–180</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Diagnostic reasoning may relate to an established fault in a system or in an individual.&lt;br /&gt; With respect to &lt;em&gt;systems&lt;/em&gt;, three types of diagnosis are distinguishable: non-explanatory, weak explanatory and strong explanatory. The latter are defined, illustrated and their respective functions are described. The reasoning process for the construction of non-explanatory diagnoses is analysed and we propose two adaptive logics that are adequate tools for modelling this kind of diagnostic reasoning. We also discuss (weak and strong) explanatory diagnostic reasoning and show that it can be divided in three stages. The modelling of each stage requires a different adaptive logic.&lt;br /&gt; With respect to &lt;em&gt;individuals&lt;/em&gt;, we show that non-explanatory diagnoses do not occur. The earlier findings for explanatory diagnostic reasoning may be adopted.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Priest, Graham</style></author><author><style face="normal" font="default" size="100%">Routley, Richard</style></author><author><style face="normal" font="default" size="100%">Norman, Jean</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic Dialectical Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Paraconsistent Logic. Essays on the Inconsistent</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1989</style></year></dates><publisher><style face="normal" font="default" size="100%">Philosophica Verlag</style></publisher><pages><style face="normal" font="default" size="100%">187–217</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Vandamme, Fernand</style></author><author><style face="normal" font="default" size="100%">Pinxten, Rik</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Leo Apostel on Dialectical Logic</style></title><secondary-title><style face="normal" font="default" size="100%">The Philosophy of Leo Apostel, vol. 2: Descriptive and Critical Essays</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1989</style></year></dates><publisher><style face="normal" font="default" size="100%">Communication and Cognition</style></publisher><pages><style face="normal" font="default" size="100%">24–55</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Perzanowski, Jerzy</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Two semantically motivated enrichments of relevant logics</style></title><secondary-title><style face="normal" font="default" size="100%">Essays in Philosophical Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1987</style></year></dates><publisher><style face="normal" font="default" size="100%">Jagiellonian University Press</style></publisher><pages><style face="normal" font="default" size="100%">65–74</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pitt, J. C.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Meaning, Acceptance, and Dialectics</style></title><secondary-title><style face="normal" font="default" size="100%">Change and Progress in Modern Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1985</style></year></dates><publisher><style face="normal" font="default" size="100%">Reidel</style></publisher><pages><style face="normal" font="default" size="100%">333–360</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Apostel, Leo</style></author><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Breusegem, Erwin</style></author><author><style face="normal" font="default" size="100%">De Coninck, Jan</style></author><author><style face="normal" font="default" size="100%">De Waele, Danny</style></author><author><style face="normal" font="default" size="100%">Pinxten, Rik</style></author><author><style face="normal" font="default" size="100%">Swings, Jean</style></author><author><style face="normal" font="default" size="100%">Van Bendegem, Jean Paul</style></author><author><style face="normal" font="default" size="100%">Vandamme, Fernand</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Callebaut, Werner</style></author><author><style face="normal" font="default" size="100%">De Mey, Marc</style></author><author><style face="normal" font="default" size="100%">Pinxten, Rik</style></author><author><style face="normal" font="default" size="100%">Vandamme, Fernand</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An empirical investigation on scientific observation</style></title><secondary-title><style face="normal" font="default" size="100%">Theory of Knowledge and Science Policy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1979</style></year></dates><publisher><style face="normal" font="default" size="100%">Communication &amp; Cognition</style></publisher><pages><style face="normal" font="default" size="100%">3–36</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">De Mey, Marc</style></author><author><style face="normal" font="default" size="100%">Pinxten, Rik</style></author><author><style face="normal" font="default" size="100%">Poriau, M.</style></author><author><style face="normal" font="default" size="100%">Vandamme, Fernand</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Verisimilitude and meaning relations</style></title><secondary-title><style face="normal" font="default" size="100%">CC77. International Workshop on the Cognitive Viewpoint</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1977</style></year></dates><publisher><style face="normal" font="default" size="100%">Ghent University</style></publisher><pages><style face="normal" font="default" size="100%">321–328</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record></records></xml>