The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in (...) human reasoning. Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

. What is a logic? Which properties are preserved by maps between logics? What is the right notion for equivalence of logics? In order to give satisfactory answers we generalize and further develop the topological approach of [4] and present the foundations of a general theory of abstract logics which is based on the abstract concept of a theory. Each abstract logic determines a topology on the set of theories. We develop a theory of (...) logic maps and show in what way they induce (continuous, open) functions on the corresponding topological spaces. We also establish connections to well-known notions such as translations of logics and the satisfaction axiom of institutions [5]. Logic homomorphisms are maps that behave in some sense like continuous functions and preserve more topological structure than logic maps in general. We introduce the notion of a logic isomorphism as a (not necessarily bijective) function on the sets of formulas that induces a homeomorphism between the respective topological spaces and gives rise to an equivalence relation on abstract logics. Therefore, we propose logic isomorphisms as an adequate and precise notion for equivalence of logics. Finally, we compare this concept with another recent proposal presented in [2]. (shrink)

A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.

Structuralism has recently moved center stage in philosophy of mathematics. One of the issues discussed is the underlying logic of mathematical structuralism. In this paper, I want to look at the dual question, namely the underlying structures of logic. Indeed, from a mathematical structuralist standpoint, it makes perfect sense to try to identify the abstract structures underlying logic. We claim that one answer to this question is provided by categorical logic. In fact, we claim that the latter can be (...) seen—and probably should be seen—as being a structuralist approach to logic and it is from this angle that categorical logic is best understood. (shrink)

A possibility of defining logical constants within abstract logical frameworks is discussed, in relation to abstract definition of logical consequence. We propose using duals as a general method of applying the idea of invariance under replacement as a criterion for logicality.

In this paper we study an alternative approach to the concept of abstract logic and to connectives in abstract logics. The notion of abstract logic was introduced by Brown and Suszko —nevertheless, similar concepts have been investigated by various authors. Considering abstract logics as intersection structures we extend several notions to their κ -versions, introduce a hierarchy of κ -prime theories, which is important for our treatment of infinite connectives, and study different concepts of (...) κ -compactness. We are particularly interested in non-topped intersection structures viewed as semi-lattices with a minimal meet-dense subset, i.e., with a minimal generator set. We study a chain condition which is sufficient for a minimal generator set, implies compactness of the logic, and in regular logics is equivalent to compactness of the consequence relation together with the existence of a inconsistent set, where κ is the cofinality of the cardinality of the logic. Some of these results are known in a similar form in the context of closure spaces, we give extensions to intersection structures and to big cardinals presenting new proofs based on set-theoretical tools. The existence of a minimal generator set is crucial for our way to define connectives. Although our method can be extended to further non-classical connectives we concentrate here on intuitionistic and infinite ones. Our approach leads us to the concept of the set of complete theories which is stable under all considered connectives and gives rise to the definition of the topological space of the logic. Topological representations of abstract logics by means of this space remain to be further investigated. (shrink)

Babenyshev and Martins proved that two hidden multi-sorted deductive systems are deductively equivalent if and only if there exists an isomorphism between their corresponding lattices of theories that commutes with substitutions. We show that the π-institutions corresponding to the hidden multi-sorted deductive systems studied by Babenyshev and Martins satisfy the multi-term condition of Gil-F´erez. This provides a proof of the result of Babenyshev and Martins by appealing to the general result of Gil-F´erez pertaining to arbitrary multi-term π-institutions. The approach places (...) hidden multi-sorted deductive systems in a more general framework and bypasses the laborious reuse of well-known proof techniques from traditional abstract algebraic logic by using “off the shelf” tools. (shrink)

The following problem is studied: How large and how small can the Löwenheim and Hanf numbers of unbounded logics be in relation to the most common large cardinals? The main result is that the Löwenheim number of the logic with the Härtig-quantifier can be consistently put in between any two of the first weakly inaccessible, the first weakly Mahlo, the first weakly compact, the first Ramsey, the first measurable and the first supercompact cardinals.

The logician recognizes the following propositional forms as necessary and sufficient for the expression of any truth.

A semantical definition of abstract logics is given. It is shown that the Craig interpolation property implies the Beth definability property, and that the Souslin-Kleene interpolation property implies the weak Beth definability property. An example is given, showing that Beth does not imply Souslin-Kleene.

Departing from basic concepts in abstract logics, this paper introduces two concepts: conjunctive and disjunctive limits. These notions are used to formalize levels of modal operators.

