Proves Completeness for the Evidential Conditional.

Amodal completion is usually characterized as the representation of those parts of the perceived object that we get no sensory stimulation from. In the case of the visual sense modality, for example, amodal completion is the representation of occluded parts of objects we see. I argue that relationalism about perception, the view that perceptual experience is constituted by the relation to the perceived object, cannot give a coherent account of amodal completion. The relationalist has two options: construe the perceptual relation (...) as the relation to the entire perceived object or as the relation to the unoccluded parts of the perceived object. I argue that neither of these options are viable. (shrink)

A complete, high‐quality reference sequence of a dog genome was recently produced by a team of researchers led by the Broad Institute, achieving another major milestone in deciphering the genomic landscape of mammalian organisms. The genome sequence provides an indispensable resource for comparative analysis and novel insights into dog and human evolution and history. Together with the survey sequence of a poodle previously published in 2003, the two dog genome sequences allowed identification of more than 2.5 million single nucleotide polymorphisms (...) within and between dog breeds, which can be used in evolutionary analysis, behavioral studies and disease gene mapping.1 © 2005 Wiley Periodicals, Inc. BioEssays 28: 569–573, 2006. © 2006 Wiley Periodicals, Inc. (shrink)

Amodal completion is the representation of occluded parts of perceived objects. We argue for the following three claims: First, at least some amodal completion-involved experiences can ground knowledge about the occluded portions of perceived objects. Second, at least some instances of amodal completion-grounded knowledge are not sensitive, that is, it is not the case that in the nearest worlds in which the relevant claim is false, that claim is not believed true. Third, at least some instances of amodal completion-grounded knowledge (...) are not safe, that is, it is not the case that in all or nearly all near worlds where the relevant claim is believed true, that claim is in fact true. Thus, certain instances of amodal completion-grounded knowledge refute both the view that knowledge is necessarily sensitive and the view that knowledge is necessarily safe. (shrink)

The completeness w.r.t. Kripke frames with equality (or, equivalently, w.r.t. Kripke sheaves, [ 8 ] or [4, Sect. 3.6]) is established for three superintuitionistic predicate logics: ( Q - H + D *), ( Q - H + D *&K), ( Q - H + D *& K & J ). Here Q - H is intuitionistic predicate logic, J is the principle of the weak excluded middle, K is Kuroda’s axiom, and D * (cf. [ 12 ]) is (...) a weakened version of the well-known constant domains principle D . Namely, the formula D states that any individual has ancestors in earlier worlds, and D * states that any individual has $${\neg\neg}$$ -ancestors (i.e., ancestors up to $${\neg\neg}$$ -equality) in earlier worlds. In particular, the logic ( Q - H + D *& K & J ) is the Kripke sheaf completion of ( Q - H + E & K & J ), where E is a version of Markov’s principle (cf. [ 12 ]). On the other hand, we show that the logic ( Q - H + D *& J ) is incomplete w.r.t. Kripke sheaves. (shrink)

This thesis offers a re-definition of Kantian a priorism by expanding the notions surrounding it from within a Piagetian genetic epistemological viewpoint. ;In particular, the notion of "noumenon" is re-examined from within this viewpoint, and extended to all structural facets of the genetic epistemological knowing "situation". ;By means of these re-examinations of classical epistemological notions, the various forms of knowledge characteristically produced from within the bounds of that knowing "situation" can then be structurally located with respect to intent and focus (...) of the knowing activity, thereby making it possible to show the phenomenological connection between all these forms of knowledge, as well as to legitimize each form under the canopy of a common set of functional principles, such as truth, objectivity, progress, etc. This in turn allows for a re-definition of the Piagetian scientifically oriented "epistemic subject" into what I call the "complete epistemic subject", which takes account of all the forms of knowing occurring within the structure of the genetic epistemological "situation". ;Particularly are art and science focused upon as test cases for the re-oriented a priorism presented. ;Following the epistemological argument, the classical Progressive educational argument will be re-examined to determine whether any altered approaches and educational ideals result from analyzing the meaning of the "natural man" and "democratic man" and how these analyses can be seen to refer to an expanded type of knowing subject, the "complete epistemic subject". (shrink)

