Results for ' proof complexity generators'

988 found
Order:
  1.  11
    On the Existence of Strong Proof Complexity Generators.Jan Krajíček - 2024 - Bulletin of Symbolic Logic 30 (1):20-40.
    Cook and Reckhow [5] pointed out that $\mathcal {N}\mathcal {P} \neq co\mathcal {N}\mathcal {P}$ iff there is no propositional proof system that admits polynomial size proofs of all tautologies. The theory of proof complexity generators aims at constructing sets of tautologies hard for strong and possibly for all proof systems. We focus on a conjecture from [16] in foundations of the theory that there is a proof complexity generator hard for all proof (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  25
    On the proof complexity of the nisan–wigderson generator based on a hard np ∩ conp function.Jan Krajíček - 2011 - Journal of Mathematical Logic 11 (1):11-27.
    Let g be a map defined as the Nisan–Wigderson generator but based on an NP ∩ coNP -function f. Any string b outside the range of g determines a propositional tautology τb expressing this fact. Razborov [27] has conjectured that if f is hard on average for P/poly then these tautologies have no polynomial size proofs in the Extended Frege system EF. We consider a more general Statement that the tautologies have no polynomial size proofs in any propositional proof (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  19
    Nisan-Wigderson generators in proof systems with forms of interpolation.Ján Pich - 2011 - Mathematical Logic Quarterly 57 (4):379-383.
    We prove that the Nisan-Wigderson generators based on computationally hard functions and suitable matrices are hard for propositional proof systems that admit feasible interpolation. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  3
    Proof-carrying parameters in certified symbolic execution.Andrei Arusoaie & Dorel Lucanu - forthcoming - Logic Journal of the IGPL.
    Complex frameworks for defining programming languages aim to generate various tools (e.g. interpreters, symbolic execution engines, deductive verifiers, etc.) using only the formal definition of a language. When used at an industrial scale, these tools are constantly updated, and at the same time, it is required to be trustworthy. Ensuring the correctness of such a framework is practically impossible. A solution is to generate proof objects as correctness artefacts that can be checked by an external trusted checker. A logic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  62
    Proof Systems for Planning Under Cautious Semantics.Yuping Shen & Xishun Zhao - 2013 - Minds and Machines 23 (1):5-45.
    Planning with incomplete knowledge becomes a very active research area since late 1990s. Many logical formalisms introduce sensing actions and conditional plans to address the problem. The action language $\mathcal{A}_{K}$ invented by Son and Baral is a well-known framework for this purpose. In this paper, we propose so-called cautious and weakly cautious semantics for $\mathcal{A}_{K}$ , in order to allow an agent to generate and execute reliable plans in safety-critical environments. Intuitively speaking, cautious and weakly cautious semantics enable the agent (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  78
    Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.
    We consider tautologies formed form a pseudo-random number generator, defined in Krajicek [11] and in Alekhnovich et al. [2]. We explain a strategy of proving their hardness for Extended Frege systems via a conjecture about bounded arithmetic formulated in Krajicek [11]. Further we give a purely finitary statement, in the form of a hardness condition imposed on a function, equivalent to the conjecture. This is accompanied by a brief explanation, aimed at non-specialists, of the relation between prepositional proof (...) and bounded arithmetic. (shrink)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  7.  19
    Proofs and surfaces.Djordje Baralić, Pierre-Louis Curien, Marina Milićević, Jovana Obradović, Zoran Petrić, Mladen Zekić & Rade T. Živaljević - 2020 - Annals of Pure and Applied Logic 171 (9):102845.
    A formal sequent system dealing with Menelaus' configurations is introduced in this paper. The axiomatic sequents of the system stem from 2-cycles of Δ-complexes. The Euclidean and projective interpretations of the sequents are defined and a soundness result is proved. This system is decidable and its provable sequents deliver incidence results. A cyclic operad structure tied to this system is presented by generators and relations.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  8. Martin-Löf complexes.S. Awodey & M. A. Warren - 2013 - Annals of Pure and Applied Logic 164 (10):928-956.
    In this paper we define Martin-L¨of complexes to be algebras for monads on the category of (reflexive) globular sets which freely add cells in accordance with the rules of intensional Martin-L¨of type theory. We then study the resulting categories of algebras for several theories. Our principal result is that there exists a cofibrantly generated Quillen model structure on the category of 1-truncated Martin-L¨of complexes and that this category is Quillen equivalent to the category of groupoids. In particular, 1-truncated Martin-L¨of complexes (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  9.  31
    Proof complexity of substructural logics.Raheleh Jalali - 2021 - Annals of Pure and Applied Logic 172 (7):102972.
  10.  26
    Proof complexity.Jan Krajíček - 2019 - New York, NY: Cambridge University Press.
    Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  11.  60
    Proof complexity of propositional default logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
    Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK. Hence proving lower bounds for credulous reasoning will be as hard as (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  21
    Proof Complexity and Textual Cohesion.Eli Dresner - 2015 - Journal of Logic, Language and Information 24 (1):53-64.
    In the first section of this paper I define a set of measures for proof complexity, which combine measures in terms of length and space. In the second section these measures are generalized to the broader category of formal texts. In the third section of the paper I outline several applications of the proposed theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  13
    The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.
    We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We give what is apparently the first feasible proofs of the Cayley–Hamilton theorem and other properties of the determinant, and study the propositional proof complexity of matrix identities such as AB=I→BA=I.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  14.  42
    A note on propositional proof complexity of some Ramsey-type statements.Jan Krajíček - 2011 - Archive for Mathematical Logic 50 (1-2):245-255.
    A Ramsey statement denoted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \longrightarrow (k)^2_2}$$\end{document} says that every undirected graph on n vertices contains either a clique or an independent set of size k. Any such valid statement can be encoded into a valid DNF formula RAM(n, k) of size O(nk) and with terms of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left(\begin{smallmatrix}k\\2\end{smallmatrix}\right)}$$\end{document}. Let rk be the minimal n for which the statement holds. We prove that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  15.  30
    Proof complexity of intuitionistic implicational formulas.Emil Jeřábek - 2017 - Annals of Pure and Applied Logic 168 (1):150-190.
  16.  9
    A proof complexity conjecture and the Incompleteness theorem.Jan Krajíček - forthcoming - Journal of Symbolic Logic:1-7.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  21
    Cut normal forms and proof complexity.Matthias Baaz & Alexander Leitsch - 1999 - Annals of Pure and Applied Logic 97 (1-3):127-177.
    Statman and Orevkov independently proved that cut-elimination is of nonelementary complexity. Although their worst-case sequences are mathematically different the syntax of the corresponding cut formulas is of striking similarity. This leads to the main question of this paper: to what extent is it possible to restrict the syntax of formulas and — at the same time—keep their power as cut formulas in a proof? We give a detailed analysis of this problem for negation normal form , prenex normal (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  18.  13
    Mixed computation.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 3 (2):215-244.
    Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  19.  5
    Proof complexity and feasible arithmetics, DIMACS workshop, April 21–24, 1996, edited by Paul W. Beame and Samuel R. Buss, Series in discrete mathematics and theoretical computer science, vol. 39, American Mathematical Society, Providence1998, xii + 320 pp. [REVIEW]Alexander A. Razborov - 1999 - Journal of Symbolic Logic 64 (4):1823-1825.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  20.  17
    Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.
  21.  15
    Lowerbounds in Proof Complexity.J. J. Joosten - 2007 - Bulletin of Symbolic Logic 13 (2):263-263.
  22.  18
    On the proof complexity of logics of bounded branching.Emil Jeřábek - 2023 - Annals of Pure and Applied Logic 174 (1):103181.
  23.  12
    The Multiplicative-Additive Lambek Calculus with Subexponential and Bracket Modalities.Max Kanovich, Stepan Kuznetsov & Andre Scedrov - 2020 - Journal of Logic, Language and Information 30 (1):31-88.
    We give a proof-theoretic and algorithmic complexity analysis for systems introduced by Morrill to serve as the core of the CatLog categorial grammar parser. We consider two recent versions of Morrill’s calculi, and focus on their fragments including multiplicative connectives, additive conjunction and disjunction, brackets and bracket modalities, and the! subexponential modality. For both systems, we resolve issues connected with the cut rule and provide necessary modifications, after which we prove admissibility of cut. We also prove algorithmic undecidability (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24. The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
    Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  25.  73
    The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
    Propositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms. This is article includes a broad survey of the field, and a technical exposition of some recently developed techniques for proving lower bounds on proof sizes.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  26.  11
    Jan Krajìček, Proof Complexity, Encyclopedia of Mathematics and Its Applications, no. 170, Cambridge University Press, Cambridge, UK, 2019, xvi + 516 pp. [REVIEW]Moritz Müller - 2023 - Bulletin of Symbolic Logic 29 (2):296-297.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  27.  24
    Four grades of ignorance-involvement and how they nourish the cognitive economy.John Woods - 2019 - Synthese 198 (4):3339-3368.
    In the human cognitive economy there are four grades of epistemic involvement. Knowledge partitions into distinct sorts, each in turn subject to gradations. This gives a fourwise partition on ignorance, which exhibits somewhat different coinstantiation possibilities. The elements of these partitions interact with one another in complex and sometimes cognitively fruitful ways. The first grade of knowledge I call “anselmian” to echo the famous declaration credo ut intelligam, that is, “I believe in order that I may come to know”. As (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  28. Dark Matters and Hidden Variables of Unitary Science: How Neglected Complexity Generates Mysteries and Crises, from Quantum Mechanics and Cosmology to Genetics and Global Development Risks.Andrei P. Kirilyuk - manuscript
    The unreduced many-body interaction problem solution, absent in usual science framework, reveals a new quality of emerging multiple, equally real but mutually incompatible system configurations, or “realisations”, giving rise to the universal concept of dynamic complexity and chaoticity. Their imitation by a single, “average” realisation or trajectory in usual theory (corresponding to postulated “exact” or perturbative problem solutions) is a rough simplification of reality underlying all stagnating and emerging problems of conventional (unitary) science, often in the form of missing, (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  29.  13
    Characterizing Movement Fluency in Musical Performance: Toward a Generic Measure for Technology Enhanced Learning.Victor Gonzalez-Sanchez, Sofia Dahl, Johannes Lunde Hatfield & Rolf Inge Godøy - 2019 - Frontiers in Psychology 10.
    Virtuosity in music performance is often associated with fast, precise, and efficient sound-producing movements. The generation of such highly skilled movements involves complex joint and muscle control by the central nervous system, and depends on the ability to anticipate, segment, and coarticulate motor elements, all within the biomechanical constraints of the human body. When successful, such motor skill should lead to what we characterize as fluency in musical performance. Detecting typical features of fluency could be very useful for technology-enhanced learning (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  30.  23
    Complexity of resolution proofs and function introduction.Matthias Baaz & Alexander Leitsch - 1992 - Annals of Pure and Applied Logic 57 (3):181-215.
    The length of resolution proofs is investigated, relative to the model-theoretic measure of Herband complexity. A concept of resolution deduction is introduced which is somewhat more general than the classical concepts. It is shown that proof complexity is exponential in terms of Herband complexity and that this bound is tight. The concept of R-deduction is extended to FR-deduction, where, besides resolution, a function introduction rule is allowed. As an example, consider the clause P Q: conclude P) (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  31.  34
    The Nanoneme Syndrome: Blurring of fact and fiction in the construction of a new science.Jim Gimzewski & Victoria Vesna - 2003 - Technoetic Arts 1 (1):7-24.
    In both the philosophical and visual sense, ‘seeing is believing’ does not apply to nanotechnology, for there is nothing even remotely visible to create proof of existence. On the atomic and molecular scale, data is recorded by sensing and probing in a very abstract manner, which requires complex and approximate interpretations. More than in any other science, visualization and creation of a narrative becomes necessary to describe what is sensed, not seen. Nevertheless, many of the images generated in science (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  32.  84
    The problematic value of mathematical models of evidence.Ronald J. Allen & Michael S. Pardo - 2007
    Legal scholarship exploring the nature of evidence and the process of juridical proof has had a complex relationship with formal modeling. As evident in so many fields of knowledge, algorithmic approaches to evidence have the theoretical potential to increase the accuracy of fact finding, a tremendously important goal of the legal system. The hope that knowledge could be formalized within the evidentiary realm generated a spate of articles attempting to put probability theory to this purpose. This literature was both (...)
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  33.  39
    The Newtonian Myth.E. B. Davies - 2003 - Studies in History and Philosophy of Science Part A 34 (4):763-780.
    I examine Popper’s claims about Newton’s use of induction in Principia with the actual contents of Principia and draw two conclusions. Firstly, in common with most other philosophers of his generation, it appears that Popper had very little acquaintance with the contents and methodological complexities of Principia beyond what was in the famous General Scholium. Secondly Popper’s ideas about induction were less sophisticated than those of Newton, who recognised that it did not provide logical proofs of the results obtained using (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  28
    Authority, Reading, Reflexivity: Pierre Bourdieu and the Aesthetic Judgment of Kant.Alex Martin & Koenraad Geldof - 1997 - Diacritics 27 (1):20-43.
    In lieu of an abstract, here is a brief excerpt of the content:Authority, Reading, Reflexivity: Pierre Bourdieu and the Aesthetic Judgment of KantKoenraad Geldof (bio)Translated by Alex Martin (bio)1. AuthorityFor some time now, Pierre Bourdieu has been a true author 1 —a producer, in other words, of an impressive number of theoretical and analytical discourses in a wide variety of research fields. 2 Whether in anthropology or ethnology, in the sociology of institutions or of the structure and workings of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  35.  93
    Prolegomena to a cognitive investigation of Euclidean diagrammatic reasoning.Yacin Hamami & John Mumma - 2013 - Journal of Logic, Language and Information 22 (4):421-448.
    Euclidean diagrammatic reasoning refers to the diagrammatic inferential practice that originated in the geometrical proofs of Euclid’s Elements. A seminal philosophical analysis of this practice by Manders (‘The Euclidean diagram’, 2008) has revealed that a systematic method of reasoning underlies the use of diagrams in Euclid’s proofs, leading in turn to a logical analysis aiming to capture this method formally via proof systems. The central premise of this paper is that our understanding of Euclidean diagrammatic reasoning can be fruitfully (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  36.  35
    Introduction.Ullrich Melle - 2007 - Ethical Perspectives 14 (4):361-370.
    IntroductionIn May 2006, the small group of doctoral students working on ecophilosophy at the Higher Institute of Philosophy at K.U.Leuven invited the Dutch environmental philosopher Martin Drenthen to a workshop to discuss his writings on the concept of wilderness, its metaphysical and moral meaning, and the challenge social constructivism poses for ecophilosophy and environmental protection. Drenthen’s publications on these topics had already been the subject of intense discussions in the months preceding the workshop. His presentation on the workshop and the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  11
    Intrinsic reasoning about functional programs I: first order theories.Daniel Leivant - 2002 - Annals of Pure and Applied Logic 114 (1-3):117-153.
    We propose a rudimentary formal framework for reasoning about recursion equations over inductively generated data. Our formalism admits all equational programs , and yet singles out none. While being simple, this framework has numerous extensions and applications. Here we lay out the basic concepts and definitions; show that the deductive power of our formalism is similar to that of Peano's Arithmetic; prove a strong normalization theorem; and exhibit a mapping from natural deduction derivations to an applied λ -calculus, à la (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  38. Euripides' Hippolytus.Sean Gurd - 2012 - Continent 2 (3):202-207.
    The following is excerpted from Sean Gurd’s translation of Euripides’ Hippolytus published with Uitgeverij this year. Though he was judged “most tragic” in the generation after his death, though more copies and fragments of his plays have survived than of any other tragedian, and though his Orestes became the most widely performed tragedy in Greco-Roman Antiquity, during his lifetime his success was only moderate, and to him his career may have felt more like a failure. He was regularly selected to (...)
    No categories
     
    Export citation  
     
    Bookmark  
  39.  29
    Imagining Karma, Ethical Transformation in Amerindian, Buddhist and Greek Rebirth (review).A. L. Herman - 2004 - Buddhist-Christian Studies 24 (1):303-306.
    In lieu of an abstract, here is a brief excerpt of the content:Reviewed by:Imagining Karma, Ethical Transformation in Amerindian, Buddhist, and Greek RebirthA. L. HermanImagining Karma, Ethical Transformation in Amerindian, Buddhist, and Greek Rebirth. By Gananath Obeyesekere. Berkeley: University of California Press, 2002. 448 pp.Gananath Obeyesekere, professor emeritus of anthropology at Princeton University, is probably one of the world's greatest living anthropologists. The proof of that assertion lies in this his latest work on comparative anthropology, a study of the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40.  6
    Styles of Discourse.Ioannis Vandoulakis & Tatiana Denisova (eds.) - 2021 - Kraków: Instytut Filozofii, Uniwersytet Jagielloński w Krakowie.
    The volume starts with the paper of Lynn Maurice Ferguson Arnold, former Premier of South Australia and former Minister of Education of Australia, concerning the Exposition Internationale des Arts et Techniques dans la Vie Moderne (International Exposition of Art and Technology in Modern Life) that was held from 25 May to 25 November 1937 in Paris, France. The organization of the world exhibition had placed the Nazi German and the Soviet pavilions directly across from each other. Many papers are devoted (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  41.  19
    The "Herbert Butterfield Problem" and Its Resolution.Keith C. Sewell - 2003 - Journal of the History of Ideas 64 (4):599.
    In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Ideas 64.4 (2003) 599-618 [Access article in PDF] The "Herbert Butterfield Problem" and its Resolution Keith C. Sewell Dordt College Herbert Butterfield (1900-1979) 1 published The Whig Interpretation of History in 1931, a year after he became a Lecturer in the University of Cambridge. 2 He became Professor of Modern History in the university in 1944, the same year in which he published The (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  42. Meillassoux’s Virtual Future.Graham Harman - 2011 - Continent 1 (2):78-91.
    continent. 1.2 (2011): 78-91. This article consists of three parts. First, I will review the major themes of Quentin Meillassoux’s After Finitude . Since some of my readers will have read this book and others not, I will try to strike a balance between clear summary and fresh critique. Second, I discuss an unpublished book by Meillassoux unfamiliar to all readers of this article, except those scant few that may have gone digging in the microfilm archives of the École normale (...)
     
    Export citation  
     
    Bookmark   2 citations  
  43.  95
    The Age of Enlightenment.Alan Charles Kors - 2013 - In Stephen Bullivant & Michael Ruse (eds.), The Oxford Handbook of Atheism. Oxford University Press UK.
    This article discusses the meanings, origin, context, scope, and central intellectual claims of atheism in the Age of the European Enlightenment. It emphasizes debates about proofs of the existence of God and about the problem of categorical naturalism, that is, of whether or not the world we observe and its seeming design could be the product of unintelligent causes. It explores the philosophical origins of Enlightenment atheism both in prior heterodox and Epicurean thought, and, of even greater importance, in the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  44.  22
    Intuition and heuristics in mathematics.L. B. Sultanova - 2013 - Liberal Arts in Russia 2 (3):237.
    The article is devoted to philosophy of mathematics. Mathematical heuristics, being a complex of methods for solving the non-standard problems of mathematics (such problems which have no known algorithms to be solved), is the main subject of the research. As a specific mechanism for thinking, generating elements of guesswork needed as the basis of mathematical heuristics, the author considers intuition. In the work, the author uses Descartes’s, Poincaré’s, Hadamard’s and Piaget’s findings. Based on Descartes’s concept of rational intuition, the author (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  19
    Jacek Pasnic/ck.Complex Properties Do We Need & Inour Ontology - 2006 - In J. Jadacki & J. Pasniczek (eds.), The Lvov-Warsaw School: The New Generation. Reidel. pp. 113.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  46.  37
    Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.
    We consider the problem about the length of proofs of the sentences $\operatorname{Con}_S(\underline{n})$ saying that there is no proof of contradiction in S whose length is ≤ n. We show the relation of this problem to some problems about propositional proof systems.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  47. Does the Principle of Compositionality Explain Productivity? For a Pluralist View of the Role of Formal Languages as Models.Ernesto Perini-Santos - 2017 - Contexts in Philosophy 2017 - CEUR Workshop Proceedings.
    One of the main motivations for having a compositional semantics is the account of the productivity of natural languages. Formal languages are often part of the account of productivity, i.e., of how beings with finite capaci- ties are able to produce and understand a potentially infinite number of sen- tences, by offering a model of this process. This account of productivity con- sists in the generation of proofs in a formal system, that is taken to represent the way speakers grasp (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  48.  11
    Review: Paul W. Beame, Samuel R. Buss, Proof Complexity and Feasible Arithmetics, DIMACS Workshop, April 21-24, 1996. [REVIEW]Alexander A. Razborov - 1999 - Journal of Symbolic Logic 64 (4):1823-1825.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  38
    Visual Complexity and Its Effects on Referring Expression Generation.Micha Elsner, Alasdair Clarke & Hannah Rohde - 2018 - Cognitive Science 42 (S4):940-973.
    Speakers’ perception of a visual scene influences the language they use to describe it—which objects they choose to mention and how they characterize the relationships between them. We show that visual complexity can either delay or facilitate description generation, depending on how much disambiguating information is required and how useful the scene's complexity can be in providing, for example, helpful landmarks. To do so, we measure speech onset times, eye gaze, and utterance content in a reference production experiment (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  50.  28
    Three Generations of Complexity Theories: Nuances and ambiguities.Michel Alhadeff-Jones - 2008 - Educational Philosophy and Theory 40 (1):66-82.
    The contemporary use of the term ‘complexity’ frequently indicates that it is considered a unified concept. This may lead to a neglect of the range of different theories that deal with the implications related to the notion of complexity. This paper, integrating both the English and the Latin traditions of research associated with this notion, suggests a more nuanced use of the term, thereby avoiding simplification of the concept to some of its dominant expressions only. The paper further (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
1 — 50 / 988