We associate with any abstract logic L a family F(L) consisting, intuitively, of the limit ultrapowers which are complete extensions in the sense of L. For every countably generated [ω, ω]-compact logic L, our main applications are: (i) Elementary classes of L can be characterized in terms of $\equiv_L$ only. (ii) If U and B are countable models of a countable superstable theory without the finite cover property, then $\mathfrak{U} \equiv_L \mathfrak{B}$ . (iii) There exists the "largest" logic M (...) such that complete extensions in the sense of M and L are the same; moreover M is still [ω,ω]-compact and satisfies an interpolation property stronger than unrelativized ▵-closure. (iv) If L = L ωω(Q α ) , then $\operatorname{cf}(\omega_\alpha) > \omega$ and $\lambda^\omega for all $\lambda . We also prove that no proper extension of L ωω generated by monadic quantifiers is compact. This strengthens a theorem of Makowsky and Shelah. We solve a problem of Makowsky concerning L κλ -compact cardinals. We partially solve a problem of Makowsky and Shelah concerning the union of compact logics. (shrink)

We generalize a theorem of Mundici relating compactness of a regular logic L to a strong form of normality of the associated spaces of models. Moreover, it is shown that compactness is in fact equivalent to ordinary normality of the model spaces when L has uniform reduction for infinite disjoint sums of structures. Some applications follow. For example, a countably generated logic is countably compact if and only if every clopen class in the model spaces is elementary. The model spaces (...) of L are not normal for vocabularies of uncountable power ωα. It also follows that first-order logic is the only finite-dependence logic having normal model spaces and satisfying at the same time the downward Löwenheim-Skolem theorem and uniform reduction for pairs. (shrink)

In any model theoretic logic, Beth’s definability property together with Feferman-Vaught’s uniform reduction property for pairs imply recursive compactness, and the existence of models with infinitely many automorphisms for sentences having infinite models. The stronger Craig’s interpolation property plus the uniform reduction property for pairs yield a recursive version of Ehrenfeucht-Mostowski’s theorem. Adding compactness, we obtain the full version of this theorem. Various combinations of definability and uniform reduction relative to other logics yield corresponding results on the existence of (...) non-rigid models. (shrink)

Do children understand how different numbers are related before they associate them with specific cardinalities? We explored how children rely on two abstract relations – contrast and entailment – to reason about the meanings of ‘unknown’ number words. Previous studies argue that, because children give variable amounts when asked to give an unknown number, all unknown numbers begin with an existential meaning akin to some. In Experiment 1, we tested an alternative hypothesis, that because numbers belong to a scale (...) of contrasting alternatives, children assign them a meaning distinct from some. In the “Don’t Give-a-Number task”, children were shown three kinds of fruit (apples, bananas, strawberries), and asked to not give either some or a number of one kind (e.g. Give everything, but not [some/five] bananas). While children tended to give zero bananas when asked to not give some, they gave positive amounts when asked to not give numbers. This suggests that contrast – plus knowledge of a number’s membership in a count list – enables children to differentiate the meanings of unknown number words from the meaning of some. Experiment 2 tested whether children’s interpretation of unknown numbers is further constrained by understanding numerical entailment relations – that if someone, e.g. has three, they thereby also have two, but if they do not have three, they also do not have four. On critical trials, children saw two characters with different quantities of fish, two apart (e.g. 2 vs. 4), and were asked about the number inbetween – who either has or doesn’t have, e.g. three. Children picked the larger quantity for the affirmative, and the smaller for the negative prompts even when all the numbers were unknown, suggesting that they understood that, whatever three means, a larger quantity is more likely to contain that many, and a smaller quantity is more likely not to. We conclude by discussing how contrast and entailment could help children scaffold the exact meanings of unknown number words. (shrink)

Carruthers’ thesis is undermined on the one hand by examples of integration of output from domain-specific modules that are independent of language, and on the other hand by examples of linguistically represented thoughts that are unable to integrate different domain-specific knowledge into a coherent whole. I propose a more traditional role for language in thought as providing the basis for the cultural development and transmission of domain-general abstract knowledge and reasoning skills.

An abstract logic A, C consists of a finitary algebraA and a closure systemC onA. C induces two other closure systems onA, C P andC I, by projective and inductive generation respectively. The various relations amongC, C P andC I are determined. The special case thatC is the standard equational closure system on monadic terms is studied in detail. The behavior of Boolean logics with respect to projective and inductive generation is determined.