The type of completeness Whitehead and Russell aimed for in their Principia Mathematica was what I call descriptive completeness. This is completeness with respect to the propositions that have been proved in traditional mathematics. The notion of completeness addressed by Gödel in his famous work of 1930 and 1931 was completeness with respect to the truths expressible in a given language. What are the relative significances of these different conceptions of completeness for traditional mathematics? (...) What, if any, effects does incompleteness of the type Gödel had in mind have for the evaluation of the Principia Mathematica project and other projects like it? (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:The Complete Poems of Tibullus: An En Face Bilingual Edition by Rodney G. DennisRobert J. BallRodney G. Dennis and Michael C. J. Putnam, trans. The Complete Poems of Tibullus: An En Face Bilingual Edition. With intro. by J. Haig Gaisser. Berkeley: University of California Press, 2012. x + 159 pp. Hardcover, $52.95, Paperback, $20.95.This welcome edition of Tibullus’ elegies contains a two-page preface, a twenty-eight-page introduction, an en (...) face bilingual text and translation of the elegies of Tibullus, Lygdamus, and Sulpicia, a seven-page section of notes, a ten-page glossary, an appendix containing a text and translation of Ovid Amores 3.9 (Ovid’s memorial to Tibullus), a select bibliography, and a general index.As related in the preface, after the death of Rodney Dennis, Curator of Manuscripts for twenty-five years at Harvard University’s Houghton Library, Michael Putnam and Julia Gaisser agreed to bring to fruition the Tibullus translation Dennis had worked on, which Dennis had wanted Gaisser to help him perfect and for which he had wanted Putnam to write the introduction. Putnam and Gaisser decided to reverse the roles that had been envisioned for them by Dennis, with the revision of the translation (and the addition of the poetry of Lygdamus and Sulpicia) diligently executed by Putnam, Professor Emeritus of Classics at Brown University, and the introduction insightfully authored by Gaisser, Professor Emerita of Latin at Bryn Mawr College.Gaisser’s introduction examines 1) the world of the Roman elegists, especially how, in an era of brilliant poets, the elegists defined their genre; 2) the themes and characters in Tibullus’ elegies and how the characters help shape the [End Page 295] arrangement of his poems; and 3) what the elegies of Lygdamus and Sulpicia have and do not have in common with those of the other elegists. Gaisser’s fine comment, “His [Tibullus’] poems glide easily, some would say dreamily, from theme to theme, moving almost like a slide show through apparently random images and musings” (1), recalls statements of some of the poet’s admirers at the dawn of the twentieth century, such as Johannes Vahlen, who likened the movement of the elegies to the tide of a summer sea. Gaisser takes the middle ground, as appropriate, in seeing Tibullus as a poet who speaks through a persona, yet who has “some (perhaps many) points in common with his creator” (7)—as he very likely does—since even within the context of his alternate universe, he touches on the contemporary world, where he refers to people and events outside the poem’s web of self-reference. Yet one may question Gaisser’s unqualified comment that “Tibullus’ poetic techniques are Alexandrian at almost every level” (17)—a thesis developed by Francis Cairns based on Hellenistic evidence of a fragmentary nature, substantiated by Alexandrian elements in some of Tibullus’ verses but with little relevance to those elegies governed by non-Alexandrian literary sources.The bilingual text and translation include the sixteen elegies written by Tibullus (1.1–10 and 2.1–6), the six by Lygdamus (3.1–6), and the six by Sulpicia (3.13–18 = 4.7–12); not included are the Panegyric of Messalla (3.7 = 4.1), the Garland of Sulpicia (3.8–12 = 4.2–6), and the elegy and epigram of debatable authorship appearing at the end of the corpus (3.19–20 = 4.13–14). In preparing this edition of the elegies, Putnam has followed, appropriately, Georg Luck’s Teubner text (Stuttgart 1988, rev. in 1998)—a text containing the most complete list of Tibullus’ manuscripts ever assembled and the most extensive citation of variants and conjectures for the poems, which Putnam supplements with his own variants. Verse form presents a serious challenge for anyone attempting to translate classical poetry into English, inasmuch as classical meters are quantitative whereas English verse is accentual; although translations of classical verses into the original meters may well result in a metrical tour de force, they tend to have a jingly sound, which can obscure and overshadow the poet’s artistry. Philip Dunlop translated some of Tibullus’ elegies into free... (shrink)

We introduce the notion of “δ-complete decision procedures” for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including transcendental functions and solutions of Lipschitz-continuous ODEs. Given an SMT problemϕ and a positive rational number δ, a δ-complete decision procedure determines either that ϕ is unsatisfiable, or that the “δ-weakening” of ϕ is satisfiable. Here, the δ-weakening of ϕ is a variant of ϕ that allows δ-bounded numerical perturbations on ϕ. We (...) establish the existence and complexity of δ-complete decision procedures for bounded SMT over reals with functions mentioned above. We propose to use δ-completeness as an ideal requirement for numerically-driven decision procedures. As a concrete example, we formally analyze the DPLL〈ICP〉 framework, which integrates Interval Constraint Propagation in DPLL, and establish necessary and sufficient conditions for its δ-completeness. We discuss practical applications of δ-complete decision procedures for correctness-critical applications including formal verification and theorem proving. (shrink)

