Results 201 to 210 of about 2,143,165 (258)
Episode clustering in phylogenetic networks. [PDF]
BioinformaticsGórecki P, Mykowiecka A, Paszek J.
europepmc +1 more source
Some of the next articles are maybe not open access.
Which Mathematical Logic is the Logic of Mathematics?
Logica Universalis, 2012The main tool of the arithmetization and logization of analysis in the history of nineteenth century mathematics was an informal logic of quantifiers in the guise of the “epsilon–delta” technique. Mathematicians slowly worked out the problems encountered in using it, but logicians from Frege on did not understand it let alone formalize it, and instead ...
Jaakko Hintikka
exaly +2 more sources
The modal logic of Reverse Mathematics [PDF]
Archive for Mathematical Logic, 2015 The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to formalize the logic of Reverse Mathematics into a system that we name s-logic.
Carl Mummert
exaly +4 more sources
Counterfactual Logic and the Necessity of Mathematics [PDF]
Journal of Philosophical Logic, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samuel Z Elgin
exaly +2 more sources
2007
Abstract Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic.
Ian Chiswell, Wilfrid Hodges
openaire +2 more sources
Abstract Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic.
Ian Chiswell, Wilfrid Hodges
openaire +2 more sources
IF logic and the foundations of mathematics
Synthese, 2001One of the properties of independence friendly (IF) first-order logic as discussed, e.g., by \textit{J. Hintikka} in his ``The principles of mathematics revisited'' [Cambridge University Press, Cambridge (1996; Zbl 0869.03003)] is that ``it defines its own truth-predicate in certain models, like for instance, in the standard model \(N\) of PA'' (p. 40).
Gabriel Sandu, Tapani Hyttinen
openaire +2 more sources
Descriptions in mathematical logic
Studia Logica, 1984If A(x) is a predicate satisfied by exactly one x, then we write Ix.A(x) for that object x. The operator I is called a descriptor. The author reviews the various treatments of descriptors in the literature, pointing out that the problem each treatment faces is ''what to do with Ix.A(x) when \(\exists !xA(x)\) is not (yet) known''. The obvious answer is
Gerard R. Renardel, null de Lavalette
openaire +2 more sources