We continue work of our earlier paper :219–241, 2009) where abstract logics and particularly intuitionistic abstract logics are studied.logics can be topologized in a direct and natural way. This facilitates a topological study of classes of concrete logics whenever they are given in abstract form. Moreover, such a direct topological approach avoids the often complex algebraic and lattice-theoretic machinery usually applied to represent logics. Motivated by that point of view, we define in (...) this paper the category of intuitionistic abstract logics with stable logic maps as morphisms, and the category of implicative spectral spaces with spectral maps as morphisms. We show the equivalence of these categories and conclude that the larger categories of distributive abstract logics and distributive sober spaces are equivalent, too. (shrink)

This paper contains a joint study of two sentential logics that combine a many-valued character, namely tetravalence, with a modal character; one of them is normal and the other one quasinormal. The method is to study their algebraic counterparts and their abstract models with the tools of Abstract Algebraic Logic, and particularly with those of Brown and Suszko's theory of abstract logics as recently developed by Font and Jansana in their "A General Algebraic Semantics for (...) Sentential Logics". The logics studied here arise from the algebraic and lattice-theoretical properties we review of Tetravalent Modal Algebras, a class of algebras studied mainly by Loureiro, and also by Figallo, Landini and Ziliani, at the suggestion of the late Antonio Monteiro. (shrink)

The Craig Interpolation Theorem is a fundamental property of rst order logic L!!. What happens if we strengthen rst order logic? Second order logic L 2 satises Craig for trivial reasons but on the other hand, L 2 is not very interesting from a fundational point of view.

An important part of the theory of algebraizable sentential logics consists of studying the algebraic semantics of these logics. As developed by Czelakowski, Blok, and Pigozzi and Font and Jansana, among others, it includes studying the properties of logical matrices serving as models of deductive systems and the properties of abstract logics serving as models of sentential logics. The present paper contributes to the development of the categorical theory by abstracting some of these model theoretic (...) aspects and results from the level of sentential logics to the level of π-institutions. (shrink)

We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation trees. Then we show that the abstraction principle leads to a Curry fixed point, a statement C that asserts C ⇒ A where A is any given statement. When A is false, such a C yields a paradoxical situation. As discussed in our earlier work, this situation leaves (...) one no choice but to restrict the use of a certain class of implicational rules including modus ponens. (shrink)

We present in this paper an abstract categorical logic based on an abstraction of quantifier. More precisely, the proposed logic is abstract because no structural constraints are imposed on models (semantics free). By contrast, formulas are inductively defined from an abstraction both of atomic formulas and of quantifiers. In this sense, the proposed approach differs from other works interested in formalizing the notion of abstract logic and of which the closest to our approach are the institutions, which (...) in addition to be semantics free do not also impose any syntactic contingencies on the structure of formulas. To define the semantical framework in which formulas will be interpreted, we propose to follow the idea from categorical logic which defines the semantical interpretation of formulas from context and as subobjects of an object of a given category. In the spirit of Lawvere’s hyperdoctrines, we use a more abstract notion which generalizes the notion of subobject, standard in category theory: Pitt’s prop-categories. Always in the spirit of categorical logic, we propose a sequent calculus of which we show correctness and completeness for all semantical frameworks defined over any prop-categories. We then study some conditions which allow us to get this completeness result for particular classes of prop-categories. (shrink)

We present an abstract model of rationality that focuses on structural properties of attitudes. Rationality requires coherence between your attitudes, such as your beliefs, values, and intentions. We define three 'logical' conditions on attitudes: consistency, completeness, and closedness. They parallel the familiar logical conditions on beliefs, but contrast with standard rationality conditions like preference transitivity. We establish a formal correspondence between our logical conditions and standard rationality conditions. Addressing John Broome's programme 'rationality through reasoning', we formally characterize how you (...) can (not) become more logical by reasoning. Our analysis connects rationality with logic, and enables logical talk about multi-attitude psychology. (shrink)

A debated topic in Avicennan psychology is whether for Avicenna abstraction is a metaphor for emanation or to be taken literally. This issue stems from the deeper philosophical question of whether humans acquire intelligibles externally from an emanation by the Active Intellect, which is a separate substance, or internally from an inherently human cognitive process, which prepares us for an emanation from the Active Intellect. I argue that the tension between thesedoctrines is only apparent. In his logical works Avicenna limns (...) an account where through the internal human process of abstraction accidents accruing to an essence existing in matter are extracted, thus preparing the essence for new accidents emanating externally from the Active Intellect, which make the essence something conceptualized in the intellect. This study, then, outlines the epistemological and metaphysical framework presented in the logical works that underpins Avicenna’s theory of abstraction presented in his psychological works. (shrink)

