Results for 'non-arbitrage theorem'

1000+ found
Order:
  1. Non-Arbitrage In Financial Markets: A Bayesian Approach for Verification.Julio Michael Stern & Fernando Valvano Cerezetti - 2012 - AIP Conference Proceedings 1490:87-96.
    The concept of non-arbitrage plays an essential role in finance theory. Under certain regularity conditions, the Fundamental Theorem of Asset Pricing states that, in non-arbitrage markets, prices of financial instruments are martingale processes. In this theoretical framework, the analysis of the statistical distributions of financial assets can assist in understanding how participants behave in the markets, and may or may not engender arbitrage conditions. Assuming an underlying Variance Gamma statistical model, this study aims to test, using (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  13
    Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
  3.  17
    On Shavrukov’s Non-Isomorphism Theorem for Diagonalizable Algebras.Evgeny A. Kolmakov - 2024 - Review of Symbolic Logic 17 (1):206-243.
    We prove a strengthened version of Shavrukov’s result on the non-isomorphism of diagonalizable algebras of two $\Sigma _1$ -sound theories, based on the improvements previously found by Adamsson. We then obtain several corollaries to the strengthened result by applying it to various pairs of theories and obtain new non-isomorphism examples. In particular, we show that there are no surjective homomorphisms from the algebra $(\mathfrak {L}_T, \Box _T\Box _T)$ onto the algebra $(\mathfrak {L}_T, \Box _T)$. The case of bimodal diagonalizable algebras (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  14
    A non-splitting theorem in the enumeration degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
    We complete a study of the splitting/non-splitting properties of the enumeration degrees below by proving an analog of Harrington’s non-splitting theorem for the enumeration degrees. We show how non-splitting techniques known from the study of the c.e. Turing degrees can be adapted to the enumeration degrees.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  9
    A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
  6.  42
    A non-splitting theorem for d.r.e. sets.Xiaoding Yi - 1996 - Annals of Pure and Applied Logic 82 (1):17-96.
    A set of natural numbers is called d.r.e. if it may be obtained from some recursively enumerable set by deleting the numbers belonging to another recursively enumerable set. Sacks showed that for each non-recursive recursively enumerable set A there are disjoint recursively enumerable sets B, C which cover A such that A is recursive in neither A ∩ B nor A ∩ C. In this paper, we construct a counterexample which shows that Sacks's theorem is not in general true (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  2
    Completely non-clausal theorem proving.Neil V. Murray - 1982 - Artificial Intelligence 18 (1):67-85.
  8.  30
    Private Information and the 'Information Function': A Survey of Possible Uses. [REVIEW]Emmanuel Haven - 2008 - Theory and Decision 64 (2-3):193-228.
    Under certain conditions private information can be a source of trade. Arbitrage for instance can occur as a result of the existence of private information. In this paper we want to explicitly model information. To do so we define an ‘information function’. This information function is a mathematical object, also known as a so called ‘wave function’. We use the definition of wave function as it is used in quantum mechanics and we attempt to show the usefulness of this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  9.  10
    A Non‐Representation Theorem for Gödel‐Bernays Set Theory.Erik Ellentuck - 1970 - Mathematical Logic Quarterly 16 (6):341-345.
  10.  6
    A Non-Interpolation Theorem.E. G. K. Lopez-Escobar - 1975 - Journal of Symbolic Logic 40 (3):457-458.
  11.  51
    Arbitrage and the Dutch Book Theorem.Robert Titiev - 1997 - Journal of Philosophical Research 22:477-482.
    Philosophical writing on probability theory includes a great many articles discussing relationships between rational behavior and an agent’s susceptibility to betting contexts where an overall loss is mathematically inevitable. What the dutch book theorem establishes is that this kind of susceptibility is a consequence of having betting ratios that are in violation of the Kolmogorov probability axioms. In this article it is noted that a general result to rule out arbitrage can be shown to yield the dutch book (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  12.  13
    Arbitrage and the Dutch Book Theorem.Robert Titiev - 1997 - Journal of Philosophical Research 22:477-482.
    Philosophical writing on probability theory includes a great many articles discussing relationships between rational behavior and an agent’s susceptibility to betting contexts where an overall loss is mathematically inevitable. What the dutch book theorem establishes is that this kind of susceptibility is a consequence of having betting ratios that are in violation of the Kolmogorov probability axioms. In this article it is noted that a general result to rule out arbitrage can be shown to yield the dutch book (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13. Non-separability Does Not Relieve the Problem of Bell’s Theorem.Joe Henson - 2013 - Foundations of Physics 43 (8):1008-1038.
    This paper addresses arguments that “separability” is an assumption of Bell’s theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as “holism”) will allow us to restore a satisfying locality principle. Separability here means that all events associated to the union of some set of disjoint regions are combinations of events associated to each region taken separately.In this article, it is shown that: (a) localised events can be consistently defined without implying (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  14. Non-Local Realistic Theories and the Scope of the Bell Theorem.Federico Laudisa - 2008 - Foundations of Physics 38 (12):1110-1132.
    According to a widespread view, the Bell theorem establishes the untenability of so-called ‘local realism’. On the basis of this view, recent proposals by Leggett, Zeilinger and others have been developed according to which it can be proved that even some non-local realistic theories have to be ruled out. As a consequence, within this view the Bell theorem allows one to establish that no reasonable form of realism, be it local or non-local, can be made compatible with the (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  15.  18
    Non-standard analysis in ACA0 and Riemann mapping theorem.Keita Yokoyama - 2007 - Mathematical Logic Quarterly 53 (2):132-146.
    This research is motivated by the program of reverse mathematics and non-standard arguments in second-order arithmetic. Within a weak subsystem of second-order arithmetic ACA0, we investigate some aspects of non-standard analysis related to sequential compactness. Then, using arguments of non-standard analysis, we show the equivalence of the Riemann mapping theorem and ACA0 over WKL0. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim).
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  16.  17
    Lopez-Escobar E. G. K.. A non-interpolation theorem. English with Russian summary. Bulletin de l'Académic Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 17 , pp. 109–112, V. [REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (3):457-458.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  17.  11
    Review: E. G. K. Lopez-Escobar, A Non-Interpolation Theorem[REVIEW]H. B. Enderton - 1975 - Journal of Symbolic Logic 40 (3):457-458.
  18.  21
    Automated Theorem-proving in Non-classical Logics.Paul B. Thistlewaite, Michael A. McRobbie & Robert K. Meyer - 1988 - Pitman Publishing.
  19.  36
    Non-Markovian causality in the social sciences with some theorems on transitivity.Patrick Suppes - 1986 - Synthese 68 (1):129 - 140.
    The author argues for the importance of non-Markovian causality in the social sciences because Markovian conditions often cannot be satisfied. Two theorems giving conditions for non-Markovian causes to be transitive are proved. Applications of non-Markovian causality in psychology and economics are outlined.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  20.  36
    Gödel theorems for non-constructive logics.Barkley Rosser - 1937 - Journal of Symbolic Logic 2 (3):129-137.
  21.  31
    Non-Locality as a Fundamental Principle of Reality: Bell's Theorem and Space-Like Interconnectedness.A. Rauscher Elizabeth - 2017 - Cosmos and History 13 (2):204-216.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  16
    Herbrand's theorem and non-euclidean geometry.Pierre Boutry And Julien Narboux Michael Beeson - 2015 - Bulletin of Symbolic Logic 21 (2):111-122.
  23.  90
    Non-contextuality, finite precision measurement and the Kochen–Specker theorem.Jonathan Barrett & Adrian Kent - 2004 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 35 (2):151-176.
  24.  20
    Non-contextuality, finite precision measurement and the Kochen–Specker theorem.Jonathan Barrett & Adrian Kent - 2004 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 35 (2):151-176.
  25.  29
    Basis theorems for non-potentially closed sets and graphs of uncountable borel chromatic number.Dominique Lecomte & Benjamin D. Miller - 2008 - Journal of Mathematical Logic 8 (2):121-162.
    We show that there is an antichain basis for neither the class of non-potentially closed Borel subsets of the plane under Borel rectangular reducibility nor the class of analytic graphs of uncountable Borel chromatic number under Borel reducibility.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  26.  21
    Non-constructive Proofs of a Metamathematical Theorem Concerning the Consistency of Analysis and its Extension.Sh^|^Ocirc Maehara, Ji, Toshio Nishimura & Setsuya Seki - 1960 - Annals of the Japan Association for Philosophy of Science 1 (5):269-288.
  27.  9
    Non-constructive Proofs of a Metamathematical Theorem Concerning the Consistency of Analysis and its Extension.Shôji Maehara, Toshio Nishimura & Setsuya Seki - 1960 - Annals of the Japan Association for Philosophy of Science 1 (5):269-288.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  28.  12
    A Non-Heuristic Program for Proving Elementary Logical Theorems.B. Dunham, R. Fridshal, G. L. Sward & J. H. North - 1967 - Journal of Symbolic Logic 32 (2):266-266.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  29.  39
    The gärdenfors impossibility theorem in non-monotonic contexts.David Makinson - 1990 - Studia Logica 49 (1):1 - 6.
    Gärdenfors' impossibility theorem draws attention to certain formal difficulties in defining a conditional connective from a notion of theory revision, via the Ramsey test. We show that these difficulties are not avoided by taking the background inference operation to be non-monotonic.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  30.  6
    Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.
  31.  19
    Non‐Effectiveness in S. Orey's Arithmetical Compactness Theorem.R. G. Jeroslow - 1971 - Mathematical Logic Quarterly 17 (1):285-289.
  32.  6
    A Non‐Boolean Version of Feferman‐Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Mathematical Logic Quarterly 31 (19‐20):299-308.
  33.  23
    A Non-Boolean Version of Feferman-Vaught's Theorem.R. Lavendhomme & Th Lucas - 1985 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 31 (19-20):299-308.
  34. Counterfactuals and non-locality of quantum mechanics: The bedford–stapp version of the GHZ theorem.Tomasz Bigaj - 2007 - Foundations of Science 12 (1):85-108.
    In the paper, the proof of the non-locality of quantum mechanics, given by Bedford and Stapp (1995), and appealing to the GHZ example, is analyzed. The proof does not contain any explicit assumption of realism, but instead it uses formal methods and techniques of the Lewis calculus of counterfactuals. To ascertain the validity of the proof, a formal semantic model for counterfactuals is constructed. With the help of this model it can be shown that the proof is faulty, because it (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  35.  31
    Products of non-additive measures: a Fubini-like theorem.Christian Bauer - 2012 - Theory and Decision 73 (4):621-647.
    For non-additive set functions, the independent product, in general, is not unique and the Fubini theorem is restricted to slice-comonotonic functions. In this paper, we use the representation theorem of Gilboa and Schmeidler (Math Oper Res 20:197–212, 1995) to extend the Möbius product for non-additive set functions to non-finite spaces. We extend the uniqueness result of Ghirardato (J Econ Theory 73:261–291, 1997) for products of two belief functions and weaken the requirements on the marginals necessary to obtain the (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  36.  14
    Cut Elimination Theorem for Non-Commutative Hypersequent Calculus.Andrzej Indrzejczak - 2017 - Bulletin of the Section of Logic 46 (1/2).
    Hypersequent calculi can formalize various non-classical logics. In [9] we presented a non-commutative variant of HC for the weakest temporal logic of linear frames Kt4.3 and some its extensions for dense and serial flow of time. The system was proved to be cut-free HC formalization of respective temporal logics by means of Schütte/Hintikka-style semantical argument using models built from saturated hypersequents. In this paper we present a variant of this calculus for Kt4.3 with a constructive syntactical proof of cut elimination.
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  37.  52
    Link between the non abelian stokes theorem and the b cyclic theorem.S. Roy - 1999 - Apeiron 6:P3 - 4.
    It is demonstrated that a non Abelian Stokes Theorem is necessary to describe the B3 field of radiation. A simple form of the theorem is build up from the fundamental definition of B3 in O(3) gauge field theory, which is a gauge field theory applied to electrodynamics with an O(3) internal gauge symmetry bases on a complex basis ((1), (2), (3)). The indices (1) and (2) are complex conjugate pairs based on circular polarization, and the index (3) is (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  10
    Herbrand’s theorem and non-euclidean geometry.Michael Beeson, Pierre Boutry & Julien Narboux - 2015 - Bulletin of Symbolic Logic 21 (2):111-122.
    We use Herbrand’s theorem to give a new proof that Euclid’s parallel axiom is not derivable from the other axioms of first-order Euclidean geometry. Previous proofs involve constructing models of non-Euclidean geometry. This proof uses a very old and basic theorem of logic together with some simple properties of ruler-and-compass constructions to give a short, simple, and intuitively appealing proof.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  39.  49
    Models of non-well-founded sets via an indexed final coalgebra theorem.Benno van Den Berg & Federico de Marchi - 2007 - Journal of Symbolic Logic 72 (3):767-791.
    The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on finitely complete and cocomplete categories. As an instance of this result, we build the final coalgebra for the powerclass functor, in the context of a Heyting pretopos with a class of small maps. This is then proved to provide models for various non-well-founded set theories, depending on the chosen (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40.  23
    Löwenheim–Skolem theorems for non-classical first-order algebraizable logics: Table 1.Pilar Dellunde, Àngel García-Cerdaña & Carles Noguera - 2016 - Logic Journal of the IGPL 24 (3):321-345.
  41. Quantum non-locality and relativity: metaphysical intimations of modern physics.Tim Maudlin - 1994 - Malden, Mass.: Blackwell.
    Quantum Non-Locality and Relativity is recognized as the premier philosophical study of Bell's Theorem and its implication for the relativistic account of space and time. Previous editions have been praised for the remarkable clarity of Maudlin's descriptions of both Bell's theorem and his examination of the potential conflict between the theorem and relativity. The third edition of this text has been carefully updated to reflect significant developments, including a new chapter covering important recent work in the foundations (...)
    Direct download  
     
    Export citation  
     
    Bookmark   105 citations  
  42.  19
    An unpublished theorem of Solovay on OD partitions of reals into two non-OD parts, revisited.Ali Enayat & Vladimir Kanovei - 2020 - Journal of Mathematical Logic 21 (3):2150014.
    A definable pair of disjoint non-OD sets of reals exists in the Sacks and ????0-large generic extensions of the constructible universe L. More specifically, if a∈2ω is eith...
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  43.  2
    Some More Theorems on Structural Entailment Relations and Non-deterministic Semantics.Carlos Caleiro, Sérgio Marcelino & Umberto Rivieccio - 2024 - In Jacek Malinowski & Rafał Palczewski (eds.), Janusz Czelakowski on Logical Consequence. Springer Verlag. pp. 345-375.
    We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations—nowadays more commonly called multiple-conclusion logics—to the setting of non-deterministic matrices (Nmatrices), characterizing the Nmatrix models of an arbitrary logic through a generalization of the standard class operators to the non-deterministic setting. We highlight the main differences that appear in this more general setting, in particular: the possibility to obtain Nmatrix quotients using any compatible equivalence relation (not necessarily a congruence); the (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  44. " Cogito ergo sum non machina!" About Gödel's first incompleteness theorem and turing machines.Ricardo Pereira Tassinari & Itala M. Loffredo D'Ottaviano - 2007 - Cogito 7:3.
  45.  15
    A stronger theorem concerning the non-existence of combinatorial designs on infinite sets.William J. Frascella - 1973 - Notre Dame Journal of Formal Logic 14 (4):554-558.
  46.  39
    Analog of Herbrand's Theorem for [non] Prenex Formulas of Constructive Predicate Calculus.J. van Heijenoort, G. E. Mints & A. O. Slisenko - 1971 - Journal of Symbolic Logic 36 (3):525.
  47.  58
    Gentzen’s Cut Elimination Theorem for Non-Logicians.Larry W. Miller - 1972 - Tulane Studies in Philosophy 21:115-126.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  48.  5
    Gentzen’s Cut Elimination Theorem for Non-Logicians.Larry W. Miller - 1972 - Tulane Studies in Philosophy 21:115-126.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  42
    Distributional equality in non-classical utilitarianism — A proof of Lerner's theorem for ‘utilitarianism incorporating justice’.A. Schäfer & R. W. Trapp - 1989 - Theory and Decision 26 (2):157-173.
  50.  37
    Discussion: The non-reducibility of Koopman's theorems of probability in Carnap's system for mc.Robert M. Jones - 1965 - Philosophy of Science 32 (3/4):368.
    Carnap gives a definition for a comparative concept of confirmation. For it he uses the notation “MC.” His defined notation is intended to be an explicatum for the explicandum: “the hypothesis h is confirmed by the evidence e equally strongly or more strongly than h′ by e′”.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000