Results 21 to 30 of about 109,181 (158)
A Constructive Mathematic approach for Natural Language formal grammars [PDF]
, 2009 A mathematical description of natural language grammars has been proposed first by Leibniz. After the definition given by Frege of unsaturated expression and the foundation of a logical grammar by Husserl, the application of logic to treat natural ...
Benini, Dr Marco, Gobbo, Dr Federico
core
Logic Programming as Constructivism [PDF]
, 1989 The features of logic programming that seem unconventional from the viewpoint of classical logic can be explained in terms of constructivistic logic. We motivate and propose a constructivistic proof theory of non-Horn logic programming.
Bry, François
core +1 more source
Journal of Combinatorial Designs, EarlyView.ABSTRACT In this paper, we study and characterise the natural embedding of the twisted triality hexagon T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$ in PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$. We begin by describing the possible intersections of subspaces of PG ( 7 , q 3 ) ${\mathsf{PG}}(7,{q}^{3})$ with T ( q 3 , q ) ${\mathsf{T}}({q}^{3},q)$.
Sebastian Petit, Geertrui Van de Voorde
wiley +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
Journal of Graph Theory, EarlyView.ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin +3 more
wiley +1 more source
Perspectives for proof unwinding by programming languages techniques [PDF]
, 2016 In this chapter, we propose some future directions of work, potentially beneficial to Mathematics and its foundations, based on the recent import of methodology from the theory of programming languages into proof theory.
Ilik, Danko
core +3 more sources
Constructive Gelfand duality for C*-algebras [PDF]
, 2009 We present a constructive proof of Gelfand duality for C*-algebras by reducing the problem to Gelfand duality for real C*-algebras.Comment ...
Akemann +19 more
core +5 more sources
Highly Versatile Real‐Time Optical Noise Filtering Through Temporal Cloaking
Laser &Photonics Reviews, EarlyView.Conventional bandpass filtering strategies may be insufficient for recovering optical waveforms under extremely noisy conditions. We demonstrate a temporal‐cloaking denoising strategy enabled by the temporal Talbot effect, which concentrates the coherent signal of interest into short temporal slots while broadband noise remains temporally spread.
Majid Goodarzi +5 more
wiley +1 more source
Analyzing Individual Proofs as the Basis of Interoperability between Proof Systems [PDF]
, 2017 We describe the first results of a project of analyzing in which theories formal proofs can be ex- pressed. We use this analysis as the basis of interoperability between proof systems.Comment: In Proceedings PxTP 2017, arXiv:1712 ...
Dowek, Gilles
core +2 more sources
Weak Solutions for a Class of Nonlocal Singular Problems Over the Nehari Manifold
Mathematical Methods in the Applied Sciences, EarlyView.ABSTRACT In this paper, we consider a nonlocal model of dilatant non‐Newtonian fluid with a Dirichlet boundary condition. By using the Nehari manifold and fibering map methods, we obtain the existence of at least two weak solutions, with sign information.
Zhenfeng Zhang +2 more
wiley +1 more source
Kriesel and Wittgenstein [PDF]
, 2019 Georg Kreisel (15 September 1923 - 1 March 2015) was a formidable mathematical logician during a formative period when the subject was becoming a sophisticated field at the crossing of mathematics and logic.
Kanamori, Akihiro
core