On the one hand, the absence of contraction is a safeguard against the logical (property theoretic) paradoxes; but on the other hand, it also disables inductive and recursive definitions, in its most basic form the definition of the series of natural numbers, for instance. The reason for this is simply that the effectiveness of a recursion clause depends on its being available after application, something that is usually assured by contraction. This paper presents a way of overcoming this problem within (...) the framework of a logic based on inclusion and unrestricted abstraction, without any form of extensionality. (shrink)

This English translation of the author's original work has been thoroughly revised, expanded and updated. The book covers logical systems known as type-free or self-referential . These traditionally arise from any discussion on logical and semantical paradoxes. This particular volume, however, is not concerned with paradoxes but with the investigation of type-free sytems to show that: (i) there are rich theories of self-application, involving both operations and truth which can serve as foundations for property theory and formal semantics; (ii) these (...) theories provide a new outlook on classical topics, such as inductive definitions and predicative mathematics; (iii) they are particularly promising with regard to applications. Research arising from paradoxes has moved progressively closer to the mainstream of mathematical logic and has become much more prominent in the last twenty years. A number of significant developments, techniques and results have been discovered. Academics, students and researchers will find that the book contains a thorough overview of all relevant research in this field. (shrink)

Inspired by some logical considerations, the paper proposes a novel perspective on the use of two-players zero-sum games in abstract argumentation. The paper first introduces a second-order modal logic, within which all main Dung-style semantics are shown to be formalizable, and then studies the model checking game of this logic. The model checking game is then used to provide a systematic game theoretic proof procedure to test membership with respect to all those semantics formalizable in the logic. The paper (...) discusses this idea in detail and illustrates it by providing a game for the so-called skeptical preferred and skeptical semi-stable semantics. (shrink)

A debated topic in Avicennan psychology is whether for Avicenna abstraction is a metaphor for emanation or to be taken literally. This issue stems from the deeper philosophical question of whether humans acquire intelligibles externally from an emanation by the Active Intellect, which is a separate substance, or internally from an inherently human cognitive process, which prepares us for an emanation from the Active Intellect. I argue that the tension between thesedoctrines is only apparent. In his logical works Avicenna limns (...) an account where through the internal human process of abstraction accidents accruing to an essence existing in matter are extracted, thus preparing the essence for new accidents emanating externally from the Active Intellect, which make the essence something conceptualized in the intellect. This study, then, outlines the epistemological and metaphysical framework presented in the logical works that underpins Avicenna’s theory of abstraction presented in his psychological works. (shrink)

Wójcicki has provided a characterization of selfextensional logics as those that can be endowed with a complete local referential semantics. His result was extended by Jansana and Palmigiano, who developed a duality between the category of reduced congruential atlases and that of reduced referential algebras over a fixed similarity type. This duality restricts to one between reduced atlas models and reduced referential algebra models of selfextensional logics. In this paper referential algebraic systems and congruential atlas systems are introduced, (...) which abstract referential algebras and congruential atlases, respectively. This enables the formulation of an analog of Wójcicki’s Theorem for logics formalized as π-institutions. Moreover, the results of Jansana and Palmigiano are generalized to obtain a duality between congruential atlas systems and referential algebraic systems over a fixed categorical algebraic signature. In future work, the duality obtained in this paper will be used to obtain one between atlas system models and referential algebraic system models of an arbitrary selfextensional π-institution. Using this latter duality, the characterization of fully selfextensional deductive systems among the selfextensional ones, that was obtained by Jansana and Palmigiano, can be extended to a similar characterization of fully selfextensional π-institutions among appropriately chosen classes of selfextensional ones. (shrink)

Abstraction and generalization are two processes of reasoning that have a special role in the construction of scientific theories and models. They have been important parts of the scientific method ever since the nineteenth century. A philosophical and historical analysis of scientific practices shows how abstraction and generalization found their way into the theory of the logic of science of the nineteenth-century philosopher Charles S. Peirce. Our case studies include the scientific practices of Francis Galton and John Herschel, who introduced (...) composite photographs and graphical methods, respectively, as technologies of generalization and thereby influenced Peirce’s logic of abstraction. Herschel’s account of generalization is further supported by William Whewell, who was very influential on Peirce. By connecting Herschel’s scientific technology of abstraction to Peirce’s logical technology of abstraction—namely, diagrams—we highlight the role of judgments in scientific observation by hypostatic abstractions. We also relate Herschel’s discovery-driven logic of science and Peirce’s open-ended diagrammatic logic to the use of models in science. Ultimately, Peirce’s theory of abstraction is a case of showing how logic applies to reality. (shrink)