We find the model completion of the theory modules over ������, where ������ is a finitely generated commutative algebra over a field K. This is done in a context where the field K and the module are represented by sorts in the theory, so that constructible sets associated with a module can be interpreted in this language. The language is expanded by additional sorts for the Grassmanians of all powers of $K^n $ , which are necessary to achieve quantifier elimination. (...) The result turns out to be that the model completion is the theory of a certain class of "big" injective modules. In particular, it is shown that the class of injective modules is itself elementary. We also obtain an explicit description of the types in this theory. (shrink)

We employ techniques related to Lempp and Lerman's “iterated trees of strategies” to directly measure a Σ5-predicate and use this in showing the index set of the cuppable r.e. sets to be Σ5-complete. We also show how certain technical devices arise naturally out of the iterated-trees context, in particular, links arise as manifestations of a generalized notion of “stage”.

The logics of the modal operators and of the quantifiers show striking analogies. The analogies are so extensive that, when a special class of entities (possible worlds) is postulated, natural and non-arbitrary translation procedures can be defined from the language with the modal operators into a purely quantificational one, under which the necessity and possibility operators translate into universal and existential quantifiers. In view of this I would be willing to classify the modal operators as ‘disguised’ quantifiers, and I think (...) that wholehearted acceptance of modal language should be considered to carry ontological commitment to something like possible worldsConsidered as two languages for describing the same subject matter, modal and purely quantificational languages show interesting differences. The operator variables of the purely quantificational languages give them more power than the modal languages, but at least some of the functions performed by the apparatus of operator variables are also performed, in a more primitive and less versatile way, by actuality operators in modal languages.A final note. Quine has written much on the inter-relations of quantifiers, identity, and the concept of existence. These, he holds, form a tightly knit conceptual system which has been evolved to a high point of perfection, but which might conceivably change yet further.29 He has also dropped hints about the possibility of a simpler, primitive or defective version of the system, in which the quantifiers are not backed up in their accustomed way by the concept of identity. He has dubbed the resulting concept a ‘pre-individuative’ concept of existence, or a concept of ‘entity without identity.’ What would a pre-individuative concept of existence be like? Quine has sometimes suggested that one might be embodied in the use of mass nouns, but the identity concept is used in connection with stuff as well as with things: “is that the same coffee that was in the cup last night?” I would submit that modality provides a better case. In view of the comparative weakness of modal languages, compared to the explicitly quantificational ones Quine takes as canonical, there is surely a sense in which the concept of existence embodied in that disguised existential quantifier, the possibility operator, is a defective one. And as we have seen, one of the differences between modal operators and explicit quantifiers is that modal operators cannot be joined with the identity predicate in the way quantifiers with operator variables can. Surely, then, there is a sense in which ordinary speech, as opposed to the metaphysical theorizing of a Leibniz or a David Lewis, conceives of possible worlds as entities without identity. (shrink)

Any explanation of one fact in terms of another will appeal to some sort of connection between the two. In a causal explanation, the connection might be a causal mechanism or law. But not all explanations are causal, and neither are all explanatory connections. For example, in explaining the fact that a given barn is red in terms of the fact that it is crimson, we might appeal to a non-causal connection between things’ being crimson and their being red. Many (...) such connections, like this one, are general rather than particular. I call these general non-causal explanatory connections 'laws of metaphysics'. In this paper I argue that some of these laws are to be found in the world at its most fundamental level, forming a bridge between fundamental reality and everything else. It is only by admitting fundamental laws, I suggest, that we can do justice to the explanatory relationship between what is fundamental and what is not. And once these laws are admitted, we are able to provide a nice resolution of the puzzle of why there are any non-fundamental facts in the first place. (shrink)

