Axiomatizing proof tree concepts in Bounded Arithmetic

We construct theories of Cook-Nguyen style two-sort bounded arithmetic whose provably total functions are exactly those in LOGCFL and LOGDCFL. Axiomatizations of both theories are based on the proof tree size characterizations of these classes. We also show that our theory for LOGCFL proves a certain formulation of the pumping lemma for context-free languages

Goal-Driven Query Answering for Existential Rules with Equality

Inspired by the magic sets for Datalog, we present a novel goal-driven approach for answering queries over terminating existential rules with equality (aka TGDs and EGDs). Our technique improves the performance of query answering by pruning the consequences that are not relevant for the query. This is challenging in our setting because equalities can potentially affect all predicates in a dataset. We address this problem by combining the existing singularization technique with two new ingredients: an algorithm for identifying the rules relevant to a query and a new magic sets algorithm. We show empirically that our technique can significantly improve the performance of query answering, and that it can mean the difference between answering a query in a few seconds or not being able to process the query at all

A Fragment of Dependence Logic Capturing Polynomial Time

In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the complexity class P of all sets decidable in polynomial time. Furthermore we study the question which of our results can ge generalized to the case of open formulae of D-Horn* and so-called downwards monotone polynomial time properties of teams

Structural Logic and Abstract Elementary Classes with Intersection

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond to classes of models of a universal theory in structural logic. This generalizes Tarski's syntactic characterization of universal classes. As a corollary, we obtain that any AEC with countable L\"owenheim-Skolem number is axiomatizable in $\mathbb{L}_{\infty, \omega} (Q)$, where $Q$ is the quantifier "there exists uncountably many".Comment: 14 page

Theories of truth for countable languages which conform to classical logic

Every countable language which conforms to classical logic is shown to have an extension which has a consistent definitional theory of truth. That extension has a consistent semantical theory of truth, if every sentence of the object language is valuated by its meaning either as true or as false. These theories contain both a truth predicate and a non-truth predicate. Theories are equivalent when sentences of the object lqanguage are valuated by their meanings

A Case Study on Computational Hermeneutics: E. J. Lowe’s Modal Ontological Argument

Computers may help us to better understand (not just verify) arguments. In this article we defend this claim by showcasing the application of a new, computer-assisted interpretive method to an exemplary natural-language ar- gument with strong ties to metaphysics and religion: E. J. Lowe’s modern variant of St. Anselm’s ontological argument for the existence of God. Our new method, which we call computational hermeneutics, has been particularly conceived for use in interactive-automated proof assistants. It aims at shedding light on the meanings of words and sentences by framing their inferential role in a given argument. By employing automated theorem reasoning technology within interactive proof assistants, we are able to drastically reduce (by several orders of magnitude) the time needed to test the logical validity of an argu- ment’s formalization. As a result, a new approach to logical analysis, inspired by Donald Davidson’s account of radical interpretation, has been enabled. In computational hermeneutics, the utilization of automated reasoning tools ef- fectively boosts our capacity to expose the assumptions we indirectly commit ourselves to every time we engage in rational argumentation and it fosters the explicitation and revision of our concepts and commitments

All Properties are Divine or God exists

A metaphysical system engendered by a third order quantified modal logic S5 plus impredicative comprehension principles is used to isolate a third order predicate D, and by being able to impredicatively take a second order predicate G to hold of an individual just if the individual necessarily has all second order properties which are D we in Section 2 derive the thesis (40) that all properties are D or some individual is G. In Section 3 theorems 1 to 3 suggest a sufficient kinship to Gödelian ontological arguments so as to think of thesis (40) in terms of divine property and Godly being; divine replaces positive with Gödel and others. Thesis (40), the sacred thesis, supports the ontological argument that God exists because some property is not divine. In Section 4 a fixed point analysis is used as diagnosis so that atheists may settle for the minimal fixed point. Theorem 3 shows it consistent to postulate theistic fixed points, and a monotheistic result follows if one assumes theism and that it is divine to be identical with a deity. Theorem 4 (the Monotheorem) states that if Gg and it is divine to be identical with g, then necessarily all objects which are G are identical with g. The impredicative origin of D suggests weakened Gaunilo-like objections that offer related theses for other second order properties and their associated diverse presumptive individual bearers. Nevertheless, in the last section we finesse these Gaunilo-like objections by adopting what we call an apathiatheistic opinion which suggest that the best concepts `God’ allow thorough indifference as to whether God exists or not