Two famous negative results about da Costa’s paraconsistent logic ${\mathscr {C}}_1$ (the failure of the Lindenbaum–Tarski process [44] and its non-algebraizability [39]) have placed ${\mathscr {C}}_1$ seemingly as an exception to the scope of Abstract Algebraic Logic (AAL). In this paper we undertake a thorough AAL study of da Costa’s logic ${\mathscr {C}}_1$. On the one hand, we strengthen the negative results about ${\mathscr {C}}_1$ by proving that it does not admit any algebraic semantics whatsoever in the sense of (...) Blok and Pigozzi (a weaker notion than algebraizability also introduced in the monograph [6]). On the other hand, ${\mathscr {C}}_1$ is a protoalgebraic logic satisfying a Deduction-Detachment Theorem (DDT). We then extend our AAL study to some paraconsistent axiomatic extensions of ${\mathscr {C}}_1$ covered in the literature. We prove that for extensions ${\mathcal {S}}$ such as ${\mathcal {C}ilo}$ [26], every algebra in ${\mathsf {Alg}}^*({\mathcal {S}})$ contains a Boolean subalgebra, and for extensions ${\mathcal {S}}$ such as,, or [16, 53], every subdirectly irreducible algebra in ${\mathsf {Alg}}^*({\mathcal {S}})$ has cardinality at most 3. We also characterize the quasivariety ${\mathsf {Alg}}^*({\mathcal {S}})$ and the intrinsic variety $\mathbb {V}({\mathcal {S}})$, with,, and. (shrink)

Protoalgebraic logics are characterized by the monotonicity of the Leibniz operator on their theory lattices and are at the lower end of the Leibniz hierarchy of abstract algebraic logic. They have been shown to be the most primitive among those logics with a strong enough algebraic character to be amenable to algebraic study techniques. Protoalgebraic π-institutions were introduced recently as an analog of protoalgebraic sentential logics with the goal of extending the Leibniz hierarchy from the sentential (...) framework to the π-institution framework. Many properties of protoalgebraic logics, studied in the sentential logic framework by Blok and Pigozzi, Czelakowski, and Font and Jansana, among others, have already been adapted in previous work by the author to the categorical level. This work aims at further advancing that study by exploring in this new level some more properties of protoalgebraic sentential logics. (shrink)

Fitch's basic logic is an untyped illative combinatory logic with unrestricted principles of abstraction effecting a type collapse between properties (or concepts) and individual elements of an abstract syntax. Fitch does not work axiomatically and the abstraction operation is not a primitive feature of the inductive clauses defining the logic. Fitch's proof that basic logic has unlimited abstraction is not clear and his proof contains a number of errors that have so far gone undetected. This paper corrects these errors (...) and presents a reasonably intuitive proof that Fitch's system K supports an implicit abstraction operation. Some general remarks on the philosophical significance of basic logic, especially with respect to neo-logicism, are offered, and the paper concludes that basic logic models a highly intensional form of logicism. (shrink)

A category theoretic generalization of the theory of algebraizable deductive systems of Blok and Pigozzi is developed. The theory of institutions of Goguen and Burstall is used to provide the underlying framework which replaces and generalizes the universal algebraic framework based on the notion of a deductive system. The notion of a term -institution is introduced first. Then the notions of quasi-equivalence, strong quasi-equivalence and deductive equivalence are defined for -institutions. Necessary and sufficient conditions are given for the quasi-equivalence and (...) the deductive equivalence of two term -institutions, based on the relationship between their categories of theories. The results carry over without any complications to institutions, via their associated -institutions. The -institution associated with a deductive system and the institution of equational logic are examined in some detail and serve to illustrate the general theory. (shrink)

A category theoretic generalization of the theory of algebraizable deductive systems of Blok and Pigozzi is developed. The theory of institutions of Goguen and Burstall is used to provide the underlying framework which replaces and generalizes the universal algebraic framework based on the notion of a deductive system. The notion of a term π-institution is introduced first. Then the notions of quasi-equivalence, strong quasi-equivalence and deductive equivalence are defined for π-institutions. Necessary and sufficient conditions are given for the quasi-equivalence and (...) the deductive equivalence of two term π-institutions, based on the relationship between their categories of theories. The results carry over without any complications to institutions, via their associated π-institutions. The π-institution associated with a deductive system and the institution of equational logic are examined in some detail and serve to illustrate the general theory. (shrink)

As a result of these restrictions, an implementation of L [subscript lambda] does not need to implement full higher-order unification. Instead, an extension to first-order unification that respects bound variable names and scopes is all that is required. Such unification problems are shown to be decidable and to possess most general unifiers when unifiers exist. A unification algorithm and logic programming interpreter are described and proved correct. Several examples of using L[subscript lambda] as a meta-programming language are presented.