Results 21 to 30 of about 39,231 (218)

“Somos criaturas de la lógica y no del silencio”: la unidad proposicional según Alberto Moretti

Análisis Filosófico, 2020
En este comentario me refiero a algunos aspectos de la propuesta de Moretti acerca del problema de la unidad proposicional, basada en su interpretación de las ideas de Frege y Davidson.
Silvia Carolina Scotto
doaj   +1 more source

A Study of Frege’s Influence on A. J. Ayer’s Theory of Emotivism [PDF]

Pizhūhish/hā-yi Falsafī- Kalāmī, 2020
No doubt, Gottlob Frege and A. J. Ayer are considered to be among the most prominent contemporary philosophers. Insofar as one of them has revolutionized the linguistic domain while the other has influenced the domain of ethics in a diametrical fashion ...
Mohsen Shiravand
doaj   +1 more source

Polylogarithmic Cuts in Models of V^0 [PDF]

, 2013
We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one.
Müller, Sebastian
core   +2 more sources

Mill on logic [PDF]

, 2017
Working within the broad lines of general consensus that mark out the core features of John Stuart Mill’s (1806–1873) logic, as set forth in his A System of Logic (1843–1872), this chapter provides an introduction to Mill’s logical theory by reviewing ...
DeMorgan, Ducheyne, Frege, Frege, Frege, Frege, Fumerton, Godden, Godden, Hodges, Leibniz, Macleod, Russell, Russell, Scarre, Scarre, Skorupski, Skorupski, Whewell   +18 more
core   +1 more source

Implicit Resolution [PDF]

, 2013
Let \Omega be a set of unsatisfiable clauses, an implicit resolution refutation of \Omega is a circuit \beta with a resolution proof {\alpha} of the statement "\beta describes a correct tree-like resolution refutation of \Omega". We show that such system
Wang, Zi Chao
core   +2 more sources

The deduction theorem for strong propositional proof systems [PDF]

, 2007
This paper focuses on the deduction theorem for propositional logic. We define and investigate different deduction properties and show that the presence of these deduction properties for strong proof systems is powerful enough to characterize the ...
C. Glaßer, C. Glaßer, C. Glaßer, C. Glaßer, J. Grollmann, J. Krajíček, J. Krajíček, J. Köbler, M.L. Bonet, M.L. Bonet, O. Beyersdorff, P. Pudlák, S. Homer, S.A. Cook, S.A. Cook, Z. Sadowski   +15 more
core   +6 more sources

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs [PDF]

, 2019
This paper studies propositional proof systems in which lines are sequents of decision trees or branching programs, deterministic or non-deterministic.
Buss, Sam, Das, Anupam, Knop, Alexander
core   +4 more sources

The bad company objection and the extensionality of Frege’s logic

Perspectiva Filosófica, 2020
Segundo a objeção da Má Companhia, o fato de que a infame Lei Básica V de Frege proporciona o padrão de definição geral dos princípios de abstração superior é uma boa razão para duvidar da validade deste tipo de definições.
Vincenzo Ciccarelli
doaj   +1 more source

As concepções filosóficas interlocutoras do realismo de Gottlob Frege

Kalagatos, 2023
RESUMO: O objetivo deste artigo é caracterizar as posições filosóficas antagônicas à visão realista de lógica e matemática subscrita por Gottlob Frege, que são três: psicologismo idealista, psicologismo empirista e formalismo puro.
Vinícius Rodrigues Maione
doaj  

Different Approaches to Proof Systems [PDF]

, 2010
The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies. This approach has been intensively studied since the late 70’s
Beyersdorff, O, Mueller, S
core   +1 more source