Results 41 to 50 of about 1,558,342 (70)
Distinguishing internally club and approachable on an Infinite interval
Bulletin of the London Mathematical Society, Volume 57, Issue 4, Page 1026-1039, April 2025.Abstract Krueger showed that PFA${\textsf {PFA}}$ implies that for all regular Θ⩾ℵ2$\Theta \geqslant \aleph _2$, there are stationarily many [H(Θ)]ℵ1$[H(\Theta)]^{\aleph _1}$ that are internally club but not internally approachable. From countably many Mahlo cardinals, we force a model in which, for all positive n<ω$n<\omega$ and Θ⩾ℵn+1$\Theta ...
Hannes Jakob, Maxwell Levine
wiley +1 more source
Twisted rational zeros of linear recurrence sequences
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract We introduce the notion of a twisted rational zero of a nondegenerate linear recurrence sequence (LRS). We show that any nondegenerate LRS has only finitely many such twisted rational zeros. In the particular case of the Tribonacci sequence, we show that 1/3$1/3$ and −5/3$-5/3$ are the only twisted rational zeros that are not integral zeros.
Yuri Bilu +4 more
wiley +1 more source
Strategy and Performance of Family Businesses: Comparison of Pakistan and the Czech Republic
Thunderbird International Business Review, Volume 67, Issue 1, Page 75-98, January/February 2025.ABSTRACT In this paper, we observe how effective the use of strategies is in relation to the objectives of family businesses. Data collected in spring 2024 by interviews were processed using DEA. Respondents were owners of small family businesses; 169 valid responses were obtained from each country.
Muhammad Kamal Subhani, Marie Mikušová
wiley +1 more source
Skolem sequences and additive permutations [PDF]
, 1981 A new relation between extended Skolem sequences (i.e., Skolem sequences with one zero element) and additive permutations is ...
Kotzig, Anton +3 more
core +1 more source
Skolem Meets Bateman-Horn [PDF]
The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory, and control ...
Maynard, James +4 more
core +1 more source
An Approximate Skolem Function Counter [PDF]
One approach to probabilistic inference involves counting the number of models of a given Boolean formula. Here, we are interested in inferences involving higher-order objects, i.e., functions.
Juba, Brendan +2 more
core +3 more sources
From Peirce to Skolem : a neglected chapter in the history of logic /
, 2000 This book is an account of the important influence on the development of mathematical logic of Charles S. Peirce and his student O.H. Mitchell, through the work of Ernst Schröder, Leopold Löwenheim, and Thoralf Skolem.
Brady, Geraldine.
core
, 2016 We consider the problem of computing Skolem functions for satisfied dependency quantified Boolean formulas (DQBFs). We show how Skolem functions can be obtained from an elimination-based DQBF solver and how to take preprocessing steps into account.
Wimmer, Karina +3 more
core +1 more source
On the Counting Complexity of the Skolem Problem [PDF]
The Skolem Problem asks, given an integer linear recurrence sequence (LRS), to determine whether the sequence contains a zero term or not. Its decidability is a longstanding open problem in theoretical computer science and automata theory.
Jindal, Gorav, Ouaknine, Joël
core +3 more sources
Skolem Number of Kagome Lattice Graphs [PDF]
A proper Skolem labelling of a graph $G$ is a function assigning a positive integer to each vertex of $G$ such that any two vertices assigned the same integer are that distance apart in the graph.
Martone, Max, Carrigan, Braxton
core +1 more source