A common objection to the idea of public reason is that it cannot resolve fundamental political issues because it excludes too many moral considerations from the political domain. Following an important but often overlooked distinction drawn by Gerald Gaus, there are two ways to understand this objection. First, public reason is often said to be inconclusive because it fails to generate agreement on fundamental political issues. Second, and more radically, some critics have claimed that public reason is indeterminate because it (...) cannot provide any citizen with sufficient reason(s) for making important political decisions. Against the first of these objections, I argue that the purpose of public reason is not to end reasonable disagreement. Rather, it is to provide a suitable framework of values and principles within which citizens may resolve their moral and political differences. Against the second objection, I argue, first, that the indeterminacy of public reason is much less common than its inconclusiveness; and, second, that there are second-order decision-making strategies that may enable citizens to cope with cases of indeterminacy. The incompleteness of public reason, whether it takes the form of inconclusiveness or indeterminacy, is not a reason for citizens to abandon their commitment to public justification. (shrink)

In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of the system is deducible (...) by means of a formal deduction in the system. Review of the system makes the first point obvious. The purpose of the present article is to prove the second. Strong completeness is demonstrated for the Aristotelian system. (shrink)

We apply some tools developed in categorical logic to give an abstract description of constructions used to formalize constructive mathematics in foundations based on intensional type theory. The key concept we employ is that of a Lawvere hyperdoctrine for which we describe a notion of quotient completion. That notion includes the exact completion on a category with weak finite limits as an instance as well as examples from type theory that fall apart from this.

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

Here is an account of logical consequence inspired by Bolzano and Tarski. Logical validity is a property of arguments. An argument is a pair of a set of interpreted sentences (the premises) and an interpreted sentence (the conclusion). Whether an argument is logically valid depends only on its logical form. The logical form of an argument is fixed by the syntax of its constituent sentences, the meanings of their logical constituents and the syntactic differences between their non-logical constituents, treated as (...) variables. A constituent of a sentence is logical just if it is formal in meaning, in the sense roughly that its application is invariant under permutations of individuals.1 Thus ‘=’ is a logical constant because no permutation maps two individuals to one or one to two; ‘∈’ is not a logical constant because some permutations interchange the null set and its singleton. Truth functions, the usual quantifiers and bound variables also count as logical constants. An argument is logically valid if and only if the conclusion is true under every assignment of semantic values to variables (including all non-logical expressions) under which all its premises are true. A sentence is logically true if and only if the argument with no premises of which it is the conclusion is logically valid, that is, if and only if the sentence is true under every assignment of semantic values to variables. An interpretation assigns values to all variables. (shrink)

In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or natural implication) is strictly functionally complete. Further, finding axiomatizations (...) of the quasi varieties generated by the 12 logics involved (that prove to be varieties), we find naturell equational axiomatizations of these logics. Finally, applying Pynko's general theory of algebraizable sequential consequence operations, we also find equivalent natural sequentiell axiomatizations of the logics under consideration that expand either of two Pynko's sequential calculi for the constant-free truth-lattice four-valued logic. (shrink)

Halldén completeness closely resembles the relevance property. To prove Halldén completeness in terms of Kripke-style semantics, the van Benthem–Humberstone theorem is often used. In relevant modal logics, the Halldén completeness of Meyer–Fuhrmann logics has been obtained using the van Benthem–Humberstone theorem. However, there remain a number of Halldén-incomplete relevant modal logics. This paper discusses the Halldén completeness of a wider class of relevant modal logics, namely, those with some Sahlqvist axioms.

This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic (...) semantics so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.

The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment logics. In particular, (...) we provide an appropriate completeness theorem for a wide family of containment logics, and we show how to produce a complete Hilbert style axiomatization. (shrink)

In this paper, we present several extensions of epistemic logic with update operators modelling public information change. Next to the well-known public announcement operators, we also study public substitution operators. We prove many of the results regarding expressivity and completeness using so-called reduction axioms. We develop a general method for using reduction axioms and apply it to the logics at hand.

We prove completeness of the propositional modal logic S 4 for the measure algebra based on the Lebesgue-measurable subsets of the unit interval, [0, 1]. In recent talks, Dana Scott introduced a new measure-based semantics for the standard propositional modal language with Boolean connectives and necessity and possibility operators, and . Propositional modal formulae are assigned to Lebesgue-measurable subsets of the real interval [0, 1], modulo sets of measure zero. Equivalence classes of Lebesgue-measurable subsets form a measure algebra, , (...) and we add to this a non-trivial interior operator constructed from the frame of ‘open’ elements—elements in with an open representative. We prove completeness of the modal logic S 4 for the algebra . A corollary to the main result is that non-theorems of S 4 can be falsified at each point in a subset of the real interval [0, 1] of measure arbitrarily close to 1. A second corollary is that Intuitionistic propositional logic (IPC) is complete for the frame of open elements in. (shrink)

This paper uses the notion of Galois-connection to examine the relation between valuation-spaces and logics. Every valuation-space gives rise to a logic, and every logic gives rise to a valuation space, where the resulting pair of functions form a Galois-connection, and the composite functions are closure-operators. A valuation-space (resp., logic) is said to be complete precisely if it is Galois-closed. Two theorems are proven. A logic is complete if and only if it is reflexive and transitive. A valuation-space is complete (...) if and only if it is closed under formation of super-valuations. (shrink)

Response to Gover (2015) on Trogdon and Livingston (2015) on artwork completion.

In this article, we tell a story about incompleteness in modal logic. The story weaves together an article of van Benthem, “Syntactic aspects of modal incompleteness theorems,” and a longstanding open question: whether every normal modal logic can be characterized by a class of completely additive modal algebras, or as we call them, ${\cal V}$-baos. Using a first-order reformulation of the property of complete additivity, we prove that the modal logic that starred in van Benthem’s article resolves the open question (...) in the negative. In addition, for the case of bimodal logic, we show that there is a naturally occurring logic that is incomplete with respect to ${\cal V}$-baos, namely the provability logic $GLB$. We also show that even logics that are unsound with respect to such algebras do not have to be more complex than the classical propositional calculus. On the other hand, we observe that it is undecidable whether a syntactically defined logic is ${\cal V}$-complete. After these results, we generalize the Blok Dichotomy to degrees of ${\cal V}$-incompleteness. In the end, we return to van Benthem’s theme of syntactic aspects of modal incompleteness. (shrink)

We present a game semantics for Linear Logic, in which formulas denote games and proofs denote winning strategies. We show that our semantics yields a categorical model of Linear Logic and prove full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net. A key role is played by the notion of history-free strategy; strong connections are made between history-free strategies and the Geometry of Interaction. Our semantics incorporates (...) a natural notion of polarity, leading to a refined treatment of the additives. We make comparisons with related work by Joyal, Blass, et al. (shrink)

It is proved that the relevance logic \ has no structurally complete consistent axiomatic extension, except for classical propositional logic. In fact, no other such extension is even passively structurally complete.

In the Eudemian Ethics II 1, 1219a34–b8, Aristotle defines happiness as ‘the activity of a complete life in accordance with complete virtue’. Most scholars interpret a complete life as a whole lifetime, which means that happiness involves virtuous activity over an entire life. This article argues against this common reading by using Aristotle’s notion of ‘activity’ (energeia) as a touchstone. It argues that happiness, according to the Eudemian Ethics, must be a complete activity that reaches its end at any and (...) every moment. The upshot of this reading is that life reaches completeness within a lifetime and that death cannot be the requirement for making life complete. (shrink)

An algebraic setting for the validity of Pavelka style completeness for some natural expansions of Łukasiewicz logic by new connectives and rational constants is given. This algebraic approach is based on the fact that the standard MV-algebra on the real segment [0, 1] is an injective MV-algebra. In particular the logics associated with MV-algebras with product and with divisible MV-algebras are considered.

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

The paper discusses Husserl’s notion of definiteness as presented in his Göttingen Mathematical Society Double Lecture of 1901 as a defense of two, in many cases incompatible, ideals, namely full characterizability of the domain, i.e., categoricity, and its syntactic completeness. These two ideals are manifest already in Husserl’s discussion of pure logic in the Prolegomena: The full characterizability is related to Husserl’s attempt to capture the interconnection of things, whereas syntactic completeness relates to the interconnection of truths. In (...) the Prolegomena Husserl argues that an ideally complete theory gives an independent norm for objectivity for logic and experiential sciences, hence the notion is central to his argument against psychologism. In the Double Lecture the former is captured by non-extendibility, that is, categoricity of the domain, from which, so Husserl assumes, syntactic completeness is thought to follow. In the so-called ‘mathematical manifolds’ the expressions of the theory are equations that are reducible to equations between elements of the theory. With such an equational reduction structure individual elements of the domain are given criteria of identity and hence they are fully determined. (shrink)

This paper discusses Crawley completions of residuated lattices. While MacNeille completions have been studied recently in relation to logic, Crawley completions (i.e. complete ideal completions), which are another kind of regular completions, have not been discussed much in this relation while many important algebraic works on Crawley completions had been done until the end of the 70’s. In this paper, basic algebraic properties of ideal completions and Crawley completions of residuated lattices are studied first in their conncetion with the join (...) infinite distributivity and Heyting implication. Then some results on algebraic completeness and conservativity of Heyting implication in substructural predicate logics are obtained as their consequences. (shrink)